4.6 Article

The Structure Entropy-Based Node Importance Ranking Method for Graph Data

Related references

Note: Only part of the references are listed.
Article Computer Science, Information Systems

Fast controlling of rumors with limited cost in social networks

Xiaopeng Yao et al.

Summary: This paper aims to minimize the spread time of rumors in social networks by efficiently controlling rumors through different measures for users with different influence extent. Experimental results show that the proposed WB-GA algorithm is highly efficient and effective in real online networks.

COMPUTER COMMUNICATIONS (2022)

Article Physics, Multidisciplinary

Identifying Important Nodes in Complex Networks Based on Node Propagation Entropy

Yong Yu et al.

Summary: In recent years, the identification of essential nodes in complex networks has gained significant attention. This paper proposes a novel importance metric called node propagation entropy, which accurately and stably identifies significant nodes.

ENTROPY (2022)

Article Physics, Applied

Critical nodes identification in complex networks via similarity coefficient

Pengli Lu et al.

Summary: In this paper, a new ranking method based on local structural similarity is proposed to identify critical nodes in complex networks. Experimental results demonstrate that this method outperforms other centralities in identifying critical nodes.

MODERN PHYSICS LETTERS B (2022)

Article Mathematics, Interdisciplinary Applications

Node influence ranking in complex networks: A local structure entropy approach

Mingli Lei et al.

Summary: The mining of important nodes in complex networks is a significant research field with wide applications. This paper proposes a method based on Local Structure Entropy (LSE) to assess the impact of removing nodes on network structure and verifies its effectiveness through comparison with other methods and experiments.

CHAOS SOLITONS & FRACTALS (2022)

Article Computer Science, Information Systems

Link prediction algorithm based on the initial information contribution of nodes

Yingjie Liu et al.

Summary: This paper proposes a link prediction algorithm based on the initial information contribution of nodes. By quantifying the initial information contribution of nodes and analyzing the ways of information transmission between nodes, an effective link prediction algorithm is designed. Experimental results demonstrate its significant advantages in effectiveness and robustness, as well as its good performance in practical applications.

INFORMATION SCIENCES (2022)

Article Chemistry, Multidisciplinary

Mining Algorithm of Relatively Important Nodes Based on Edge Importance Greedy Strategy

Jie Li et al.

Summary: This paper proposes an algorithm for mining relatively important nodes based on the edge importance greedy strategy. The algorithm considers the importance of the edges to determine the importance of nodes. Experimental results show that the algorithm performs well in terms of accuracy and applicability.

APPLIED SCIENCES-BASEL (2022)

Article Computer Science, Artificial Intelligence

On rough set based fuzzy clustering for graph data

Wenqian He et al.

Summary: This paper introduces a novel method of graph data clustering based on rough set theory. The method partitions the graph data into overlapping subgraph data by constructing an optimization model and updating fuzzy membership degree and cluster center. Experimental results demonstrate that the proposed method outperforms existing clustering approaches to some extent.

INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS (2022)

Article Computer Science, Artificial Intelligence

Learning to rank complex network node based on the self-supervised graph convolution model

Chen Liu et al.

Summary: This paper proposes a node ranking model based on self-supervised learning and graph convolution model, which ranks nodes based on the integrated information from node features and network structure. Information about node location and global topology is extracted from complex networks, and multi-task learning is adopted to train the model more efficiently. Experimental results demonstrate that the proposed approach outperforms existing methods on different datasets.

KNOWLEDGE-BASED SYSTEMS (2022)

Review Engineering, Multidisciplinary

A survey on network node ranking algorithms: Representative methods, extensions, and applications

JiaQi Liu et al.

Summary: This paper provides a systematic review of three representative methods for network node importance ranking, along with investigating their latest extensions and improvements in various application fields. Inspired by current literature, promising directions for future research are proposed, with conclusions that are enlightening and beneficial for both academic and industrial communities.

SCIENCE CHINA-TECHNOLOGICAL SCIENCES (2021)

Article Engineering, Multidisciplinary

Analytical features of the SIR model and their applications to COVID-19

Nikolay A. Kudryashov et al.

Summary: This study considers a classic two-parameter epidemiological SIR-model of coronavirus propagation and obtains the first integrals of the system of non-linear equations. The Painleve test shows that the system of equations is not integrable in the general case. Analytical dependencies for the number of infected patients and recovered patients on the number of susceptible individuals are obtained, with a focus on the interrelation between infected and recovered patients.

APPLIED MATHEMATICAL MODELLING (2021)

Article Computer Science, Information Systems

Graph Neural Networks for Fast Node Ranking Approximation

Sunil Kumar Maurya et al.

Summary: Graphs naturally occur in various contexts, and determining influential nodes is crucial for understanding the overall structure. Betweenness and closeness centrality are commonly used measures for identifying important nodes. Our proposed graph neural network (GNN) model improves upon current techniques for approximating betweenness and closeness centrality, showing superior performance in experiments.

ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA (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 Mathematics, Interdisciplinary Applications

Information Entropy Based on Propagation Feature of Node for Identifying the Influential Nodes

Linfeng Zhong et al.

Summary: An improved information entropy (IIE) method was proposed to identify the most influential nodes in complex networks, which is important for disease control and viral marketing. The IIE method showed better performance in Kendall's Tau and imprecision function compared to benchmark methods in six different empirical networks, especially in the Facebook network.

COMPLEXITY (2021)

Article Physics, Applied

A novel centrality measure for identifying influential nodes based on minimum weighted degree decomposition

Pengli Lu et al.

Summary: The study proposes a novel centrality method that identifies influential nodes in complex networks by combining local and global information. The method evaluates the influence of nodes by defining local and global influence, showing effectiveness in comparison experiments on real-world networks.

INTERNATIONAL JOURNAL OF MODERN PHYSICS B (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 Physics, Multidisciplinary

Influential Nodes Identification in Complex Networks via Information Entropy

Chungu Guo et al.

ENTROPY (2020)

Article Computer Science, Information Systems

Identification of influencers in complex networks by local information dimensionality

Tao Wen et al.

INFORMATION SCIENCES (2020)

Article Physics, Multidisciplinary

Phase transitions in information spreading on structured populations

Jessica T. Davis et al.

NATURE PHYSICS (2020)

Article Physics, Multidisciplinary

Identifying influential spreaders in complex networks based on improved k-shell method

Min Wang et al.

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS (2020)

Article Physics, Multidisciplinary

Influential nodes identification in complex networks based on global and local information

Yuan-Zhi Yang et al.

CHINESE PHYSICS B (2020)

Article Computer Science, Artificial Intelligence

Entropy and monotonicity in artificial intelligence

Bernadette Bouchon-Meunier et al.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2020)

Article Physics, Multidisciplinary

A Novel Method to Rank Influential Nodes in Complex Networks Based on Tsallis Entropy

Xuegong Chen et al.

ENTROPY (2020)

Review Physics, Multidisciplinary

A Survey of Information Entropy Metrics for Complex Networks

Yamila M. Omar et al.

ENTROPY (2020)

Article Computer Science, Artificial Intelligence

Identifying Influential Nodes of Complex Networks Based on Trust-Value

Jinfang Sheng et al.

ALGORITHMS (2020)

Article Computer Science, Theory & Methods

Influential node ranking in social networks based on neighborhood diversity

Ahmad Zareie et al.

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE (2019)

Article Computer Science, Artificial Intelligence

A hierarchical approach for influential node ranking in complex social networks

Ahmad Zareie et al.

EXPERT SYSTEMS WITH APPLICATIONS (2018)

Article Physics, Applied

A dynamic weighted TOPSIS method for identifying influential nodes in complex networks

Pingle Yang et al.

MODERN PHYSICS LETTERS B (2018)

Article Physics, Multidisciplinary

Node Importance Ranking of Complex Networks with Entropy Variation

Xinbo Ai

ENTROPY (2017)

Article Computer Science, Artificial Intelligence

Ranking influential nodes in social networks based on node position and neighborhood

Zhixiao Wang et al.

NEUROCOMPUTING (2017)

Review Physics, Multidisciplinary

Unification of theoretical approaches for epidemic spreading on complex networks

Wei Wang et al.

REPORTS ON PROGRESS IN PHYSICS (2017)

Article Mathematics, Interdisciplinary Applications

Influential nodes ranking in complex networks: An entropy-based approach

Ahmad Zareie et al.

CHAOS SOLITONS & FRACTALS (2017)

Article Mathematics, Interdisciplinary Applications

A new method to identify influential nodes based on relative entropy

Liguo Fei et al.

CHAOS SOLITONS & FRACTALS (2017)

Article Psychology, Multidisciplinary

The Influence of Closeness Centrality on Lexical Processing

Rutherford Goldstein et al.

FRONTIERS IN PSYCHOLOGY (2017)

Article Computer Science, Interdisciplinary Applications

A new structure entropy of complex networks based on nonextensive statistical mechanics

Qi Zhang et al.

INTERNATIONAL JOURNAL OF MODERN PHYSICS C (2016)

Article Physics, Multidisciplinary

Identifying influential spreaders in complex networks based on gravity formula

Ling-ling Ma et al.

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS (2016)

Article Physics, Multidisciplinary

Using global diversity and local topology features to identify influential network spreaders

Yu-Hsiang Fu et al.

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS (2015)

Article Physics, Multidisciplinary

Epidemic processes in complex networks

Romualdo Pastor-Satorras et al.

REVIEWS OF MODERN PHYSICS (2015)

Article Mathematics, Applied

Eigenvector centrality of nodes in multiplex networks

Luis Sola Conde et al.

CHAOS (2013)

Article Physics, Multidisciplinary

Identifying node importance based on information entropy in complex networks

Fan Wenli et al.

PHYSICA SCRIPTA (2013)

Article Physics, Fluids & Plasmas

Absence of influential spreaders in rumor dynamics

Javier Borge-Holthoefer et al.

PHYSICAL REVIEW E (2012)