An Efficient Greedy Method for Unsupervised Feature Selection
暂无分享,去创建一个
[1] Jennifer G. Dy. Orthogonal Principal Feature Selection , 2008 .
[2] Ying Cui,et al. Convex Principal Feature Selection , 2010, SDM.
[3] Lior Wolf,et al. Feature selection for unsupervised and supervised inference: the emergence of sparsity in a weighted-based approach , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.
[4] Deng Cai,et al. Laplacian Score for Feature Selection , 2005, NIPS.
[5] Delbert Dueck,et al. Clustering by Passing Messages Between Data Points , 2007, Science.
[6] Heng Tao Shen,et al. Principal Component Analysis , 2009, Encyclopedia of Biometrics.
[7] Joydeep Ghosh,et al. Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions , 2002, J. Mach. Learn. Res..
[8] Deng Cai,et al. Unsupervised feature selection for multi-cluster data , 2010, KDD.
[9] Huan Liu,et al. Spectral feature selection for supervised and unsupervised learning , 2007, ICML '07.
[10] H. Luetkepohl. The Handbook of Matrices , 1996 .
[11] Christos Boutsidis,et al. Unsupervised Feature Selection for the $k$-means Clustering Problem , 2009, NIPS.
[12] Christos Boutsidis,et al. Unsupervised feature selection for principal components analysis , 2008, KDD.
[13] Qi Tian,et al. Feature selection using principal feature analysis , 2007, ACM Multimedia.
[14] C. A. Murthy,et al. Unsupervised Feature Selection Using Feature Similarity , 2002, IEEE Trans. Pattern Anal. Mach. Intell..
[15] R. Tibshirani,et al. Sparse Principal Component Analysis , 2006 .
[16] Anil K. Jain,et al. Algorithms for Clustering Data , 1988 .
[17] Michael I. Jordan,et al. On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.