Title :
Sparse Possibilistic Clustering with L1 Regularization
Author :
Inokuchi, Ryo ; Miyamoto, Sadaaki
Author_Institution :
Univ. of Tsukuba, Tsukuba
Abstract :
Possibilistic clustering is an efficient method to detect high density regions and more robust than fuzzy c-means. However, it is not ´sparse´, since a cluster center is expressed as a linear combination of all data. In this paper, we propose a sparse possibilistic clustering method with 11 regularization to find compact clusters. Due to a non- negative constraints for a membership, the baseline constant is introduced into the regularizer. The effectiveness of the proposed method is shown in illustrative examples.
Keywords :
fuzzy set theory; pattern clustering; L1 regularization; density region detection; fuzzy c-means; sparse possibilistic clustering; Clustering algorithms; Clustering methods; Constraint optimization; Data mining; Euclidean distance; Machine learning; Machine learning algorithms; Noise robustness; Partitioning algorithms; Virtual colonoscopy;
Conference_Titel :
Granular Computing, 2007. GRC 2007. IEEE International Conference on
Conference_Location :
Fremont, CA
Print_ISBN :
978-0-7695-3032-1
DOI :
10.1109/GrC.2007.125