A Data Mining Algorithm Based on Improved K-Means Clustering

Yang Zheng

doi:10.4028/www.scientific.net/AMM.543-547.2028

Paper Titles

HF Dynamic Frequency Optimization Technology
p.2009

Dynamic Spectrum Access Considering Channel Fading in Cognitive Networks
p.2013

Knowledge Acquisition of Interval Set-Valued Based on Granular Computing
p.2017

Research of Potential Inclined Intrusion Data Mining Method in Large Network
p.2024

A Data Mining Algorithm Based on Improved K-Means Clustering
p.2028

Enabling Confidentiality for ADS-B Broadcast Messages Based on Format-Preserving Encryption
p.2032

Application of Data Mining Technology Based on Apriori Algorithm
p.2036

Study on Data Mining Techniques and Algorithms of Association Rules Data Mining
p.2040

Parameter C Optimizing for Robust ε-Support Vector Regression
p.2045

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 543-547A Data Mining Algorithm Based on Improved K-Means...

A Data Mining Algorithm Based on Improved K-Means Clustering

Abstract:

This paper purposes a K-means clustering algorithm based on improved filtering process. Thealgorithm improves the filtering process,The two minimum sample points are reasonable initial clustering centers. It makes the probability summary of data in a cluster as large as possible, and the probability summary of data in different clusters as small as possible. Experimental results show that the proposed algorithm can select the proper initial clustering center, and it is more compact and robust than thetraditional K-means clustering algorithm.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 543-547)

Pages:

2028-2031

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.543-547.2028

Citation:

Cite this paper

Online since:

March 2014

Authors:

Yang Zheng*

Keywords:

Clustering Algorithm, Initial Cluster Centers, K-Mean

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Anil K J. Data clustering: 50 years beyond K -Means [J]. Pattern Recognition Letters, 2010, 31(8), 651-666.

DOI: 10.1016/j.patrec.2009.09.011

Google Scholar

[2] Han Xiaogong hu for. K means clustering algorithm study [J]. Journal of dalian university of technology, 2009, 40 (3).

Google Scholar

[3] Ms wang, wang cheng, Feng Zhenyuan Ye Jinfeng. K means clustering algorithm study review [J]. Journal of electronic design engineering, 2012, 20 (7).

Google Scholar

[4] Hu wei. Improve the level of the k-means clustering algorithm [J]. Computer engineering and application, 2011, online version first.

Google Scholar

[5] J. Goldberger, S. Roweis, G. Hinton, and R. Salakhutdinov. Neighborhood component analysis [C], Advances in Neural Information Processing Systems (NIPS) 17, 2005, 513-520.

Google Scholar