Regularization Background of Clustering Algorithms
The paper presents the hard, fuzzy, possibilistic and maximum entropy principle clustering algorithms from the regularization theory point of view. The differences between the objective functions lay in the choice which their term is treated as the standard term and which as the regularization term.
KeywordsCluster Algorithm Vector Quantization Regularization Term Learn Vector Quantization Possibilistic Approach
Unable to display preview. Download preview PDF.
- J.C. Bezdek, Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum Press, 1987, Second Edition.Google Scholar
- P. Bogus, F. Masulli, Fuzzy and Possibilistic Approaches to Clustering, Colloquia in Artificial Intelligence, Second Polish Conference on Theory and Applications of Artificial Intelligence, Lódz, 28–30. 08. 1998.Google Scholar
- P. Bogus, A.M. Massone, F. Masulli, A. Schenone, Interactive Graphical System for Segmentation of Multimodal Medical Volumes Using Fuzzy Clustering, Machine Graphics & Vision, 7 (4), 765–780, 1998.Google Scholar
- S. Haykin. Neural Networks. A Comprehensive Foundations. Macmillan College, 1994.Google Scholar
- S. Miyamoto, M. Mukaidono. Fuzzy C-Means as a Regularization and Maximum Entropy Approach. Proceedings of the Seventh International Fuzzy Systems Association World Congress. IFSA’97 Prague, Czech Republic, June 25–29, 1997. Academia, Prague 1997. Volume II, pp. 86–92.Google Scholar
- Smyth, P. Clustering using Monte Carlo Cross-Validation, Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, AAAI Press: Menlo Park, CA. August 1996.Google Scholar