An Efficient k-Means Clustering Algorithm: Analysis and Implementation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Laplacian Eigenmaps for dimensionality reduction and data representation
Neural Computation
Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment
SIAM Journal on Scientific Computing
Non-negative Laplacian Embedding
ICDM '09 Proceedings of the 2009 Ninth IEEE International Conference on Data Mining
Convex and Semi-Nonnegative Matrix Factorizations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multi-label linear discriminant analysis
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part VI
Generalized principal component analysis (GPCA)
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Community discovery using nonnegative matrix factorization
Data Mining and Knowledge Discovery
Non-negative matrix factorization as a feature selection tool for maximum margin classifiers
CVPR '11 Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition
Hi-index | 0.00 |
Many real life applications often bring much high-dimensional and noise-contaminated data from different sources. In this paper, we consider de-noising as well as dimensionality reduction by proposing a novel method named Robust Integrated Locally Linear Embedding. The method combines the two steps in LLE into a single framework and deals with de-noising by solving a l2,1-l2 mixed norm based optimization problem. We also derive an efficient algorithm to build the proposed model. Extensive experiments demonstrate that the proposed method is more suitable to exhibit relationship among data points, and has visible improvement in de-noising, embedding and clustering tasks.