Abstract
Unsupervised feature selection is one of the key topics in data engineering. Previous studies usually use a score vector which has the same length as the feature number to measure the discriminating power of each feature, and the top ranked features are considered to represent the intrinsic multi-cluster structure of the original data. Among different algorithms, Multi-Cluster Feature Selection(MCFS) is one well designed algorithm for its superior performance in feature selection tasks. However, in practice the score vector of MCFS is often sparse, and it brings a problem that only few features are well evaluated about the discriminating power while most others’ are still ambiguous. In this paper, by simultaneously solving one L1-regularized regression and one L2-regularized regression, we propose a novel Multi-Cluster Feature Selection via Smooth Distributed Score(MCFS-SDS), which combines the two results to clearly evaluate the discriminating power of most features via smooth distributed score vector. It is extremely efficient when cluster number is small. Experimental results over various real-life data demonstrate the effectiveness of the proposed algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. Wiley-Interscience, Hoboken (2000)
He, X., Cai, D., Niyogi, P.: Laplacian Score for Feature Selection. In: Advances in Neural Information Processing Systems 18 (NIPS 2005) (2005)
Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer, New York (2001)
Stewart, G.W.: Matrix Algorithms: Eigensystems, vol. II. SIAM, Philadelphia (2001)
Chung, F.R.K.: Spectral Graph Theory. Regional Conference Series in Mathematics, vol. 92. AMS (1997)
Wolf, L., Shashua, A.: Feature Selection for Unsupervised and Supervised Infe-rence: The Emergence of Sparsity in A Weight-Based Approach. Journal of Machine Learning Research 6, 1855–1887 (2005)
Cai, D., Zhang, C., He, X.: Unsupervised Feature Selection for Multi-Cluster Data. In: 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2010), pp. 333–342 (2010)
Tenenbaum, J., Silva, V.D.: A Global Geometric Framework for Nonlinear Dimensionality Reduction. Science 290(5500), 2319–2323 (2000)
Paige, C.C., Saunders, M.A.: LSQR: An Algorithm for Sparse Linear Equations And Sparse Least Squares. ACM Transactions on Mathematical Software 8(1), 43–71 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, F., Liu, X. (2012). Unsupervised Feature Selection for Multi-cluster Data via Smooth Distributed Score. In: Huang, DS., Gupta, P., Zhang, X., Premaratne, P. (eds) Emerging Intelligent Computing Technology and Applications. ICIC 2012. Communications in Computer and Information Science, vol 304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31837-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-31837-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31836-8
Online ISBN: 978-3-642-31837-5
eBook Packages: Computer ScienceComputer Science (R0)