4.7 Article

LSS: A locality-based structure system to evaluate the spreader's importance in social complex networks

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Computer Science, Artificial Intelligence

Identification of City Hotspots by Analyzing Telecom Call Detail Records Using Complex Network Modeling

Giridhar Maji et al.

Summary: This paper analyzes Telecom big data called call detail records (CDR) to identify hotspot locations in cities. By modeling the CDR data as a weighted network and applying network analysis tools, important nodes representing hotspot locations can be identified. The paper also compares hotspot patterns over time and validates the findings with ground truth data.

EXPERT SYSTEMS WITH APPLICATIONS (2023)

Article Computer Science, Artificial Intelligence

A novel relevance-based information interaction model for community detection in complex networks

Aman Ullah et al.

Summary: Identification of patronized communities in complex networks is crucial for network analysis. Existing methods are unable to effectively address the severity of the problem. We propose a novel Relevance-based Information Interaction Model (RIIM) that can identify communities in complex networks without prior knowledge and configuration. Extensive experiments demonstrate the superior performance of RIIM in identifying communities in complex networks.

EXPERT SYSTEMS WITH APPLICATIONS (2022)

Article Computer Science, Information Systems

Identification of influential nodes in complex networks: A local degree dimension approach

Shen Zhong et al.

Summary: The importance of research on complex networks is increasing, and identifying influential nodes remains an urgent and crucial issue. This paper proposes a Local Degree Dimension (LDD) approach that assesses the importance of nodes in complex networks by considering the increasing and decreasing rates of the numbers of each layer neighbor nodes. Experimental results demonstrate the effectiveness of LDD in accurately identifying influential nodes and quantifying their importance.

INFORMATION SCIENCES (2022)

Article Computer Science, Artificial Intelligence

The role of influential nodes and their influence domain in community detection: An approximate method for maximizing modularity

Rouhollah Javadpour Boroujeni et al.

Summary: Community detection is a method to simplify network analysis and understand network behavior and function. Modularity is a common measure used in various approaches, and identifying influential nodes is also important for community detection in complex networks.

EXPERT SYSTEMS WITH APPLICATIONS (2022)

Article Computer Science, Artificial Intelligence

Semi-global triangular centrality measure for identifying the influential spreaders from undirected complex networks

Amrita Namtirtha et al.

Summary: This article classifies the methods for identifying influential spreaders into four categories: local centrality, global centrality, semi-global centrality, and hybrid centrality. Semi-global centrality based methods are found to be highly effective in identifying influential spreaders from different network structures. However, existing methods tend to overlook the spreaders from the periphery of a network. To address this issue, the authors propose a new indexing method called semiglobal triangular centrality, which focuses on selecting the best spreaders from the dense part of a network. Experimental results show that this method outperforms other centrality methods in terms of spreading dynamics.

EXPERT SYSTEMS WITH APPLICATIONS (2022)

Article Computer Science, Information Systems

The random walk-based gravity model to identify influential nodes in complex networks

Jie Zhao et al.

Summary: The article introduces the methods for identifying influential nodes in complex networks and the existing problems. It proposes a random walk-based gravity model to solve this problem, and through experiments, it demonstrates the superior performance of the model.

INFORMATION SCIENCES (2022)

Article Computer Science, Artificial Intelligence

Semi-global triangular centrality measure for identifying the influential spreaders from undirected complex networks

Amrita Namtirtha et al.

Summary: The article summarizes methods for identifying influential spreaders, proposes a new method based on semi-global centrality, and demonstrates its potential in various types of network structures. Experimental results show that the proposed method performs well in terms of spreading dynamics.

EXPERT SYSTEMS WITH APPLICATIONS (2022)

Article Computer Science, Artificial Intelligence

Identifying vital nodes from local and global perspectives in complex networks

Aman Ullah et al.

Summary: Recognition of vital nodes in complex networks is crucial for improving network robustness and vulnerability. Existing methods have limitations, leading to the proposal of a Local-and-Global Centrality (LGC) algorithm to address both local and global aspects of network topology simultaneously. Experiments show that LGC outperforms many state-of-the-art techniques in identifying vital nodes.

EXPERT SYSTEMS WITH APPLICATIONS (2021)

Article Computer Science, Artificial Intelligence

Identifying and ranking super spreaders in real world complex networks without influence overlap

Giridhar Maji et al.

Summary: The study focuses on identifying super spreaders in complex networks, proposing a heuristic template based on node degree, closeness, and coreness for ranking. It evaluates the use of k-shell and m-shell as coreness measures in two variants and uses a geodesic-based constraint for selecting initial seed nodes. The experimental simulation with the SIR spreading model and evaluation with performance metrics on benchmark real-world networks demonstrate the superiority of the proposed methods.

EXPERT SYSTEMS WITH APPLICATIONS (2021)

Article Mathematics, Interdisciplinary Applications

Identification of Influential Nodes via Effective Distance-based Centrality Mechanism in Complex Networks

Aman Ullah et al.

Summary: The study introduced a novel effective distance-based centrality (EDBC) algorithm for identifying influential nodes in complex networks, which outperformed existing techniques in a valuable margin. The algorithm considers factors such as the power of K-shell, degree nodes, effective distance, and levels of neighbor's influence, and was evaluated on nine real-world networks.

COMPLEXITY (2021)

Article Multidisciplinary Sciences

Identification of nodes influence based on global structure model in complex networks

Aman Ullah et al.

Summary: The study introduces the Global Structure Model (GSM) for identifying influential nodes in complex networks, considering both self-influence and global influence. By applying GSM, the results show that it outperforms baseline algorithms in identifying influential nodes.

SCIENTIFIC REPORTS (2021)

Article Computer Science, Hardware & Architecture

Graph partition based privacy-preserving scheme in social networks

Hongyan Zhang et al.

Summary: This study proposes a Graph Partition based Privacy-preserving Scheme (GPPS) to anonymize users' identities in social networks through node clustering and graph modification, achieving k-anonymity to reduce privacy risks. By introducing degree-based graph entropy in similarity matrix calculation, accurate node clustering is achieved, and graph modification further ensures k-anonymity while minimizing information loss, proving to be effective and efficient on both synthetic and real datasets.

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS (2021)

Article Computer Science, Artificial Intelligence

An improved gravity model to identify influential nodes in complex networks based on k-shell method

Xuan Yang et al.

Summary: This study introduces an improved gravity centrality measure KSGC based on the k-shell algorithm, which can effectively evaluate the importance of nodes in complex networks.

KNOWLEDGE-BASED SYSTEMS (2021)

Article Computer Science, Information Systems

Identifying Influential Nodes in Two-Mode Data Networks Using Formal Concept Analysis

Mohamed Hamza Ibrahim et al.

Summary: This paper introduces a new bipartite centrality measurement BF for identifying important nodes in two-mode networks. Using Formal Concept Analysis, BF quantifies how nodes have cohesive substructure influence through bicliques, outperforming traditional centrality measures in accuracy and computation speed.

IEEE ACCESS (2021)

Article Computer Science, Theory & Methods

Neighborhood-based bridge node centrality tuple for complex network analysis

Natarajan Meghanathan

Summary: The study introduces a computationally light neighborhood-based bridge node centrality (NBNC) tuple to identify bridge nodes in a network and rank nodes based on their topological position. The NBNC tuple for a node is asynchronously computed based on the node's neighborhood graph, comprising of components number, algebraic connectivity ratio, and number of neighbors. Evaluation of the NBNC tuple across 60 complex real-world networks highlights its computational lightness, effectiveness, efficiency/accuracy, and uniqueness compared to existing centrality metrics and community detection algorithms.

APPLIED NETWORK SCIENCE (2021)

Article Physics, Multidisciplinary

Identifying influential nodes in Social Networks: Neighborhood Coreness based voting approach

Sanjay Kumar et al.

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS (2020)

Article Computer Science, Artificial Intelligence

Influential spreaders identification in complex networks with improved k-shell hybrid method

Giridhar Maji et al.

EXPERT SYSTEMS WITH APPLICATIONS (2020)

Review Computer Science, Artificial Intelligence

A systematic survey on influential spreaders identification in complex networks with a focus on K-shell based techniques

Giridhar Maji et al.

EXPERT SYSTEMS WITH APPLICATIONS (2020)

Article Computer Science, Artificial Intelligence

InfGCN: Identifying influential nodes in complex networks with graph convolutional networks

Gouheng Zhao et al.

NEUROCOMPUTING (2020)

Review Computer Science, Hardware & Architecture

Influential nodes selection to enhance data dissemination in mobile social networks: A survey

Muluneh Mekonnen Tulu et al.

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS (2020)

Article Computer Science, Artificial Intelligence

A General Centrality Framework-Based on Node Navigability

Pasquale De Meo et al.

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2020)

Article Computer Science, Artificial Intelligence

Finding key players in complex networks through deep reinforcement learning

Changjun Fan et al.

NATURE MACHINE INTELLIGENCE (2020)

Article Engineering, Multidisciplinary

A Time-Dependent SIR Model for COVID-19 With Undetectable Infected Persons

Yi-Cheng Chen et al.

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING (2020)

Article Computer Science, Information Systems

A Novel Centrality of Influential Nodes Identification in Complex Networks

Yuanzhi Yang et al.

IEEE ACCESS (2020)

Article Computer Science, Information Systems

Identification of influential users in social networks based on users' interest

Ahmad Zareie et al.

INFORMATION SCIENCES (2019)

Article Automation & Control Systems

Content Propagation for Content-Centric Networking Systems From Location-Based Social Networks

Yuxin Liu et al.

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS (2019)

Article Computer Science, Artificial Intelligence

Framework of Evolutionary Algorithm for Investigation of Influential Nodes in Complex Networks

Yang Liu et al.

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2019)

Article Computer Science, Artificial Intelligence

Ranking nodes in complex networks based on local structure and improving closeness centrality

Chiman Salavati et al.

NEUROCOMPUTING (2019)

Article Computer Science, Cybernetics

Temporal Sequence of Retweets Help to Detect Influential Nodes in Social Networks

Ayan Kumar Bhowmick et al.

IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS (2019)

Article Computer Science, Information Systems

SIMiner: A Stigmergy-Based Model for Mining Influential Nodes in Dynamic Social Networks

Weihua Li et al.

IEEE TRANSACTIONS ON BIG DATA (2019)

Article Computer Science, Information Systems

Identification of Key Nodes in Aircraft State Network Based on Complex Network Theory

Wang Zekun et al.

IEEE ACCESS (2019)

Article Computer Science, Information Systems

PHG: A Three-Phase Algorithm for Influence Maximization Based on Community Structure

Liqing Qiu et al.

IEEE ACCESS (2019)

Article Computer Science, Information Systems

Identifying Influential Nodes in Complex Networks Based on Local Neighbor Contribution

Jinying Dai et al.

IEEE ACCESS (2019)

Article Mathematics, Interdisciplinary Applications

Density centrality: identifying influential nodes based on area density formula

Ahmed Ibnoulouafi et al.

CHAOS SOLITONS & FRACTALS (2018)

Article Computer Science, Information Systems

CDA: A Clustering Degree Based Influential Spreader Identification Algorithm in Weighted Complex Network

Qian Wang et al.

IEEE ACCESS (2018)

Article Mathematics, Applied

The epidemic spreading on the multi-relationships network

Fuzhong Nian et al.

APPLIED MATHEMATICS AND COMPUTATION (2018)

Article Multidisciplinary Sciences

A change of perspective in network centrality

Carla Sciarra et al.

SCIENTIFIC REPORTS (2018)

Article Mathematics, Interdisciplinary Applications

Evidential identification of influential nodes in network of networks

Meizhu Li et al.

CHAOS SOLITONS & FRACTALS (2018)

Article Mathematics, Interdisciplinary Applications

A new evidential methodology of identifying influential nodes in complex networks

Tian Bian et al.

CHAOS SOLITONS & FRACTALS (2017)

Article Physics, Multidisciplinary

Complex network analysis of time series

Zhong-Ke Gao et al.

Article Computer Science, Artificial Intelligence

Identifying social influence in complex networks: A novel conductance eigenvector centrality model

Xujun Li et al.

NEUROCOMPUTING (2016)

Article Physics, Multidisciplinary

Characteristics on hub networks of urban rail transit networks

Jianhua Zhang et al.

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS (2016)

Article Physics, Multidisciplinary

A modified weighted TOPSIS to identify influential nodes in complex networks

Jiantao Hu et al.

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS (2016)

Review Physics, Multidisciplinary

Vital nodes identification in complex networks

Linyuan Lu et al.

PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS (2016)

Article Multidisciplinary Sciences

The H-index of a network node and its relation to degree and coreness

Linyuan Lue et al.

NATURE COMMUNICATIONS (2016)

Article Computer Science, Information Systems

Identifying effective influencers based on trust for electronic word-of-mouth marketing: A domain-aware approach

Shixi Liu et al.

INFORMATION SCIENCES (2015)

Article Physics, Multidisciplinary

A k-shell decomposition method for weighted networks

Antonios Garas et al.

NEW JOURNAL OF PHYSICS (2012)

Article Physics, Multidisciplinary

Identifying influential nodes in complex networks

Duanbing Chen et al.

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS (2012)

Article Automation & Control Systems

A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks

Ramasuri Narayanam et al.

IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING (2011)

Article Physics, Fluids & Plasmas

Benchmark graphs for testing community detection algorithms

Andrea Lancichinetti et al.

PHYSICAL REVIEW E (2008)

Article Physics, Condensed Matter

Betweenness centrality in large complex networks

M Barthélemy

EUROPEAN PHYSICAL JOURNAL B (2004)