DomiCom: Discovery of Top-k Dominant Communities in Networks with Node Attributes

Nikolaos Georgiadis1, Eleftherios Tiakas2 and Apostolos N. Papadopoulos1

  1. Aristotle University of Thessaloniki
    Thessaloniki, Greece
    ngeorgii@csd.auth.gr, papadopo@csd.auth.gr
  2. International Hellenic University
    Thessaloniki, Greece
    tiakas@ihu.gr

Abstract

The community structure is an inherent property of real-world networks. Broadly, a set of nodes S forms a community if its nodes exhibit a significantly higher level of interconnection with each other than with nodes outside S. The precise notion of a community, however, depends on the mathematical formulation adopted. The problem becomes more intriguing when graph nodes are enriched with attributes, as these attributes can influence how communities are defined. In this work, we incorporate node attributes to construct more meaningful communities that reflect both structural connections and attribute information. Specifically, we introduce the concept of dominance relationships between nodes: a node u is considered more important than a node v if the attributes of u dominate those of v. Experimental evaluation on real-world attributed networks demonstrate the efficiency and effectiveness of the proposed approach. The reported communities are meaningful and robust based on their significance and structural coherence.

Key words

community detection, attributed graphs, dominance relationships

Digital Object Identifier (DOI)

https://doi.org/10.2298/CSIS240430073G

Publication information

Volume 23, Issue 1 (January 2026)
Year of Publication: 2026
ISSN: 2406-1018 (Online)
Publisher: ComSIS Consortium

Full text

DownloadAvailable in PDF
Portable Document Format

How to cite

Georgiadis, N., Tiakas, E., Papadopoulos, A. N.: DomiCom: Discovery of Top-k Dominant Communities in Networks with Node Attributes. Computer Science and Information Systems, Vol. 23, No. 1, 75-112. (2026), https://doi.org/10.2298/CSIS240430073G