Paper
26 February 2010 Study of improved adaptive mountain clustering algorithm
Qing Deng, Jianhui Liu
Author Affiliations +
Proceedings Volume 7546, Second International Conference on Digital Image Processing; 75461L (2010) https://doi.org/10.1117/12.855081
Event: Second International Conference on Digital Image Processing, 2010, Singapore, Singapore
Abstract
In the problem of determining number of clustering and initial cluster centers, the mountain clustering algorithm was a simple and effective algorithm, it was a kind of clustering algorithm which could cluster sample set approximately and also could be used as the basis of other cluster analysis, which could provide initial cluster centers for other clustering algorithms. The improved algorithm of it was subtractive clustering, which had a great improvement in solving the problem of low efficiency of large sample set for mountain clustering, but its adaptability was not perfect. Therefore, put forward the regionalism adaptable mountain clustering algorithm, which based on the traditional mountain clustering algorithm divided sample set into regions and chose sample points of the largest weight to calculate their best initial value. Experimental results showed that the algorithm had stronger adaptability and accuracy of clustering, moreover speed was improved.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Qing Deng and Jianhui Liu "Study of improved adaptive mountain clustering algorithm", Proc. SPIE 7546, Second International Conference on Digital Image Processing, 75461L (26 February 2010); https://doi.org/10.1117/12.855081
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Data centers

Statistical analysis

Data mining

Iris

Computer simulations

Dimension reduction

Current controlled current source

Back to Top