Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
A tutorial on spectral clustering
Statistics and Computing
Comparison of Cluster Algorithms for the Analysis of Text Data Using Kolmogorov Complexity
Advances in Neuro-Information Processing
IEEE Transactions on Information Theory
Overlapping community detection in networks: The state-of-the-art and comparative study
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
In this paper we extend the crisp Affinity Propagation (AP) cluster algorithm to a fuzzy variant. AP is a message passing algorithm based on the max-sum-algorithm optimization for factor graphs. Thus it is applicable also for data sets with only dissimilarities known, which may be asymmetric. The proposed Fuzzy Affinity Propagation algorithm (FAP) returns fuzzy assignments to the cluster prototypes based on a probabilistic interpretation of the usual AP. To evaluate the performance of FAP we compare the clustering results of FAP for different experimental and real world problems with solutions obtained by employing Median Fuzzy c-Means (M-FCM) and Fuzzy c-Means (FCM). As measure for cluster agreements we use a fuzzy extension of Cohen's *** based on t-norms.