Skip to main content
Log in

Self-Adjusted Consensus Clustering with Agglomerate Algorithms

  • TOPICAL ISSUE
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

This paper reports of theoretical and computational results related to an original concept of consensus clustering involving what we call the projective distance between partitions. This distance is defined as the squared difference between a partition incidence matrix and its image over the orthogonal projection in the linear space spanning the other partition incidence matrix. It appears, provided that the ensemble clustering is of a sufficient size, agglomerate clustering with the semi-average within-cluster similarity criterion effectively solves the problem of consensus partition and, moreover, of the number of clusters in it.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

REFERENCES

  1. de Amorim, R.C., Shestakov, A., Mirkin, B., et al., The Minkowski central partition as a pointer to a suitable distance exponent and consensus partitioning, Pattern Recognition, 2017, pp. 62–72.

  2. Blondel, V.D., Guillaume, J.L., Lambiotte, R., et al., Fast unfolding of communities in large networks, J. Statist. Mechan.: Theory Experiment, 2008, no. 10, pp. 10008–10016.

  3. Brandes, U., Delling, D., Gaertler, M., et al., On modularity clustering, IEEE Transactions on Knowledge and Data Engineering, 2007, vol. 20, no. 2, pp. 172–188.

    Article  Google Scholar 

  4. Fern, X. and Lin, W., Cluster ensemble selection, Statist. Anal. Data Mining: The ASA Data Sci. J., 2008, no. 1, pp. 128–141. https://doi.org/10.1002/sam.10008

  5. Guénoche, A., Consensus of partitions: a constructive approach, Advances in Data Analysis and Classification, 2011, no. 5(3), pp. 215–229.

  6. Hubert, L.J. and Arabie, P., Comparing partitions, J. Classifikat., 1985, no. 2, pp. 193–218.

  7. Kovaleva, E.V. and Mirkin, B.G., Bisecting K-means and 1D projection divisive clustering: A unified framework and experimental comparison, J. Classifikat., 2015, vol. 32, no. 2, pp. 414–442.

    Article  MathSciNet  Google Scholar 

  8. Lancichinetti, A. and Fortunato, S., Consensus clustering in complex networks, Scientific Reports, 2012, vol. 2, p. 336. https://doi.org/10.1038/srep00336

  9. Liu, P., Zhang, K., Wang, P., et al., A clustering-and maximum consensus-based model for social network large-scale group decision making with linguistic distribution, Inform. Sci., 2022, pp. 269–297.

  10. Mirkin, B., An approach to the analysis of non-numerical data, in Matematicheskie metody modelirovaniya i resheniya ekonomicheskikh zadach (Mathematical Methods for Modeling and Solving Economic Problems), Bagrinovski, K., Ed., Novosibirsk: Institute of Economics, Siberian Branch of the USSR’s Academy of Sciences, 1969, pp. 141–150.

  11. Mirkin, B., Clustering: A Data Recovery Approach, Computer Science and Data Analysis Series, vol. 19, New York: Chapman and Hall/CRC, 2012. https://doi.org/10.1201/9781420034912

  12. Mirkin, B. and Muchnik, I., Geometric interpretation of clustering criteria, in Metody analiza mnogomernoi ekonomicheskoi informatsii (Methods for Analysis of Multidimensional Economics Data), Mirkin, B., Ed., Novosibirsk: Nauka, Sib. otd., 1981, pp. 3–11.

    Google Scholar 

  13. Murtagh, F. and Contreras, P., Algorithms for hierarchical clustering: An overview, Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, 2012, no. 32, pp. 86–97.

  14. Newman, M.E., Modularity and community structure in networks, Proc. Nation. Acad. Sci., 2006, vol. 103, no. 23, pp. 8577–8582.

    Google Scholar 

  15. Pividori, M., Stegmayer, G., and Milone, D.H., Diversity control for improving the analysis of consensus clustering, Inform. Sci., 2016, no. 361, pp. 120–134.

  16. Gnatyshak, D., Ignatov, D.I., Mirkin, B.G., et al., A Lattice-based Consensus Clustering Algorithm, CLA, CEUR Workshop Proceedings, 2016, vol. 1624, pp. 45–56.

    Google Scholar 

Download references

Funding

This work was supported by ongoing institutional funding. No additional grants to carry out or direct this particular research were obtained.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to B. G. Mirkin or A. A. Parinov.

Ethics declarations

The authors of this work declare that they have no conflicts of interest.

Additional information

This paper was recommended for publication by A.A. Galyaev, a member of the Editorial Board

Publisher’s Note.

Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mirkin, B.G., Parinov, A.A. Self-Adjusted Consensus Clustering with Agglomerate Algorithms. Autom Remote Control 85, 241–251 (2024). https://doi.org/10.1134/S0005117924030044

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117924030044

Keywords:

Navigation