Research and Improvement Method Based on k-mean Clustering Algorithm
- Guohua Zhang
- Kangting Zhao
- Yi Li
Abstract
In view of the sensitivity of the traditional mean algorithm to outliers and noise points, an improved mean algorithm is proposed in this paper, which is based on the density of the distribution of objects in space. In the measurement of density, the sensitivity of clustering effect to initial parameters is reduced. The improved algorithm can filter the "noise" data and discover the clustering of arbitrary shapes, which is obviously superior to the standard mean algorithm.- Full Text: PDF
- DOI:10.5539/cis.v12n1p49
This work is licensed under a Creative Commons Attribution 4.0 License.
Journal Metrics
WJCI (2022): 0.636
Impact Factor 2022 (by WJCI): 0.419
h-index (January 2024): 43
i10-index (January 2024): 193
h5-index (January 2024): N/A
h5-median(January 2024): N/A
( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )
Index
- Academic Journals Database
- BASE (Bielefeld Academic Search Engine)
- CiteFactor
- CNKI Scholar
- COPAC
- CrossRef
- DBLP (2008-2019)
- EBSCOhost
- EuroPub Database
- Excellence in Research for Australia (ERA)
- Genamics JournalSeek
- Google Scholar
- Harvard Library
- Infotrieve
- LOCKSS
- Mendeley
- PKP Open Archives Harvester
- Publons
- ResearchGate
- Scilit
- SHERPA/RoMEO
- Standard Periodical Directory
- The Index of Information Systems Journals
- The Keepers Registry
- UCR Library
- Universe Digital Library
- WJCI Report
- WorldCat
Contact
- Chris LeeEditorial Assistant
- cis@ccsenet.org