Mapping Unseen Connections: Graph Clustering to Expose User Interaction Patterns

Expanding extensive and intricate social networks has required sophisticated community detection techniques. This study presents an innovative hybrid methodology that utilizes node space similarity and local knowledge to enhance community identification. Node space similarity is defined by integrating eigenvector centrality (EC), which quantifies a node’s influence inside the network, with proximity metrics, such as closeness, to evaluate the connectivity between nodes. This enables us to identify cohorts of individuals with analogous influence and connectivity. We use local knowledge by concentrating on these pivotal nodes' direct connections and attributes, allowing the technique to broaden community discovery (CD) outward effectively. Our five-phase methodology, grounded in an iterative seed expansion algorithm, commences with identifying highly central nodes and progressively develops communities by integrating nodes exhibiting high similarity and local connectivity. The method incorporates graph statistical inference and embedding features to improve accuracy and capture extensive network patterns. This integrated approach facilitates the precise and effective identification of communities within extensive social networks, exceeding the constraints of conventional techniques. This research attained a modularity of 95.05% on the DBLP dataset and 94.50% on the Amazon dataset. This study achieved a Normalized Mutual Information (NMI) of 91.80% on the DBLP dataset, 92.50% on the Amazon dataset, and 90.43% on the football dataset, demonstrating superior performance relative to previous methodologies. The findings indicate that the hybrid method outperforms other recognized methods in large-scale graphs, showcasing notable robustness and efficiency.