Experimental research on impacts of dimensionality on clustering algorithms

Publication Type:
Conference Proceeding
2010 International Conference on Computational Intelligence and Software Engineering, CiSE 2010, 2010
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
05677260.pdfAccepted Manuscript267.32 kB
Adobe PDF
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). ©2010 IEEE.
Please use this identifier to cite or link to this item: