• A
  • A
  • A
  • АБВ
  • АБВ
  • АБВ
  • A
  • A
  • A
  • A
  • A
Обычная версия сайта
  • RU
  • EN
  • HSE University
  • Publications
  • Book chapter
  • Detecting Communities in Feature-Rich Networks with a K-Means Method
  • 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
May 25, 2026
HSE Scientists Train Neural Network to 'Hear' Faults in Electric Motors
Researchers at the AI and Digital Science Institute of the HSE Faculty of Computer Science have developed a new method—the Signature-Guided Data Augmentation (SGDA) framework—that achieves 99% accuracy in motor fault detection and 86% accuracy in fault classification. The application of this approach can reduce industrial equipment repair costs, minimise downtime, and improve production safety. The study results have been published in Engineering Applications of Artificial Intelligence.
May 25, 2026
'The Humanities Serve as a Conscience'
Maria Mizernaia studies Soviet literature and the history of book publishing. In this interview for the HSE Young Scientists project, she discusses plans to publish a novel about besieged Leningrad, AI-provoked reflections on what it means to be human, and how novels can help satisfy our dopamine hunger.
May 25, 2026
Is It Possible to Predict a Citys Life Based on the Shape of Its Neighbourhoods?
Is it possible to predict, based on the configuration of streets and buildings, where a café will open or where traffic congestion will occur? Participants in the Spatial Analysis and Modelling of Urban Processes research and study group use open data and machine learning to identify universal patterns. Alexander Sheludkov and Eduard Somov discuss the purpose of comparing cities, the need for new forms of urban statistics, and how open data is transforming approaches to urban studies.

 

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

?

Detecting Communities in Feature-Rich Networks with a K-Means Method

P. 539–547.
Shalileh S., Mirkin B.
In press

The main result of this paper is an extension of the K-means algorithm to the issue of community detection in feature-rich networks. This is based on a data-recovery criterion additively combining conventional least-squares criteria for approximation of the network link data and the feature data at network nodes. The dimension of the space at which the method operates is the sum of the number of nodes and the number of features, which may be high indeed. To tackle the so-called curse of dimensionality, we replace the innate Euclidean distance with cosine distance. We experimentally validate our proposed methods and demonstrate their efficiency by comparing them to most popular approaches using both synthetic data and real-world data.

Language: English
DOI
Keywords: Cluster analysisFeature-rich NetworksCommunity Detection

In book

Intelligent Data Engineering and Automated Learning – IDEAL 2021
Springer, 2021.
Similar publications
Community detection on simplicial complexes
Ермолаев Е. С., Applied Network Science 2025 Vol. 10 Article 30
Recent advances in complex systems have highlighted the utility of simplicial complexes for modeling higher-order interactions, particularly in biological and physical networks. This study presents enhanced Simplex2Vec, an adaptation of the Simplex2Vec algorithm, to facilitate community detection within such structures. We compare enhanced Simplex2Vec’s efficacy against the Leiden algorithm and Spectral clustering using 7 distinct ...
Added: December 30, 2025
Sensor Data Analysis by means of Clustering
Kurtc V., Prokhorov A., , in: Traffic and Granular Flow '22, Lecture Notes in Civil Engineering (LNCE, volume 443).: Singapore: Springer, 2024. P. 495–502.
Added: October 4, 2024
Sensor Data Analysis by means of Clustering
Kurtc V., Andrey Prokhorov, Lecture Notes in Civil Engineering 2024 Vol. 443 P. 495–502
Traffic jams are a big problem of the society nowadays, especially in case of urban traffic. To solve the problem of traffic congestion and air pollution, the intelligent transportation systems (ITS) should be developed and integrated into transport infrastructure. The core element of such ITS is a reliable and accurate forecasting model to predict traffic ...
Added: October 1, 2024
Community Detection in Feature-Rich Networks Using Gradient Descent Approach
Shalileh S., Mirkin B., , in: Complex Networks & Their Applications XII: Proceedings of The Twelfth International Conference on Complex Networks and their Applications: COMPLEX NETWORKS 2023, Volume 2.: Springer, 2024. Ch. 15 P. 185–196.
Added: March 5, 2024
Analysis of Categorical Data from Historical Perspectives: Essays in Honour of Shizuhiko Nishisato
Singapore: Springer, 2023.
Overviews the history of analysis of categorical data through quantification and classification Summarizes many topics relevant to the analysis of categorical data Reviews the work of those who have advanced categorical data analysis and suggests future problems ...
Added: February 3, 2024
Building a Graph-Based Recommender Using Community Embeddings
Anton Begehr, Peter Panfilov, , in: ICCTA '22: Proceedings of the 2022 8th International Conference on Computer Technology Applications.: NY: Association for Computing Machinery (ACM), 2022. Ch. 19 P. 121–127.
In this work, we explore the application of graph embedding to the design and development of a friend recommender system for the users of the social network. Graph embedding could be useful for recommendation tasks because of data compression, the feature vector format, and sub-quadratic time complexity of graph embedding. We suggest and study a ...
Added: September 26, 2022
SHS Web of Conferences. 3rd International Scientific Conference on New Industrialization and Digitalization (NID 2020)
P.: EDP Sciences, 2021.
3rd International Scientific Conference on New Industrialization and Digitalization (NID 2020) ...
Added: September 12, 2022
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
Community Partitioning over Feature-Rich Networks Using an Extended K-Means Method
Shalileh S., Mirkin B., Entropy 2022 Vol. 24 No. 5 Article 626
This paper proposes a meaningful and effective extension of the celebrated K-means algorithm to detect communities in feature-rich networks, due to our assumption of non-summability mode. We least-squares approximate given matrices of inter-node links and feature values, leading to a straightforward extension of the conventional K-means clustering method as an alternating minimization strategy for the ...
Added: August 1, 2022
Summable and nonsummable data‐driven models for community detection in feature‐rich networks
Shalileh S., Mirkin B., Social Network Analysis and Mining 2021 Vol. 11 No. 1 P. 1–23
A feature-rich network is a network whose nodes are characterized by categorical or quantitative features. We propose a data-driven model for finding a partition of the nodes to approximate both the network link data and the feature data. The model involves summary quantitative characteristics of both network links and features. We distinguish between two modes ...
Added: July 29, 2021
Least-squares community extraction in feature-rich networks using similarity data
Shalileh S., Mirkin B., Plos One 2021 Vol. 16 No. 7 Article 0254377
We explore a doubly-greedy approach to the issue of community detection in feature-rich networks. According to this approach, both the network and feature data are straightfor- wardly recovered from the underlying unknown non-overlapping communities, supplied with a center in the feature space and intensity weight(s) over the network each. Our least- squares additive criterion allows ...
Added: July 22, 2021
Detection of an unspecified number of communities in feature-rich networks
Shalileh S., Mirkin B., , in: Proceedings of MARAMI 2020 - Modèles & Analyse des Réseaux : Approches Mathématiques & Informatiques - The 11th Conference on Network Modeling and Analysis(Vol-2750)Vol. Vol-2750: Modèles & Analyse des Réseaux : Approches Mathématiques & Informatiques - Network Modeling and Analysis 2020.: CEUR-WS.org, 2020. P. 1–12.
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. Existing approaches require the number of communities pre-specified. We apply the so-called data recovery approach to ...
Added: January 13, 2021
A Method for Community Detection in Networks with Mixed Scale Features at Its Nodes
Shalileh S., Mirkin B., , in: Complex Networks & Their Applications IX. Volume 1: Proceedings of the Ninth International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2020.: Springer, 2021. P. 3–14.
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. Algorithms based on probabilistic community models require the node features to be categorical. We use a ...
Added: January 13, 2021
Proceedings of MARAMI 2020 - Modèles & Analyse des Réseaux : Approches Mathématiques & Informatiques - The 11th Conference on Network Modeling and Analysis(Vol-2750)
CEUR-WS.org, 2020.
MARAMI 2020 Modèles & Analyse des Réseaux : Approches Mathématiques & Informatiques - Network Modeling and Analysis 2020   Proceedings of MARAMI 2020 - Modèles & Analyse des Réseaux : Approches Mathématiques & Informatiques - The 11th Conference on Network Modeling and Analysis Virtual Conference, October 14-15, 2020. Edited by Roberto Interdonato CIRAD, UMR Tetis, Montpellier, France TETIS, Univ. Montpellier, AgroParisTech, CIRAD, ...
Added: November 29, 2020
  • 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