Performance evaluation of principal component analysis for clustering problems
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Clustering analysis is widely used in data mining to classify data into categories on the basis of their similarity. Through the decades, many clustering techniques have been developed, including hierarchical and non-hierarchical algorithms. In gene profiling problems, because of the large number of genes and the complexity of biological networks, dimensionality reduction techniques are critical exploratory tools for clustering analysis of gene expression data. Recently, clustering analysis of applying dimensionality reduction techniques was also proposed. PCA (principal component analysis) is a popular methd of dimensionality reduction techniques for clustering problems. However, previous studies analyzed the performance of PCA for only full data sets. In this paper, to specifically and robustly evaluate the performance of PCA for clustering analysis, we exploit an improved FCBF (fast correlation-based filter) of feature selection methods for supervised clustering data sets, and employ two well-known clustering algorithms: k-means and k-medoids. Computational results from supervised data sets show that the performance of PCA is very poor for large-scale features.
Abstract
Clustering analysis is widely used in data mining to classify data into categories on the basis of their similarity. Through the decades, many clustering techniques have been developed, including hierarchical and non-hierarchical algorithms. In gene profiling problems, because of the large number of genes and the complexity of biological networks, dimensionality reduction techniques are critical exploratory tools for clustering analysis of gene expression data. Recently, clustering analysis of applying dimensionality reduction techniques was also proposed. PCA (principal component analysis) is a popular methd of dimensionality reduction techniques for clustering problems. However, previous studies analyzed the performance of PCA for only full data sets. In this paper, to specifically and robustly evaluate the performance of PCA for clustering analysis, we exploit an improved FCBF (fast correlation-based filter) of feature selection methods for supervised clustering data sets, and employ two well-known clustering algorithms: k-means and k-medoids. Computational results from supervised data sets show that the performance of PCA is very poor for large-scale features.
참고문헌 (17)
- T. Sorensen, "A method of establishing groups of equal amplitude in plant sociology based on similarity of species and its application to analyses of the vegetation on Danish commons", Biologiske Skrifter, 5, pp.1~34 (1948)
- J. R. Ward, "Hierarchical grouping to optimize an objective function", Journal of the American statistical association, 58(301), pp.236~244 (1963)
- L. Kaufman, "Finding groups in data: an introduction to cluster analysis" (2009), John Wiley & Sons
- A. Rodriguez, "Clustering by fast search and find of density peaks", Science, 344(6191), pp.1492~1496 (2014)
- J. B. MacQueen, "Some Methods for classification and Analysis of Multivariate Observations", Proceedings of the fifth Berkeley Symposium on Mathematical Statistics and Probability, 1(14), pp.281~297 (1967)
- K. Barker, "Singular value decomposition tutorial vol. 24", The Ohio State University, ~ (2005)
- I. Jolliffe, "Principal Component Analysis" (2002), John Wiley & Sons
- T. K. Landauer, "An introduction to latent semantic analysis", Discourse processes, 25(2-3), pp.259~284 (1998)
- E. Bingham, "Random projection in dimensionality reduction: applications to image and text data", Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.245~250 (2001), Association for Computing Machinery
- K. Y. Yeung, "Principal component analysis for clustering gene expression data", Bioinfor- matics, 17(9), pp.763~774 (2001)
- M. Song, "A comparative study of dimensionality reduction techniques to enhance trace clustering performances", Expert Systems with Applications, 40(9), pp.3722~3737 (2013)
- 김정태, "A comparative study of filter methods based on information entropy", 한국마린엔지니어링학회지, 40(5), pp.437~446 (2016), 한국마린엔지니어링학회[DOI]
- M. Du, "Study on density peaks clustering based on k-nearest neighbors and principal component analysis", Knowledge-Based Systems, 99, pp.135~145 (2016)
- L. Yu, "Feature selection for high- dimensional data: A fast correlation-based filter solution", International Conference Machine Learning, 3, pp.856~863 (2003)
- H. Peng, "Feature selection based on mutual information criteria of max-dependency max-relevance and min-redundancy", IEEE Transactions on pattern analysis and machine intelligence, 27(8), pp.1226~1238 (2005)
- W. M. Rand, "Objective criteria for the evaluation of clustering methods", Journal of the American Statistical Association, 66(336), pp.846~850 (1971)
- L. Hubert, "Comparing partitions", Journal of Classification, 2(1), pp.193~218 (1985)