On Sequential Cluster Extraction Based on L1-Regularized Possibilistic Non-metric Model
The fuzzy non-metric model is one of the clustering methods in which the membership grade of each datum to each cluster is calculated directly from dissimilarities between data. The cluster center which is referred to as representative of cluster is not used in fuzzy non-metric model. This paper discusses a new possibilistic approach for non-metric model from the viewpoint of being in the cluster. In the previous study, new possibilistic clustering and its variant have been proposed by using L 1-regularization. These possibilistic clustering methods with L 1-regularization induce a change in the membership function. Two types of non-metric model based on possibilistic approach named L 1-regularized possibilistic non-metric model are proposed in this paper. Next, the way of sequential extraction algorithm is also discussed. Moreover, the results of sequential extraction based on proposed methods are shown.
Keywordspossibilistic clustering non-metric model L1-regularization sequential cluster extraction
Unable to display preview. Download preview PDF.
- 1.Bezdek, J.C.: Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum Press, New York (1981)Google Scholar
- 2.Miyamoto, S., Mukaidono, M.: Fuzzy c-means as a regularization and maximum entropy approach. In: Proc. of the 7th International Fuzzy Systems Association World Congress (IFSA 1997), vol. 2, pp. 86–92 (1997)Google Scholar
- 6.Miyamoto, S., Kuroda, Y., Arai, K.: Algorithms for Sequential Extraction of Clusters by Possibilistic Method and Comparison with Mountain Clustering. Journal of Advanced Computational Intelligence and Intelligent Informatics (JACIII) 12(5), 448–453 (2008)Google Scholar
- 9.Endo, Y.: On Entropy Based Fuzzy Non Metric Model – Proposal, Kernelization and Pairwise Constraints –. Journal of Advanced Computational Intelligence and Intelligent Informatics (JACIII) 16(1), 169–173 (2012)Google Scholar
- 14.Inokuchi, R., Miyamoto, S.: Sparse Possibilistic Clustering with L1 Regularization. In: Proc. of The 2007 IEEE International Conference on Granular Computing (GrC 2007), pp. 442–445 (2007)Google Scholar
- 15.Hamasuna, Y., Endo, Y.: On Sparse Possibilistic Clustering with Crispness – Classification Function and Sequential Extraction. In: Joint 6th International Conference on Soft Computing and Intelligent Systems and 12th International Symposium on Advanced Intelligent Systems (SCIS & ISIS 2012), pp. 1801–1806 (2012)Google Scholar
- 16.Tsuda, K., Kudo, T.: Clustering graphs by weighted substructure mining. In: Proc. of the 23rd International Conference on Machine Learning (ICML), pp. 953–9960 (2006)Google Scholar