NDLI: Non-negative Matrix Factorization with Pairwise Constraints and Graph Laplacian

Content Provider	Springer Nature Link
Author	He, Yang Cheng Lu, Hong Tao Huang, Lei Shi, Xiao Hua
Copyright Year	2014
Abstract	Non-negative matrix factorization (NMF) is a very effective method for high dimensional data analysis, which has been widely used in information retrieval, computer vision, and pattern recognition. NMF aims to find two non-negative matrices whose product approximates the original matrix well. It can capture the underlying structure of data in the low dimensional data space using its parts-based representations. However, NMF is actually an unsupervised method without making use of prior information of data. In this paper, we propose a novel pairwise constrained non-negative matrix factorization with graph Laplacian method, which not only utilizes the local structure of the data by graph Laplacian, but also incorporates pairwise constraints generated among all labeled data into NMF framework. More specifically, we expect that data points which have the same class label will have very similar representations in the low dimensional space as much as possible, while data points with different class labels will have dissimilar representations as much as possible. Consequently, all data points are represented with more discriminating power in the lower dimensional space. We compare our approach with other typical methods and experimental results for image clustering show that this novel algorithm achieves the state-of-the-art performance.
Starting Page	167
Ending Page	185
Page Count	19
File Format	PDF
ISSN	13704621
Journal	Neural Processing Letters
Volume Number	42
Issue Number	1
e-ISSN	1573773X
Language	English
Publisher	Springer US
Publisher Date	2014-04-12
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Non-negative matrix factorization Semi-supervised learning Pairwise constraints Graph Laplacian Clustering Artificial Intelligence (incl. Robotics) Statistical Physics, Dynamical Systems and Complexity Computational Intelligence
Content Type	Text
Resource Type	Article
Subject	Neuroscience Artificial Intelligence Computer Networks and Communications Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Integrating Spectral Kernel Learning and Constraints in Semi-Supervised Classification

Adaptive Constraint Propagation for Semi-Supervised Kernel Matrix Learning

A Modified Semi-Supervised Learning Algorithm on Laplacian Eigenmaps

Constraint Score Evaluation for Spectral Feature Selection

Convergence Analysis of Non-Negative Matrix Factorization for BSS Algorithm

Semi-Supervised Logistic Discrimination Via Graph-Based Regularization

Graph Based Semi-Supervised Learning via Structure Preserving Low-Rank Representation

Multiple-View Multiple-Learner Semi-Supervised Learning

Non-Parametric Kernel Learning with robust pairwise constraints

Non-negative Matrix Factorization with Pairwise Constraints and Graph Laplacian

Similar Documents

Integrating Spectral Kernel Learning and Constraints in Semi-Supervised Classification

Adaptive Constraint Propagation for Semi-Supervised Kernel Matrix Learning

A Modified Semi-Supervised Learning Algorithm on Laplacian Eigenmaps

Constraint Score Evaluation for Spectral Feature Selection

Convergence Analysis of Non-Negative Matrix Factorization for BSS Algorithm

Semi-Supervised Logistic Discrimination Via Graph-Based Regularization

Graph Based Semi-Supervised Learning via Structure Preserving Low-Rank Representation

Multiple-View Multiple-Learner Semi-Supervised Learning

Non-Parametric Kernel Learning with robust pairwise constraints

Non-negative Matrix Factorization with Pairwise Constraints and Graph Laplacian