TY - JOUR AU - Zhao, Han AU - Poupart, Pascal AU - Zhang, Yongfeng AU - Lysy, Martin PY - 2015/02/21 Y2 - 2024/03/28 TI - SoF: Soft-Cluster Matrix Factorization for Probabilistic Clustering JF - Proceedings of the AAAI Conference on Artificial Intelligence JA - AAAI VL - 29 IS - 1 SE - Main Track: Novel Machine Learning Algorithms DO - 10.1609/aaai.v29i1.9594 UR - https://ojs.aaai.org/index.php/AAAI/article/view/9594 SP - AB - <p> 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. </p> ER -