Possibility theoretic clustering

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Based on the exponential possibility model, the possibility theoretic clustering algorithm is proposed in this paper. The new algorithm is distinctive in determining an appropriate number of clusters for a given dataset while obtaining a quality clustering result. The proposed algorithm can be easily implemented using an alternative minimization iterative procedure and its parameters can be effectively initialized by the Parzon window technique and Yager's probability-possibility transformation. Our experimental results demonstrate its success in artificial datasets. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Wang, S., Chung, F. L., Xu, M., Hu, D., & Qing, L. (2005). Possibility theoretic clustering. In Lecture Notes in Computer Science (Vol. 3644, pp. 849–858). Springer Verlag. https://doi.org/10.1007/11538059_88

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free