Abstract

One of the fundamental problems in clustering theory is the mutual definability of clusterings and binary relations establishing bijections between certain classes of clusterings and certain classes of binary relations. Whereas a fuzzy clustering can be generated by a binary fuzzy relation in a standard procedure, the definition of a suitable binary fuzzy relation from a given clustering holds some problems. After describing some different approaches for solving this problem we introduce a new concept in order to construct a binary fuzzy relation starting with a given clustering. This concept, called relation generating function, can be derived from the concepts of a-disjointness and c-covering for clusterings and gives the possibility to define bijections between arbitrary Ruspini (1969) partitions and certain binary fuzzy relations.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.