Affinity propagation clustering on oral conversation texts

This article describes a method that applied the new clustering algorithm Affinity Propagation (AP) on oral conversation texts. And we used various measures of similarity to test the performance of this new algorithm. In our experiment, we compared the AP with the Self-Organizing Map (SOM) which is a kind of classical clustering algorithm. The experimental results showed us the Kullback-Leibler Divergence (Relative Entropy) is the best choice in affinity propagation algorithm, and it produced a better result than SOM

[1]  Samuel Kaski,et al.  Self organization of a massive document collection , 2000, IEEE Trans. Neural Networks Learn. Syst..

[2]  Fei Ding,et al.  An affinity propagation based method for vector quantization codebook design , 2008, 2008 19th International Conference on Pattern Recognition.

[3]  Michele Leone,et al.  Clustering by Soft-constraint Affinity Propagation: Applications to Gene-expression Data , 2022 .

[4]  Delbert Dueck,et al.  Clustering by Passing Messages Between Data Points , 2007, Science.

[5]  Brendan J. Frey,et al.  Non-metric affinity propagation for unsupervised image categorization , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[6]  Marc Mézard,et al.  1993 , 1993, The Winning Cars of the Indianapolis 500.