0
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Study on the Influence of Diversity and Quality in Entropy Based Collaborative Clustering

      research-article
      1 , 2 , * , 2 , 2
      Entropy
      MDPI
      collaborative clustering, clustering quality, entropy, diversity

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          The aim of collaborative clustering is to enhance the performances of clustering algorithms by enabling them to work together and exchange their information to tackle difficult data sets. The fundamental concept of collaboration is that clustering algorithms operate locally but collaborate by exchanging information about the local structures found by each algorithm. This kind of collaborative learning can be beneficial to a wide number of tasks including multi-view clustering, clustering of distributed data with privacy constraints, multi-expert clustering and multi-scale analysis. Within this context, the main difficulty of collaborative clustering is to determine how to weight the influence of the different clustering methods with the goal of maximizing the final results and minimizing the risk of negative collaborations—where the results are worse after collaboration than before. In this paper, we study how the quality and diversity of the different collaborators, but also the stability of the partitions can influence the final results. We propose both a theoretical analysis based on mathematical optimization, and a second study based on empirical results. Our findings show that on the one hand, in the absence of a clear criterion to optimize, a low diversity pool of solution with a high stability are the best option to ensure good performances. And on the other hand, if there is a known criterion to maximize, it is best to rely on a higher diversity pool of solution with a high quality on the said criterion. While our approach focuses on entropy based collaborative clustering, we believe that most of our results could be extended to other collaborative algorithms.

          Related collections

          Most cited references37

          • Record: found
          • Abstract: not found
          • Article: not found

          Silhouettes: A graphical aid to the interpretation and validation of cluster analysis

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Bagging predictors

              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              A cluster separation measure.

              A measure is presented which indicates the similarity of clusters which are assumed to have a data density which is a decreasing function of distance from a vector characteristic of the cluster. The measure can be used to infer the appropriateness of data partitions and can therefore be used to compare relative appropriateness of various divisions of the data. The measure does not depend on either the number of clusters analyzed nor the method of partitioning of the data and can be used to guide a cluster seeking algorithm.
                Bookmark

                Author and article information

                Journal
                Entropy (Basel)
                Entropy (Basel)
                entropy
                Entropy
                MDPI
                1099-4300
                28 September 2019
                October 2019
                : 21
                : 10
                : 951
                Affiliations
                [1 ]ISEP, DaSSIP Team–LISITE, 10 rue de Vanves, 92130 Issy-Les-Moulineaux, France
                [2 ]University Paris 13, Sorbonne Paris Cité, LIPN-CNRS UMR 7030, 99 av. J-B Clément, 93430 Villetaneuse, France; guenael.cabanes@ 123456lipn.univ-paris13.fr (G.C.); matei@ 123456lipn.univ-paris13.fr (B.M.)
                Author notes
                [* ]Correspondence: jeremie.sublime@ 123456isep.fr ; Tel.: +33-1-4954-5219
                [†]

                Most of the work presented here is the result of this author’s PhD thesis.

                [‡]

                These authors contributed to the empirical and theoretical parts of this work respectively, as well as the development of the EBCC algorithm with the first author.

                Author information
                https://orcid.org/0000-0003-0508-8550
                https://orcid.org/0000-0002-8225-7242
                https://orcid.org/0000-0001-7946-530X
                Article
                entropy-21-00951
                10.3390/e21100951
                7514282
                2a314869-4558-4553-9e3d-e6938038058b
                © 2019 by the authors.

                Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license ( http://creativecommons.org/licenses/by/4.0/).

                History
                : 09 September 2019
                : 27 September 2019
                Categories
                Article

                collaborative clustering,clustering quality,entropy,diversity

                Comments

                Comment on this article