Anzeige
Erschienen in:
2016 | OriginalPaper | Buchkapitel
Detecting and Analyzing Invariant Groups in Complex Networks
verfasst von : Dulal Mahata, Chanchal Patra
Erschienen in: Computational Intelligence in Data Mining—Volume 1
Verlag: Springer India
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
Real-world complex networks usually exhibit inhomogeneity in functional properties, resulting in densely interconnected nodes, communities. Analyzing such communities in large networks has rapidly become a major area in network science. A major limitation of most of the community finding algorithms is the dependence on the ordering in which vertices are processed. However, less study has been conducted on the effect of vertex ordering in community detection. In this paper, we propose a novel algorithm, DIGMaP to identify the invariant groups of vertices which are not affected by vertex ordering. We validate our algorithm with the actual community structure and show that these detected groups are the core of the community.