Nonnegative Matrix Factorization with Integrated Graph and Feature Learning

Chong Peng

doi:10.1145/2987378

Nonnegative Matrix Factorization with Integrated Graph and Feature Learning

2017-01-12

20

PRE

AI

DOI：10.1145/2987378

Original request for help

Save

Abstract

En 中文

Matrix factorization is a useful technique for data representation in many data mining andmachine learning tasks. Particularly, for data sets with all nonnegative entries, matrix factorization often requires that factor matrices be nonnegative, leading to nonnegative matrix factorization (NMF). One important application of NMF is for clustering with reduced dimensions of the data represented in the new feature space. In this paper, we propose a new graph regularized NMF method capable of feature learning and apply it to clustering. Unlike existing NMF methods that treat all features in the original feature space equally, our method distinguishes features by incorporating a feature-wise sparse approximation error matrix in the formulation. It enables important features to be more closely approximated by the factor matrices. Meanwhile, the graph of the data is constructed using cleaner features in the feature learning process, which integrates feature learning andmanifold learning procedures into a unified NMF model. This distinctly differs from applying the existing graph-based NMF models after feature selection in that, when these two procedures are independently used, they often fail to align themselves toward obtaining a compact and most expressive data representation. Comprehensive experimental results demonstrate the effectiveness of the proposed method, which outperforms state-of-the-art algorithms when applied to clustering.

Keywords:

Non-negative matrix factorization

manifold learning

feature learning

clustering

Nonnegative Matrix Factorization with Integrated Graph and Feature Learning

Abstract

AI Summary

Journal

Organization