Abstract
Clustering algorithms often use distance measure as the measure of similarity between point pairs. Such clustering algorithms are difficult to deal with the curse of dimensionality in high-dimension space. In order to address this issue which is common in clustering algorithms, we proposed to use MIC instead of distance measure in k-means clustering algorithm and implemented the novel MIC-kmeans algorithm for high-dimension clustering. MIC-kmeans can cluster the data with correlation to avoid the problem of distance failure in high-dimension space. The experimental results over the synthetic data and real datasets show that MIC-kmeans is superior to k-means clustering algorithm based on distance measure.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Han, J., Kamber, M., Pei, J.: Data Mining: Concepts and Techniques, 3rd edn. Morgan Kaufmann Publishers Inc., San Francisco (2012)
Witten, I., Frank, E., Hall, M.: Data Mining: Practical Machine Learning Tools and Techniques, 2nd edn. Morgan Kaufmann Publishers Inc., San Francisco (2005)
Leskovec, J., Rajaraman, A., Jeffrey, D.U.: Mining of Massive Datasets, 2nd edn. Cambridge University Press, Cambridge (2014)
Steinbach, M., Ertöz, L., Kumar, V.: The challenges of clustering high dimensional data. In: New Directions in Statistical Physics, pp. 273–309 (2003)
Liang, J.Y., Feng, C.J., Song, P.: A survey on correlation analysis of big data. Chin. J. Comput. 1, 1–18 (2016)
Reshef, D.N., Reshefet, Y.A., et al.: Detecting novel associations in large datasets. Science 334(6062), 1518 (2011)
Zhihua, Z.: Machine Learning. Tsinghua University Press, Beijing (2016)
Rosenberg, A., Hirschberg, J.: V-Measure: a conditional entropy-based external cluster evaluation measure. In: Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, EMNLP-CoNLL 2007, 28–30 June 2007, Prague, Czech Republic DBLP, pp. 410–420 (2007)
Wagner, S., Wagner, D.: Comparing Clusterings - An Overview (2007)
Rand index. https://en.wikipedia.org/w/index.php?title=Rand_index&oldid=813287904. Accessed 15 Dec 2017
Vinh, N.X., Epps, J., Bailey, J.: Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance. J. Mach. Learn. Res. 11, 2837–2854 (2010)
Kinney, J.B., Atwal, G.S.: Equitability, mutual information, and the maximal information coefficient. Proc. Nat. Acad. Sci. U. S. Am. 111(9), 3354 (2013)
Reshef, D., et al.: Equitability Analysis of the Maximal Information Coefficient, with Comparisons. abs/1301.6314 (2013)
Zhang, Y., et al.: A novel algorithm for the precise calculation of the maximal information coefficient. Sci. Rep. 4(4), 6662 (2014)
Chen, Y., et al.: A new algorithm to optimize maximal information coefficient. PLoS ONE 11(6), e0157567 (2016). PMC. Web. 18. Ed. Zhongxue Chen
Acknowledgements
This research is supported by the National Natural Science Foundation of China (Grant No. 61462012, No. 61562010, No. U1531246), Guizhou University Graduate Innovation Fund Project (Grant No. 2017082), the Innovation Team of the Data Analysis and Cloud Service of Guizhou Province (Grant No. [2015]53), Science and Technology Project of the Department of Science and Technology in Guizhou Province (Grant No. LH [2016]7427).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Wang, R., Li, H., Chen, M., Dai, Z., Zhu, M. (2019). MIC-KMeans: A Maximum Information Coefficient Based High-Dimensional Clustering Algorithm. In: Silhavy, R. (eds) Artificial Intelligence and Algorithms in Intelligent Systems. CSOC2018 2018. Advances in Intelligent Systems and Computing, vol 764. Springer, Cham. https://doi.org/10.1007/978-3-319-91189-2_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-91189-2_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91188-5
Online ISBN: 978-3-319-91189-2
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)