Experimental research on impacts of dimensionality on clustering algorithms

Hai-Dong MENG, Jin-Hui MA, Guandong XU

Research output: Chapter in Book/Report/Conference proceedingChapters

Abstract

Experiments are carried out on datasets with different dimensions selected from UCI datasets by using two classical clustering algorithms. The results of the experiments indicate that when the dimensionality of the real dataset is less than or equal to 30, the clustering algorithms based on distance are effective. For high-dimensional datasets - dimensionality is greater than 30, the clustering algorithms are of weaknesses, even if we use dimension reduction methods, such as Principal Component Analysis (PCA). Copyright © 2010 IEEE.

Original languageEnglish
Title of host publicationProceedings of 2010 International Conference on Computational Intelligence and Software Engineering, CiSE 2010
Place of PublicationUSA
PublisherIEEE
ISBN (Print)9781424453924
DOIs
Publication statusPublished - 2010

Citation

Meng, H.-D., Ma, J.-H., & Xu, G.-D. (2010). Experimental research on impacts of dimensionality on clustering algorithms. In Proceedings of 2010 International Conference on Computational Intelligence and Software Engineering, CiSE 2010. IEEE. https://doi.org/10.1109/CISE.2010.5677260

Fingerprint

Dive into the research topics of 'Experimental research on impacts of dimensionality on clustering algorithms'. Together they form a unique fingerprint.