Relationship Matrix Nonnegative Decomposition for Clustering

Abstract EN

Nonnegative matrix factorization (NMF) is a popular tool for analyzing the latent structure of nonnegative data.

For a positive pairwise similarity matrix, symmetric NMF (SNMF) and weighted NMF (WNMF) can be used to cluster the data.

However, both of them are not very efficient for the ill-structured pairwise similarity matrix.

In this paper, a novel model, called relationship matrix nonnegative decomposition (RMND), is proposed to discover the latent clustering structure from the pairwise similarity matrix.

The RMND model is derived from the nonlinear NMF algorithm.

RMND decomposes a pairwise similarity matrix into a product of three low rank nonnegative matrices.

The pairwise similarity matrix is represented as a transformation of a positive semidefinite matrix which pops out the latent clustering structure.

We develop a learning procedure based on multiplicative update rules and steepest descent method to calculate the nonnegative solution of RMND.

Experimental results in four different databases show that the proposed RMND approach achieves higher clustering accuracy.