AAAI Publications, Twenty-Ninth AAAI Conference on Artificial Intelligence

Font Size: 
SoF: Soft-Cluster Matrix Factorization for Probabilistic Clustering
Han Zhao, Pascal Poupart, Yongfeng Zhang, Martin Lysy

Last modified: 2015-02-21

Abstract


We propose SoF (Soft-cluster matrix Factorization), a probabilistic clustering algorithm which softly assigns each data point into clusters. Unlike model-based clustering algorithms, SoF does not make assumptions about the data density distribution. Instead, we take an axiomatic approach to define 4 properties that the probability of co-clustered pairs of points should satisfy. Based on the properties, SoF utilizes a distance measure between pairs of points to induce the conditional co-cluster probabilities. The objective function in our framework establishes an important connection between probabilistic clustering and constrained symmetric Nonnegative Matrix Factorization (NMF), hence providing a theoretical interpretation for NMF-based clustering algorithms. To optimize the objective, we derive a sequential minimization algorithm using a penalty method. Experimental results on both synthetic and real-world datasets show that SoF significantly outperforms previous NMF-based algorithms and that it is able to detect non-convex patterns as well as cluster boundaries.

Keywords


Nonnegative matrix factorization; Probabilistic clustering; Optimization

Full Text: PDF