Iskanje po repozitoriju

Opis: Community detection reveals the functional organization of complex networks. Unlike edge-based methods, graphlet-based approaches use higher-order structures, but most studies focus on common motifs or lack validation on networks with known communities. We evaluate eight small motifs on synthetic and real-world networks and propose a framework that weights node pairs by their graphlet co-occurrence while preserving original edges. This captures both direct connections and local topology, improving community detection. Our results show that graphlet-based weighting consistently enhances performance, but no single motif is best for all networks. Simpler motifs can perform as well as dense cliques, suggesting that relying only on cliques may miss important connectivity patterns.
Ključne besede: community, network, graphlets, small-motif
Objavljeno v RUP: 01.07.2026; Ogledov: 168; Prenosov: 7
Celotno besedilo (6,14 MB)
Gradivo ima več datotek! Več...