Paper title: |
A Heuristic Possibilistic Approach to Clustering for Asymmetric Data |
Published in: | Issue 1, (Vol. 5) / 2011 |
Publishing date: | 2010-04-29 |
Pages: | 87-92 |
Author(s): | VIATTCHENIN A. Dmitri |
Abstract. | This paper deals with the problem of clustering of asymmetric data. A method of the problem solving is based on the application of a direct possibilistic clustering algorithm based on the concept of allotment among fuzzy cluster to a matrix of fuzzy tolerance, which correspond to the set of objects, for which asymmetric distances or proximities hold. The paper provides the description of the method of asymmetric data preprocessing for construction of a matrix of fuzzy tolerance and basic ideas of the method of clustering. An illustrative example of asymmetric data preprocessing and clustering is given and an analysis of the experimental results of the method's application to the Sato-Ilic and Jain's asymmetric data is carried out. Preliminary conclusions are discussed. |
Keywords: | Asymmetric Data, Possibilistic Clustering, Fuzzy Preference Relation, Fuzzy Tolerance |
References: | 1. J. C. Bezdek, Pattern Recognition with Fuzzy Objective Function Algorithms. New York: Plenum Press, 1981. 2. R. Krishnapuram and J. M. Keller, “A possibilistic approach to clustering”, IEEE Trans. Fuzzy Systems, vol. 1, pp. 98–110, 1993. 3. F. Höppner, F. Klawonn, R. Kruse, and T. Runkler, Fuzzy Cluster Analysis: Methods for Classification, Data Analysis and Image Recognition. Chichester: John Wiley & Sons, 1999. 4. M. P. Windham, “Numerical classification of proximity data with assignment measures”, J. Classification, vol. 2, pp. 157– 172, 1985. 5. R. J. Hathaway, J. W. Davenport, and J. C. Bezdek, “Relational duals of the C-means clustering algorithms”, Pattern Recognition, vol. 22, pp. 205–212, 1989. 6. P. Corsini, B. Lazzerini, and F. Marcelloni, “A new fuzzy relational clustering algorithm based on the fuzzy C-means algorithm”, Soft Computing, vol. 9, pp. 439–447, 2005. 7. J. W. Owsiński, “Asymmetric distances – a natural case for fuzzy clustering?”, in Developments in Fuzzy Clustering, D. A. Viattchenin, Ed. Minsk: VEVER Publishing House, 2009, pp. 36–45. 8. M. Sato-Ilic and L. C. Jain, Innovations in Fuzzy Clustering: Theory and Applications. Heidelberg: Springer-Verlag, 2006. 9. D. A. Viattchenin, “A new heuristic algorithm of fuzzy clustering”, Control and Cybernetics, vol. 33, pp. 323–340, 2004. 10. V. B. Kuzmin, Constructing of Group Decisions in Spaces of Crisp and Fuzzy Binary Relations. Moscow: Nauka, 1982. (in Russian) 11. J.-H. Chiang, S. Yue, and Z.-X. Yin, “A new fuzzy cover approach to clustering”, IEEE Trans. Fuzzy Systems, vol. 12, pp. 199–208, 2004. 12. I. D. Mandel, Clustering Analysis. Moscow: Finansy i Statistica, 1988. (in Russian) 13. D. A. Viattchenin, “Direct algorithms of fuzzy clustering based on the transitive closure operation and their application to outliers detection”, Artificial Intelligence, no. 3. pp. 205–216, 2007. (in Russian) 14. D.A. Viattchenin, “A direct algorithm of possibilistic clustering with partial supervision”, J. Automation, Mobile Robotics and Intelligent Systems, vol. 1, no. 3, pp. 29–38, 2007. 15. D. A. Viattchenin, “An algorithm for detecting the principal allotment among fuzzy clusters and its application as a technique of reduction of analyzed features space dimensionality”, J. Information and Organizational Sciences, vol. 33, pp. 205–217, 2009. |
Back to the journal content |