Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Unsupervised document classification using sequential information maximization
SIGIR '02 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval
Kernel Principal Component Analysis
ICANN '97 Proceedings of the 7th International Conference on Artificial Neural Networks
Adaptive dimension reduction for clustering high dimensional data
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Document clustering based on non-negative matrix factorization
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Introducing a weighted non-negative matrix factorization for image classification
Pattern Recognition Letters
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
Information-theoretic co-clustering
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Document clustering via adaptive subspace iteration
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
Non-negative Matrix Factorization with Sparseness Constraints
The Journal of Machine Learning Research
Non-negative tensor factorization with applications to statistics and computer vision
ICML '05 Proceedings of the 22nd international conference on Machine learning
Discriminative cluster analysis
ICML '06 Proceedings of the 23rd international conference on Machine learning
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Relationships Among Various Nonnegative Matrix Factorization Methods for Clustering
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Initialization enhancer for non-negative matrix factorization
Engineering Applications of Artificial Intelligence
Adaptive dimension reduction using discriminant analysis and K-means clustering
Proceedings of the 24th international conference on Machine learning
Non-negative matrix factorization with α-divergence
Pattern Recognition Letters
Nonnegative matrix factorization with quadratic programming
Neurocomputing
Journal of Biomedical Informatics
Solving Consensus and Semi-supervised Clustering Problems Using Nonnegative Matrix Factorization
ICDM '07 Proceedings of the 2007 Seventh IEEE International Conference on Data Mining
Correlation Metric for Generalized Feature Extraction
IEEE Transactions on Pattern Analysis and Machine Intelligence
Geometric Mean for Subspace Selection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Object Categorization Based on Kernel Principal Component Analysis of Visual Words
WACV '08 Proceedings of the 2008 IEEE Workshop on Applications of Computer Vision
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Document clustering using nonnegative matrix factorization
Information Processing and Management: an International Journal
Probabilistic latent semantic analysis
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Classification in a normalized feature space using support vector machines
IEEE Transactions on Neural Networks
Hi-index | 0.01 |
In this paper, we propose an iterative normalized compression method for dimensionality reduction using non-negative matrix factorization (NCMF). To factorize the instance matrix X into CxM, an objective function is defined to impose the normalization constraints to the basis matrix C and the coefficient matrix M. We argue that in many applications, instances are often normalized in one way or the other. By integrating data normalization constraints into the objective function and transposing the instance matrix, one can directly discover relations among different dimensions and devise effective and efficient procedure for matrix factorization. In the paper, we assume that feature dimensions in instance matrix are normalized, and propose an iterative solution NCMF to achieve rapid matrix factorization for dimensionality reduction. As a result, the basis matrix can be viewed as a compression matrix and the coefficient matrix becomes a mapping matrix. NCMF is simple, effective, and only needs to initialize the mapping matrix. Experimental comparisons on text, biological and image data demonstrate that NCMF gains 21.02% computational time reduction, 39.60% sparsity improvement for mapping matrix, and 8.59% clustering accuracy improvement.