Feature Selection: Evaluation, Application, and Small Sample Performance
IEEE Transactions on Pattern Analysis and Machine Intelligence
Feature Subset Selection and Order Identification for Unsupervised Learning
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Document clustering based on non-negative matrix factorization
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Theoretical and Empirical Analysis of ReliefF and RReliefF
Machine Learning
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
Document Clustering Using Locality Preserving Indexing
IEEE Transactions on Knowledge and Data Engineering
The Journal of Machine Learning Research
Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples
The Journal of Machine Learning Research
Spectral feature selection for supervised and unsupervised learning
Proceedings of the 24th international conference on Machine learning
Spectral regression: a unified subspace learning framework for content-based image retrieval
Proceedings of the 15th international conference on Multimedia
General Tensor Discriminant Analysis and Gabor Features for Gait Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Locality sensitive semi-supervised feature selection
Neurocomputing
Geometric Mean for Subspace Selection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Personalized tag recommendation using graph-based ranking on multi-type interrelated objects
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
A fast feature extraction method
ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
Patch Alignment for Dimensionality Reduction
IEEE Transactions on Knowledge and Data Engineering
Fast Haar transform based feature extraction for face representation and recognition
IEEE Transactions on Information Forensics and Security
Iterative subspace analysis based on feature line distance
IEEE Transactions on Image Processing
A novel feature selection approach for biomedical data classification
Journal of Biomedical Informatics
Evolutionary cross-domain discriminative hessian eigenmaps
IEEE Transactions on Image Processing
Biologically inspired feature manifold for scene classification
IEEE Transactions on Image Processing
Laplacian regularized D-optimal design for active learning and its application to image retrieval
IEEE Transactions on Image Processing
Bregman Divergence-Based Regularization for Transfer Subspace Learning
IEEE Transactions on Knowledge and Data Engineering
Unsupervised feature selection for multi-cluster data
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on gait analysis
Feature Selection and Kernel Learning for Local Learning-Based Clustering
IEEE Transactions on Pattern Analysis and Machine Intelligence
Using rich social media information for music recommendation via hypergraph model
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) - Special section on ACM multimedia 2010 best paper candidates, and issue on social media
A Variance Minimization Criterion to Feature Selection Using Laplacian Regularization
IEEE Transactions on Pattern Analysis and Machine Intelligence
Discriminant Locally Linear Embedding With High-Order Tensor Data
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Supervised Gaussian Process Latent Variable Model for Dimensionality Reduction
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.01 |
Feature selection is an important preprocessing step in many applications where the data points are of high dimension. It is designed to find the most informative feature subset to facilitate data visualization, clustering, classification, and ranking. In this paper, we consider the feature selection problem in unsupervised scenarios. Typical unsupervised feature selection algorithms include Q-@a and Laplacian Score. Both of them select the most informative features by discovering the clustering or geometrical structure in the data. However, they fail to consider the performance of some specific learning task, e.g. regression, by using the selected features. Based on Laplacian Regularized Least Squares (LapRLS) which incorporates the manifold structure into the regression model, we propose a novel feature selection approach called Laplacian G-Optimal Feature Selection (LapGOFS). It minimizes the maximum variance of the predicted value of the regression model. By using techniques from manifold learning and optimal experimental design, our proposed approach can select the most informative features which can improve the learning performance the most. Extensive experimental results over various real data sets have demonstrated the effectiveness of the proposed algorithm.