Research on Psychology Data Clustering Algorithm Based on CUDA

Article Preview

Abstract:

This paper analyzed the employees' MMPI Psychological data of a company. Aiming at the problem that traditional K-Means algorithm is sensitive to the initial clustering center, this paper used hierarchical clustering algorithm CURE to mitigate the problem. Finally using CUDA technology clustered several times, so as to improve the execution efficiency of the algorithm. Through experimental verification, the improved K-Means algorithm behaved well in both execution efficiency and clustering results.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 989-994)

Pages:

1664-1670

Citation:

Online since:

July 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Bradley P S, Fayyad U M. Refining Initial Points for K-Means Clustering[C]. Proceedings of the 15Th International Conference on Machine Learning. San Francisco: Morgan Kaufmann Press, 1998: 91-99.

Google Scholar

[2] Selim S Z, Alsultan K. A Simulated Annealing Algorithms for the Clustering Problem Pattern Recognition[J]. Pattern Recognition , 1991, 24(10): 1003~1008.

DOI: 10.1016/0031-3203(91)90097-o

Google Scholar

[3] MA Chao, LIAN Ji-jian. Short Term Hydropower Dispatching Optimization of Cascaded Hydropower Junctions Based on Cluster Genetic Algorithm[J]. Journal of Tianjin University, 2010, 43(1): 1-8.

DOI: 10.1109/indusis.2010.5565870

Google Scholar

[4] GONG Dun-wei, JIANG Yu-qing, ZHANG Yong, et al. K-mean algorithm for optimizing the number of clusters based on particle swarm optimization[J]. Control Theory & Application, 2009, 26(10): 1175-1179.

Google Scholar

[5] LIU Jing-ming, HAN Li-chuan, HOU Li-wen. Cluster Analysis Based on Particle Swarm Optimization Algorithm. Systems Engineering —Theory & Practice, 2005, 25(6): 54-58.

Google Scholar

[6] WANG Zong-hu, LIU Zhi-jing, CHEN Dong-hui. Improved PSO-based fast clustering algorithm[J]. Journal of Xidian University, 2012, 39(5): 61-65, 78.

Google Scholar

[7] XUE Sheng-jun, PAN Wu-bin. Parallel PK-means Algorithm on Meteorological Data Using MapReduce. Journal of Wuhan University of Technology, 2012, 34(12): 139-141.

Google Scholar

[8] Kumar N, Satoor S, Buck I. Fast parallel expectation maximization for Gaussian mixture models on GPUs using CUDA [C]. Proceedings of 11th IEEE International Conference on High Performance Computing and Communications. Piscataway: IEEE Computer Society Press, 2009: 103-109.

DOI: 10.1109/hpcc.2009.45

Google Scholar

[9] Zhang Fan, Wang Zhangye, Yao Jian, et al. Accelerating the calculation of protein molecular field using GPU cluster [J]. Journal of Computer-Aided Design & Computer Graphics, 2010, 22(3): 412-419.

Google Scholar

[10] Takahashi T, Hamada T. GPU-accelerated boundary element method for Hemholtz' equation in three dimensions [J]. International Journal for Numerical Methods in Engineering, 2009, 80(10): 1295-1321.

DOI: 10.1002/nme.2661

Google Scholar

[11] Labaki J, Mesquita E, Ferreira S L O. The BEM on general purpose graphics processing unit(GPGPU): a study on three distinct implementations [C]. Proceedings of the 11th International Conference on Boundary Element Techniques XI. United Kingdom: EC Ltd Press, 2010: 316-323.

Google Scholar

[12] Zhou Ya-jian, Xu Chen, Li Ji-guo, et al. Unsupervised anomaly detection method for improving CURE clustering algorithm [J] Journal on Communications. 2010, 07: 18-23+32.

Google Scholar

[13] NIE Xiao-jing, QIU Chang-jian, et al. Contrast Studies of MMPI between Anxiety and Depression[J]. Wset China Medical Journal, 2007, 24(6): 1356-1361.

Google Scholar

[14] Guha S et al. CURE: An efficient clustering algorithm for large databases. In: Proc of the ACM SIGMOD Int' l Conf on Management of Data. (1998).

DOI: 10.1145/276304.276312

Google Scholar