An Improved K-Means Algorithm of High-Dimensional Data

Cheng Cheng Zheng; Hong Zhang

doi:10.4028/www.scientific.net/AMR.926-930.2968

Paper Titles

An Efficient Packet Scheduling and Resource Allocation Algorithm for Practical Multi-Layer Systems
p.2951

An Improved Algorithm of Weighted Centroid Algorithm Based on RSSI
p.2955

An Improved BIST Algorithm Research
p.2959

An Improved Blind Source Extraction Algorithm
p.2964

An Improved K-Means Algorithm of High-Dimensional Data
p.2968

An Improved NAS-RIF Algorithm for Turbulence-Degraded Images Restoration
p.2973

An Integrated Pipeline Soft-Collision Algorithm and its Implementation Based on MicroStation
p.2978

Analysis of Active Deception Jamming Model against SAR
p.2982

Analysis of Coupled Water Hammer Vibration Equation of Improvement
p.2986

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 926-930An Improved K-Means Algorithm of High-Dimensional...

An Improved K-Means Algorithm of High-Dimensional Data

Abstract:

This paper summarizes the characteristics of high-dimensional data and the difficulties of high-dimensional data clustering, points out the shortcomings of traditional clustering algorithm in performing clustering high-dimensional data, and proposes an improved K-means algorithm to complete the high-dimensional data clustering, the algorithm has better scalability and high efficiency, suitable for handling large document sets.

You might also be interested in these eBooks

Progress in Applied Sciences, Engineering and Technology

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 926-930)

Pages:

2968-2972

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.926-930.2968

Citation:

Cite this paper

Online since:

May 2014

Authors:

Cheng Cheng Zheng*, Hong Zhang

Keywords:

Clustering Analysis, Data Mining (DM), High-Dimensional Data, K-Mean

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] M. Verleysen. Learning High-dimensional Data. Limitation and Future Trend in Neural Computation, 2003, pp.141-162.

Google Scholar

[2] L. Parsons, E. Haque and H. Liu. Subspace Clustering for High Dimensional Data: A Review. ACM SIGKDD Exploration Newsletter, 2004, 6(1): 90-105.

DOI: 10.1145/1007730.1007731

Google Scholar

[3] C.C. Aggarwal, C. Procopiuc. Fast Algorithms for projected Clustering. Proceedings ACM SIGMOD International Conference on Management of Data . 1999, PP. 61-71.

DOI: 10.1145/304182.304188

Google Scholar

[4] J. He, M. Lan, C.L. Tan. Initialization of cluster refinement algorithm: a review and comparative study. Proceeding of International Joint Conference on Neural Network, 2004, pp.297-302.

Google Scholar

[5] C. Bohm, K. Kailing, H.P. Kriegel, P. Kroger. Density connected clustering with local subspace preference. Proceeding of the ICDM, 2004, pp.27-34.

DOI: 10.1109/icdm.2004.10087

Google Scholar

[6] M. Benkhalifa and A. Bensaid. Text Categorization using the Semi-Supervised Fuzzy c-MeansAlgorithm. Proceeding of the NAFIPS, 1999, pp.561-565.

DOI: 10.1109/nafips.1999.781756

Google Scholar

[7] M. Steinbach, G. Karypis, V. Kumar. A Comparison of Document Clustering Techniques. http: /www. cs. cmu. edu/~dunja/KDDpapers/Steinbach_IR. pdf.

Google Scholar

[8] W. Wang, J. Yang, R. Muntz. STING: A Statistical Information Grid Approach to Spatial Data Mining. Athens: Proceedings of the 23rd Conference on VLDB. 1997, pp.186-195.

Google Scholar

[9] Information on http: /www. searchforum. org. cn/tansongbo/corpus. htm.

Google Scholar