Research on Interactive Visualization Clustering Method Based on the Radar Chart

Abstract:

Most algorithms for the high-dimensional data clustering are not intuitive and the clustering results are difficult to explain. To solve these problems, a new method based on the interactive visualization technology was proposed in this paper. First, the entropy-weight was adopted to determine the main attributes and how to arrange them. Every data was described in an improved radar chart in which polar radius stood by attribute values and polar angles stood by the attribute weights. Then the points in the radar chart were clustered through applying an improved k-means algorithm. The number of clusters was not given before. And initial centers were optimized according to the point density and their distance. Finally, the experiment showed that the improved radar chart reflected the distribution of the data better and that the improved k-means algorithm was more efficient and accuracy.

• Periodical: Applied Mechanics and Materials (Volumes 241-244)
• Pages: 1633-1639
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.241-244.1633
• Online since: December 2012
• Authors: Hui Jun Li, Zhi Quan Li, Jing Xuan Peng, Li Hui Zhang
• Keywords: Clustering, Entropy, K-Mean, Radar Chart, Visualization, Weight

References

[1] MacQueen J.: Some Methods for Classification and Analysis of Multivariate Observations (Proc. of the 5th Berkeley Symposium on Mathematical Statistics and Probability 2003).

[2] Linde Y，Buzo A and Gary R : An algorithm for vector quantization design (IEEE Trans on Communication 1980).

[3] Chomicki J, Godfrey P and Gryz J, et a1: Skyline with presorting: Theory and Optimization(Proc. Int. Conf. on Intelligent Information Systems 2005).

DOI: 10.1007/3-540-32392-9_72

[4] Birgin E G, Martinez J M and D P: European J. Operational Research Vol. 146 (2003) p.19.

[5] Kanungo T, Mount D M et al: Pattern Analysis and Machine Intelligence Vol. 24 (2002) p.881.

[6] Ester M et a1: A density-based algorithm for discovering clusters in large spatial databases with noise (Pro. 2nd Int. Conf. on Knowledge Discovery and Data Mining 1996).

[7] Yushuang Shan, Changzheng Xing : Computer Systems & Applications Vol . 8 (2009) p.96.

[8] Zhenhua Huang, Yang Xiang et al : Pattern Recognition and Artificial Intelligence Vol. 23 (2010) p.516.

[9] Zhong Wang, Guanquan Liu, Enhong Chen: Pattern Recognition and Artificial intelligence Vol. 22 2009 p.299.

[10] Jian Wu, Changyong Liang, Nianhua Li: System Engineering and Elec. Tech. Vol. 29 (2007) p.383.

[11] Wenyuan Liu, Fang Li Wenxue Hong: Computer Engineering and Applications Vol. 43(2007) p.161.