Affiliations: [a] Department of Industrial Engineering and Management, NCTU, Hsinchu, Taiwan | [b] Department of Computer Science, NCTU, Hsinchu, Taiwan | [c] Department of Computer Science and Information Engineering, NKUAS, Kaohsiung, Taiwan
Correspondence:
[*]
Corresponding author: W.-H. Hsaio, Department of Computer Science, National Chiao Tung University, 1001 University Road, Hsinchu, Taiwan. Tel.: +886 3 5131503; Fax: +886 3 5734935; E-mail: bass28.cs96g@g2.nctu.edu.tw.
Abstract: Multi-label learning has attracted significant attention from machine learning and data mining over the last decade. Although many multi-label classification algorithms have been devised, few research studies focus on multi-assignment clustering (MAC), in which a data instance can be assigned to multiple clusters. The MAC problem is practical in many application domains, such as document clustering, customer segmentation and image clustering. Additionally, specifying the number of clusters is always a difficult but critical problem for a certain class of clustering algorithms. Hence, this work proposes a nonparametric multi-assignment clustering algorithm called multi-assignment Chinese restaurant process (MACRP), which allows the model complexity to grow as more data instances are observed. The proposed algorithm determines the number of clusters from data, so it provides a practical model to process massive data sets. In the proposed algorithm, we devise a novel prior distribution based on the similarity graph to achieve the goal of multi-assignment, and propose a Gibbs sampling algorithm to carry out posterior inference. The implementation in this work uses collapsed Gibbs sampling and compares with several methods. Additionally, previous evaluation metrics used by multi-label classification are inappropriate for MAC, since label information is unavailable. This work further devises an evaluation metric for MAC based on the characteristics of clustering and multi-assignment problems. We conduct experiments on two real data sets, and the experimental results indicate that the proposed method is competitive and outperforms the alternatives on most data sets.
Keywords: Multi-assignment clustering, Chinese restaurant process (CRP), Non-parametric Bayesian
