Direct Heuristic Algorithms of Possibilistic Clustering Based on Transitive Approximation of Fuzzy Tolerance

This paper deals with the problem of a heuristic approach to possibilistic clustering. The approach is based on the concept of allotment among fuzzy clusters. The paper provides the description of basic concepts of the heuristic approach to possibilistic clustering. Plans of direct prototype-based heuristic algorithms of possibilistic clustering based on a transitive approximation of a fuzzy tolerance are described in detail. An illustrative example of application of the basic version of the proposed algorithms to Sneath and Sokal's two- dimensional data set is considered. Preliminary conclusions are formulated.