Family:''; font-Size:14px; line-height22px; white-Space:normal; background-color#FFFFFF;The Java implementation of >DBSCAN algorithm is a DBSCAN based density clustering algorithm. Its basic principle is to give two parameters, zeta and MINP, where zeta can be interpreted as radius, and the algorithm will find samples in this radius. MINP is a limiting condition of n with the radius of zeta as the sample. The sample point is the core sample point as long as n>=minp is found.
Tips: You can preview the content of files by clicking file clicking