Skip to content
Open access

Interest aware seed node detection for information diffusion in online social networks

Nov 2026 · Discover Artificial Intelligence · Vol 6 · 0 citations · 32 references

TL;DR

The proposed approach combines community-aware analysis with local influence metrics for seed detection in varied and scalable OSNs and shows that the seeds selected across the different interest groups achieve good diffusion coverage of the whole network.

Abstract

Information dissemination in Online Social Networks (OSNs) is shaped both by the structural foundation of the network and by the interest-based relationships among its users. Identifying the seed users of information diffusion in OSNs remains a challenge. Traditional seed detection methods apply centrality measures globally to uncover seed nodes and overlook seed detection based on interest groups. As a result, the selected seed nodes are often concentrated in the same locality, and efficient information diffusion remains a challenge. In this paper, we propose an interest group-based seed node detection framework for information dissemination in OSNs. The proposed approach first finds the interest groups using the Leiden community detection method; once all interest groups are detected, the seed nodes within each group are identified using Netdegree Centrality (NDC), a variant of degree centrality. Selecting influential seed nodes from every interest group ensures diversified and efficient information diffusion over the network. Experimental evaluation on eight benchmark datasets using the Independent Cascade (IC) model of information diffusion shows that the seeds selected across the different interest groups achieve good diffusion coverage of the whole network. The results show that the proposed approach combines community-aware analysis with local influence metrics for seed detection in varied and scalable OSNs.

Read PDF

Similar papers

Open access Nov 2026

SCEC: A Novel Multi-Source Neighbor Aggregation Approach for Identifying Important Nodes in Complex Networks

Identifying influential spreaders requires structural measures that capture local connectivityand a node’s position in the wider network. We propose structure and core enhanced centrality(SCEC), a ranking heuristic combining degree, clustering, coreness, and multi-orderneighbor information. The degree–clustering and fi...

Na Zhao, Guo-Lin Yang, Chao-Zhou Dai et al. · 0 citations
Open access Nov 2026

Identifying content traps in recommendation networks: comparison between regular and collective influence-based focal structure analysis

Content traps are structurally cohesive regions in recommendation networks characterized by high attraction and retention. This study compares two methods for identifying such structures, Focal Structure Analysis (FSA) and Collective Influence-Focal Structure Analysis (CI-FSA), to determine which better detects struc...

Nitin Agarwal, B. Subedi · 0 citations
Open access 2026

Active Branch Reach Centrality: A Two-Hop Structural Measure for Influential Node Identification in Complex Networks

Influential-node ranking often involves a trade-off between structural coverage and computational cost: global measures can be expensive, while very local scores may overlook useful spreading cues. We introduce Active Branch Reach Centrality (ABRC), a strict two-hop measure built from three quantities around a source n...

Chamarthi Sreenivasulu, Koduru Hajarathaiah · 0 citations
Open access Oct 2026

Community-based strategies for user-driven competitive influence maximization in social networks

Nowadays, people communicate with their friends, relatives, and colleagues through the internet. Persons/nodes and communication/edges among them form a network. Social media networks are a type of network where people share their views with the community. There are several models that capture human behavior, such as a...

R. Gautam · 0 citations
Open access Sep 2026

Robust Trust Optimization in Social Graphs: Centrality-Aware GNNs with Genetic Optimization

Precisely evaluating trust inside social networks is essential for recognizing reliable users amid chaotic and varied interactions. This research introduces a triadic hybrid model that integrates structural centrality measures, a Centrality-Aware Graph Attention Network (CA-GAT), and Genetic Algorithm (GA) optimization...

Aseel Hussein · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.