Identification of important nodes in the information propagation network based on the artificial intelligence method

• URL: http://arxiv.org/abs/2403.00190v1
• Date: Thu, 29 Feb 2024 23:43:08 GMT
• Title: Identification of important nodes in the information propagation network based on the artificial intelligence method
• Authors: Bin Yuan, Tianbo Song, Jerry Yao
• Abstract summary: We introduce a novel technique that combines the Decision-making Trial and Evaluation Laboratory (DEMATEL) and the Global Structure Model (GSM) This method is applied across various complex networks, such as social, transportation, and communication systems. Our analysis highlights the structural dynamics and resilience of these networks, revealing insights into node connectivity and community formation.
• Score: 2.1331883629523634
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This study presents an integrated approach for identifying key nodes in information propagation networks using advanced artificial intelligence methods. We introduce a novel technique that combines the Decision-making Trial and Evaluation Laboratory (DEMATEL) method with the Global Structure Model (GSM), creating a synergistic model that effectively captures both local and global influences within a network. This method is applied across various complex networks, such as social, transportation, and communication systems, utilizing the Global Network Influence Dataset (GNID). Our analysis highlights the structural dynamics and resilience of these networks, revealing insights into node connectivity and community formation. The findings demonstrate the effectiveness of our AI-based approach in offering a comprehensive understanding of network behavior, contributing significantly to strategic network analysis and optimization.

Related papers

• Initialisation and Topology Effects in Decentralised Federated Learning [1.5961625979922607]
  Decentralised federated learning enables collaborative training of individual machine learning models on distributed devices on a communication network. This approach enhances data privacy and eliminates both the single point of failure and the necessity for central coordination. We propose a strategy for uncoordinated initialisation of the artificial neural networks.
  arXiv  Detail & Related papers  (2024-03-23T14:24:36Z)
• Deep Learning Approaches for Network Traffic Classification in the Internet of Things (IoT): A Survey [0.0]
  The Internet of Things (IoT) has witnessed unprecedented growth, resulting in a massive influx of diverse network traffic from interconnected devices. Effectively classifying this network traffic is crucial for optimizing resource allocation, enhancing security measures, and ensuring efficient network management in IoT systems. Deep learning has emerged as a powerful technique for network traffic classification due to its ability to automatically learn complex patterns and representations from raw data.
  arXiv  Detail & Related papers  (2024-02-01T14:33:24Z)
• Unsupervised Graph Attention Autoencoder for Attributed Networks using K-means Loss [0.0]
  We introduce a simple, efficient, and clustering-oriented model based on unsupervised textbfGraph Attention textbfAutotextbfEncoder for community detection in attributed networks. The proposed model adeptly learns representations from both the network's topology and attribute information, simultaneously addressing dual objectives: reconstruction and community discovery.
  arXiv  Detail & Related papers  (2023-11-21T20:45:55Z)
• Learning State-Augmented Policies for Information Routing in Communication Networks [92.59624401684083]
  We develop a novel State Augmentation (SA) strategy to maximize the aggregate information at source nodes using graph neural network (GNN) architectures. We leverage an unsupervised learning procedure to convert the output of the GNN architecture to optimal information routing strategies. In the experiments, we perform the evaluation on real-time network topologies to validate our algorithms.
  arXiv  Detail & Related papers  (2023-09-30T04:34:25Z)
• ABEM: An Adaptive Agent-based Evolutionary Approach for Mining Influencers in Online Social Networks [1.6128569396451058]
  A key step in evolutionary influence in online social networks is the identification of a small number of users, known as influencers. The evolving nature of the structure of these networks makes it difficult to locate and identify these influencers. We propose an adaptive agent-based approach to address this problem in the context of both static and dynamic networks.
  arXiv  Detail & Related papers  (2021-04-14T00:31:08Z)
• Anomaly Detection on Attributed Networks via Contrastive Self-Supervised Learning [50.24174211654775]
  We present a novel contrastive self-supervised learning framework for anomaly detection on attributed networks. Our framework fully exploits the local information from network data by sampling a novel type of contrastive instance pair. A graph neural network-based contrastive learning model is proposed to learn informative embedding from high-dimensional attributes and local structure.
  arXiv  Detail & Related papers  (2021-02-27T03:17:20Z)
• Model-Based Machine Learning for Communications [110.47840878388453]
  We review existing strategies for combining model-based algorithms and machine learning from a high level perspective. We focus on symbol detection, which is one of the fundamental tasks of communication receivers.
  arXiv  Detail & Related papers  (2021-01-12T19:55:34Z)
• A Survey of Community Detection Approaches: From Statistical Modeling to Deep Learning [95.27249880156256]
  We develop and present a unified architecture of network community-finding methods. We introduce a new taxonomy that divides the existing methods into two categories, namely probabilistic graphical model and deep learning. We conclude with discussions of the challenges of the field and suggestions of possible directions for future research.
  arXiv  Detail & Related papers  (2021-01-03T02:32:45Z)
• Inter-layer Information Similarity Assessment of Deep Neural Networks Via Topological Similarity and Persistence Analysis of Data Neighbour Dynamics [93.4221402881609]
  The quantitative analysis of information structure through a deep neural network (DNN) can unveil new insights into the theoretical performance of DNN architectures. Inspired by both LS and ID strategies for quantitative information structure analysis, we introduce two novel complimentary methods for inter-layer information similarity assessment. We demonstrate their efficacy in this study by performing analysis on a deep convolutional neural network architecture on image data.
  arXiv  Detail & Related papers  (2020-12-07T15:34:58Z)
• Learning Connectivity of Neural Networks from a Topological Perspective [80.35103711638548]
  We propose a topological perspective to represent a network into a complete graph for analysis. By assigning learnable parameters to the edges which reflect the magnitude of connections, the learning process can be performed in a differentiable manner. This learning process is compatible with existing networks and owns adaptability to larger search spaces and different tasks.
  arXiv  Detail & Related papers  (2020-08-19T04:53:31Z)
• Modeling Dynamic Heterogeneous Network for Link Prediction using Hierarchical Attention with Temporal RNN [16.362525151483084]
  We propose a novel dynamic heterogeneous network embedding method, termed as DyHATR. It uses hierarchical attention to learn heterogeneous information and incorporates recurrent neural networks with temporal attention to capture evolutionary patterns. We benchmark our method on four real-world datasets for the task of link prediction.
  arXiv  Detail & Related papers  (2020-04-01T17:16:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.