• A
  • A
  • A
  • АБВ
  • АБВ
  • АБВ
  • A
  • A
  • A
  • A
  • A
Обычная версия сайта
  • RU
  • EN
  • HSE University
  • Publications
  • Book chapter
  • Individual approximate clusters: methods, properties, applications
  • RU
  • EN
Расширенный поиск
Высшая школа экономики
Национальный исследовательский университет
Priority areas
  • business informatics
  • economics
  • engineering science
  • humanitarian
  • IT and mathematics
  • law
  • management
  • mathematics
  • sociology
  • state and public administration
by year
  • 2027
  • 2026
  • 2025
  • 2024
  • 2023
  • 2022
  • 2021
  • 2020
  • 2019
  • 2018
  • 2017
  • 2016
  • 2015
  • 2014
  • 2013
  • 2012
  • 2011
  • 2010
  • 2009
  • 2008
  • 2007
  • 2006
  • 2005
  • 2004
  • 2003
  • 2002
  • 2001
  • 2000
  • 1999
  • 1998
  • 1997
  • 1996
  • 1995
  • 1994
  • 1993
  • 1992
  • 1991
  • 1990
  • 1989
  • 1988
  • 1987
  • 1986
  • 1985
  • 1984
  • 1983
  • 1982
  • 1981
  • 1980
  • 1979
  • 1978
  • 1977
  • 1976
  • 1975
  • 1974
  • 1973
  • 1972
  • 1971
  • 1970
  • 1969
  • 1968
  • 1967
  • 1966
  • 1965
  • 1964
  • 1963
  • 1958
  • More
Subject
News
August 18, 2026
HSE Scholar Presents Research on Postcards in Brazil and South Korea
Timur Khusyainov, Deputy Dean of theFaculty of Humanities atHSE University–Nizhny Novgorod, took part in two international conferences—the XVI World Congress of Rural Sociology in Porto Alegre, Brazil, and the 36th Annual Conference of the Alliance of Digital Humanities Organisations (DH2026) in Daejeon, South Korea. On his way to the conferences, the researcher also visited several other places, where he presented the experience of the Pochtovoe educational project.
August 18, 2026
Physicists Discover What Happens Inside a Stable Vortex
Large vortices with characteristic spiral arms are often observed in the atmosphere and the ocean. Physicists from HSE University have explained how these structures form and why they retain their shape. The researchers found that velocities at points located along the same vortex arc remain correlated even over long distances. At the same time, this correlation weakens rapidly with increasing distance from the vortex centre. These differences help explain the formation of spiral arms and may improve models of atmospheric and oceanic currents. The findings have been published in Physical Review Fluids.
August 17, 2026
‘I Dream of Simple Things
Anastasia Gergenreter specialises in applied statistics and econometrics. In this interview for the Young Scientists of HSE University project, she talked about why she studies addictive substance use, two very different Fishers, and the cherry blossom season at the Main Botanical Garden in Moscow.

 

Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!

Publications
  • Books
  • Articles
  • Chapters of books
  • Working papers
  • Report a publication
  • Research at HSE

?

Individual approximate clusters: methods, properties, applications

P. 26–37.
Mirkin B.

A least-squares data approximation approach to finding individual clusters is advocated. A simple local optimization algorithm leads to suboptimal clusters satisfying some natural tightness criteria. Three versions of an iterative extraction approach are considered, leading to a portrayal of the cluster structure of the data. Of these, probably most promising is what is referred to as the incjunctive clustering approach. Applications are considered to the analysis of semantics, to integrating different knowledge aspects and consensus clustering.

Language: English
Full text
Keywords: consensus clusteringdata recovery approachsingle clusterkernel cluster
Publication based on the results of:
Методы визуализации текстовой информации с помощью построения суффиксных деревьев, мультифасетных классификаций и иерархических онтологий: алгоритмическое и программное обеспечение (2013)

In book

Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
Issue 8170: Lecture Notes in Artificial Intelligence. , Heidelberg: Springer, 2013.
Similar publications
Агломеративный консенсусный кластер-анализ с автоматическим выбором числа кластеров
Mirkin B., Parinov A., Автоматика и телемеханика 2024 № 3 С. 6–22
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. ...
Added: February 24, 2025
Piece‐wise constant cluster modelling of dynamics of upwelling patterns
Nascimento S., Martins A., Relvas P. et al., Expert Systems: The Journal of Knowledge Engineering 2023 P. 1–16
A comprehensive approach is presented to analyse season's coastal upwelling represented by weekly sea surface temperature (SST) image grids. Our three-stage data recovery clustering method assumes that the season's upwelling can be divided into shorter periods of stability, ranges, each to be represented by a constant core and variable shell parts. Corresponding clustering algorithms parameters ...
Added: October 16, 2023
Community Detection in Feature-Rich Networks Using Data Recovery Approach
Mirkin B., Shalileh S., Journal of Classification 2022 Vol. 39 P. 432–462
The problem of community detection in a network with features at its nodes takes into account both the graph structure and node features. The goal is to find relatively dense groups of interconnected entities sharing some features in common. There have been several approaches proposed for that. We apply the so-called data recovery approach to ...
Added: August 1, 2022
A One-by-One Method for Community Detection in Attributed Networks
Shalileh S., Mirkin B., , in: Intelligent Data Engineering and Automated Learning – IDEAL 2020/ 21st International Conference, Guimaraes, Portugal, November 4–6, 2020, Proceedings, Part IIVol. 12490: Lecture Notes in Computer Science.: Cham: Springer, 2020. P. 413–422.
The problem of community detection in a network with features at its nodes takes into account both the graph structure and node features. The goal is to find relatively dense groups of interconnected entities sharing some features in common. We apply the so-called data recovery approach to the problem by combining the least-squares recovery criteria ...
Added: November 14, 2020
A Lattice-based Consensus Clustering Algorithm
Бочаров А. А., Gnatyshak D. V., Ignatov D. I. et al., , in: CLA 2016: Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications. CEUR Workshop ProceedingsVol. 1624.: M.: Higher School of Economics, National Research University, 2016. P. 45–56.
We propose a new algorithm for consensus clustering, FCA-Consensus, based on Formal Concept Analysis. As the input, the algorithm takes T partitions of a certain set of objects obtained by k-means algorithm after T runs from different initialisations. The resulting consensus partition is extracted from an antichain of the concept lattice built on a formal ...
Added: October 24, 2016
A Note on the Effectiveness of the Least Squares Consensus Clustering
Mirkin B., Shestakoff A., , in: Clusters, orders, trees: methods and applications. In Honor of Boris Mirkin's 70th BirthdayVol. 92.: Berlin: Springer, 2014.
We develop a consensus clustering framework proposed three decades ago in Russia and experimentally demonstrate that our least squares consensus clustering algorithm consistently outperforms several recent consensus clustering methods. ...
Added: January 23, 2015
Summary and semi-average similarity criteria for individual clusters
Mirkin B., , in: Models, Algorithms, and Technologies for Network AnalysisVol. 59.: NY: Springer, 2013. P. 101–126.
There exists much prejudice against the within-cluster summary similarity criterion which supposedly leads to collecting all the entities in one cluster. This is not so if the similarity matrix is pre-processed by subtraction of ``noise'', of which two ways, the uniform and modularity, are mentioned in the paper. Another criterion under consideration is the semi-average ...
Added: November 22, 2013
Least squares consensus clustering: criteria, methods, experiments
Mirkin B., Shestakoff A., , in: Advances in Information Retrieval.: L.: Springer, 2013. P. 764–768.
We develop a consensus clustering framework developed three decades ago in Russia and experimentally demonstrate that our least squares consensus clustering algorithm consistently outperforms several recent consensus clustering methods. ...
Added: April 15, 2013
  • About
  • About
  • Key Figures & Facts
  • Sustainability at HSE University
  • Faculties & Departments
  • International Partnerships
  • Faculty & Staff
  • HSE Buildings
  • HSE University for Persons with Disabilities
  • Public Enquiries
  • Studies
  • Admissions
  • Programme Catalogue
  • Undergraduate
  • Graduate
  • Exchange Programmes
  • Summer University
  • Summer Schools
  • Semester in Moscow
  • Business Internship
  • Research
  • International Laboratories
  • Research Centres
  • Research Projects
  • Monitoring Studies
  • Conferences & Seminars
  • Academic Jobs
  • Yasin (April) International Academic Conference on Economic and Social Development
  • Media & Resources
  • Publications by staff
  • HSE Journals
  • Publishing House
  • iq.hse.ru: commentary by HSE experts
  • Library
  • Economic & Social Data Archive
  • Video
  • HSE Repository of Socio-Economic Information
  • HSE1993–2026
  • Contacts
  • Copyright
  • Privacy Policy
  • Site Map
Edit