Abstract
In this study, we introduce a new clustering architecture in which several subsets of patterns can be processed together with an objective of finding a structure that is common to all of them. To reveal this structure, the clustering algorithms operating on the separate subsets of data collaborate by exchanging information about local partition matrices. In this sense, the required communication links are established at the level of information granules (more specifically, fuzzy sets forming the partition matrices) rather than patterns that are directly available in the databases. We discuss how this form of collaboration helps meet requirements of data confidentiality. A detailed clustering algorithm is developed on a basis of the standard FCM method and illustrated by means of numeric examples.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
