IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v39y2022i3d10.1007_s00357-022-09416-w.html
   My bibliography  Save this article

Community Detection in Feature-Rich Networks Using Data Recovery Approach

Author

Listed:
  • Boris Mirkin

    (HSE University
    Birkbeck University of London)

  • Soroosh Shalileh

    (HSE University)

Abstract

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 the problem by combining the least-squares recovery criteria for both the graph structure and node features. In this way, we obtain a new clustering criterion and a corresponding algorithm for finding clusters one-by-one. We show that our proposed method is effective on real-world data, as well as on synthetic data involving either only quantitative features or only categorical attributes or both. In the cases at which attributes are categorical, state-of-the-art algorithms are available. Our algorithm appears competitive against them.

Suggested Citation

  • Boris Mirkin & Soroosh Shalileh, 2022. "Community Detection in Feature-Rich Networks Using Data Recovery Approach," Journal of Classification, Springer;The Classification Society, vol. 39(3), pages 432-462, November.
    • Handle: RePEc:spr:jclass:v:39:y:2022:i:3:d:10.1007_s00357-022-09416-w
    DOI: 10.1007/s00357-022-09416-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00357-022-09416-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00357-022-09416-w?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Mark Chiang & Boris Mirkin, 2010. "Intelligent Choice of the Number of Clusters in K-Means Clustering: An Experimental Study with Different Cluster Spreads," Journal of Classification, Springer;The Classification Society, vol. 27(1), pages 3-40, March.
    2. Jin, Hong & Yu, Wei & Li, ShiJun, 2018. "A clustering algorithm for determining community structure in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 492(C), pages 980-993.
    3. Depril, Dirk & Van Mechelen, Iven & Mirkin, Boris, 2008. "Algorithms for additive clustering of rectangular data tables," Computational Statistics & Data Analysis, Elsevier, vol. 52(11), pages 4923-4938, July.
    4. B. Mirkin, 1987. "Additive clustering and qualitative factor analysis methods for similarity matrices," Journal of Classification, Springer;The Classification Society, vol. 4(1), pages 7-31, March.
    5. Wang, Dong & Zhao, Yi, 2019. "Network community detection from the perspective of time series," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 522(C), pages 205-214.
    6. M. E. J. Newman & Aaron Clauset, 2016. "Structure and inference in annotated networks," Nature Communications, Nature, vol. 7(1), pages 1-11, September.
    7. Ekaterina Kovaleva & Boris Mirkin, 2015. "Bisecting K-Means and 1D Projection Divisive Clustering: A Unified Framework and Experimental Comparison," Journal of Classification, Springer;The Classification Society, vol. 32(3), pages 414-442, October.
    8. Lawrence Hubert & Phipps Arabie, 1985. "Comparing partitions," Journal of Classification, Springer;The Classification Society, vol. 2(1), pages 193-218, December.
    9. Li, Yafang & Jia, Caiyan & Yu, Jian, 2015. "A parameter-free community detection method based on centrality and dispersion of nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 438(C), pages 321-334.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Soroosh Shalileh, 2023. "An Effective Partitional Crisp Clustering Method Using Gradient Descent Approach," Mathematics, MDPI, vol. 11(12), pages 1-23, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yunpeng Zhao & Qing Pan & Chengan Du, 2019. "Logistic regression augmented community detection for network data with application in identifying autism‐related gene pathways," Biometrics, The International Biometric Society, vol. 75(1), pages 222-234, March.
    2. J. Fernando Vera & Rodrigo Macías, 2021. "On the Behaviour of K-Means Clustering of a Dissimilarity Matrix by Means of Full Multidimensional Scaling," Psychometrika, Springer;The Psychometric Society, vol. 86(2), pages 489-513, June.
    3. Wang, Tao & Chen, Shanshan & Wang, Xiaoxia & Wang, Jinfang, 2020. "Label propagation algorithm based on node importance," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 551(C).
    4. Julian Rossbroich & Jeffrey Durieux & Tom F. Wilderjans, 2022. "Model Selection Strategies for Determining the Optimal Number of Overlapping Clusters in Additive Overlapping Partitional Clustering," Journal of Classification, Springer;The Classification Society, vol. 39(2), pages 264-301, July.
    5. Laura Bocci & Donatella Vicari, 2019. "ROOTCLUS: Searching for “ROOT CLUSters” in Three-Way Proximity Data," Psychometrika, Springer;The Psychometric Society, vol. 84(4), pages 941-985, December.
    6. Jaehong Yu & Hua Zhong & Seoung Bum Kim, 2020. "An Ensemble Feature Ranking Algorithm for Clustering Analysis," Journal of Classification, Springer;The Classification Society, vol. 37(2), pages 462-489, July.
    7. Ekaterina Kovaleva & Boris Mirkin, 2015. "Bisecting K-Means and 1D Projection Divisive Clustering: A Unified Framework and Experimental Comparison," Journal of Classification, Springer;The Classification Society, vol. 32(3), pages 414-442, October.
    8. Chiheb-Eddine N’Cir & Nadia Essoussi & Mohamed Limam, 2015. "Kernel-Based Methods to Identify Overlapping Clusters with Linear and Nonlinear Boundaries," Journal of Classification, Springer;The Classification Society, vol. 32(2), pages 176-211, July.
    9. Kaczynska, S. & Marion, R. & Von Sachs, R., 2020. "Comparison of Cluster Validity Indices and Decision Rules for Different Degrees of Cluster Separation," LIDAM Discussion Papers ISBA 2020009, Université catholique de Louvain, Institute of Statistics, Biostatistics and Actuarial Sciences (ISBA).
    10. Alicja Grześkowiak, 2016. "Assessment of Participation in Cultural Activities in Poland by Selected Multivariate Methods," European Journal of Social Sciences Education and Research Articles, Revistia Research and Publishing, vol. 3, January -.
    11. Wu, Han-Ming & Tien, Yin-Jing & Chen, Chun-houh, 2010. "GAP: A graphical environment for matrix visualization and cluster analysis," Computational Statistics & Data Analysis, Elsevier, vol. 54(3), pages 767-778, March.
    12. José E. Chacón, 2021. "Explicit Agreement Extremes for a 2 × 2 Table with Given Marginals," Journal of Classification, Springer;The Classification Society, vol. 38(2), pages 257-263, July.
    13. F. Marta L. Di Lascio & Andrea Menapace & Roberta Pappadà, 2024. "A spatially‐weighted AMH copula‐based dissimilarity measure for clustering variables: An application to urban thermal efficiency," Environmetrics, John Wiley & Sons, Ltd., vol. 35(1), February.
    14. Yifan Zhu & Chongzhi Di & Ying Qing Chen, 2019. "Clustering Functional Data with Application to Electronic Medication Adherence Monitoring in HIV Prevention Trials," Statistics in Biosciences, Springer;International Chinese Statistical Association, vol. 11(2), pages 238-261, July.
    15. Irene Vrbik & Paul McNicholas, 2015. "Fractionally-Supervised Classification," Journal of Classification, Springer;The Classification Society, vol. 32(3), pages 359-381, October.
    16. Maurizio Vichi & Carlo Cavicchia & Patrick J. F. Groenen, 2022. "Hierarchical Means Clustering," Journal of Classification, Springer;The Classification Society, vol. 39(3), pages 553-577, November.
    17. Batool, Fatima & Hennig, Christian, 2021. "Clustering with the Average Silhouette Width," Computational Statistics & Data Analysis, Elsevier, vol. 158(C).
    18. Patrick D. Shay & Stephen S. Farnsworth Mick, 2017. "Clustered and distinct: a taxonomy of local multihospital systems," Health Care Management Science, Springer, vol. 20(3), pages 303-315, September.
    19. Roberto Rocci & Stefano Antonio Gattone & Roberto Di Mari, 2018. "A data driven equivariant approach to constrained Gaussian mixture modeling," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 12(2), pages 235-260, June.
    20. Wan-Lun Wang, 2019. "Mixture of multivariate t nonlinear mixed models for multiple longitudinal data with heterogeneity and missing values," TEST: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(1), pages 196-222, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jclass:v:39:y:2022:i:3:d:10.1007_s00357-022-09416-w. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.