Information Propagation Research Articles

A study on the backlash mechanism in the propagation of brand marketing information in social network

A study on the backlash mechanism in the propagation of brand marketing information in social network

Dynamic Spatio-Temporal Hypergraph Convolutional Network for Traffic Flow Forecasting

Graph convolutional networks (GCN) are an important research method for intelligent transportation systems (ITS), but they also face the challenge of how to describe the complex spatio-temporal relationships between traffic objects (nodes) more effectively. Although most predictive models are designed based on graph convolutional structures and have achieved effective results, they have certain limitations in describing the high-order relationships between real data. The emergence of hypergraphs breaks this limitation. A dynamic spatio-temporal hypergraph convolutional network (DSTHGCN) model is proposed in this paper. It models the dynamic characteristics of traffic flow graph nodes and the hyperedge features of hypergraphs simultaneously, achieving collaborative convolution between graph convolution and hypergraph convolution (HGCN). On this basis, a hyperedge outlier removal mechanism (HOR) is introduced during the process of node information propagation to hyper-edges, effectively removing outliers and optimizing the hypergraph structure while reducing complexity. Through in-depth experimental analysis on real-world datasets, this method has better performance compared to other methods.

Rumor detection model with weighted GraphSAGE focusing on node location

While social media platforms promote people’s information exchange and dissemination, they also make rumors spread rapidly on online platforms. Therefore, how to detect rumors quickly, timely and accurately has become a hot topic for scholars in related fields. Traditional deep learning models ignore the relationship and topology between nodes in the rumor detection task and use fixed weights or mean aggregation strategies in the feature aggregation process, which fail to capture the complex interactions between nodes and the dynamics of information propagation, limiting the accuracy and robustness of the rumor detection model. To address these problems, we propose a location-aware weighted GraphSAGE rumor detection model GSMA. We first introduce an attention mechanism that dynamically assigns different attention weights to different neighboring nodes for different degrees of aggregation, improving GraphSAGE’s strategy of using mean-value aggregation for all neighboring nodes during the aggregation process; second, we introduce a modulated position encoding into the model and encode the position information of nodes into the features to improve the model’s ability to perceive the relative position and order of nodes; finally, the post text sentiment is incorporated into the features to provide additional semantic information for the model as a way to achieve rumor detection in microblogging platforms. Experiments show that the accuracy of the GSMA model on Ma-Weibo and Weibo23 reaches 97.43% and 97.55%, which is an improvement of 1.11% and 0.77% compared to the benchmark GraphSAGE, and all the evaluation metrics are also improved compared to other optimal rumor detection models.

Information Propagation in Hypergraph-Based Social Networks

Information Propagation in Hypergraph-Based Social Networks

Spatiotemporal information propagation in confined supersonic reacting flows

The interplay between mass injection, heat release, and boundary layer development plays a key role in dictating the dynamics and stability of confined supersonic flows. The relative impacts of these factors and the timescales over which they influence the upstream and downstream flow can provide critical insights into how different operating modes develop. As such, this work presents a series of simulations of an experimental axisymmetric direct connect flowpath. The mass flow rates and chemical compositions of the injection stages are varied, and subsequent information propagation and mode transitions are analyzed using spatiotemporal correlations of cross-sectional-averaged quantities. Increasing the injection flow rate decreases the time lags and durations of positive correlations between pressure and heat release at various points along the flowpath. Meanwhile, in dual-mode cases with lower injection flow rates, these correlations develop after longer time delays and persist for a longer times, illustrating how information propagates more gradually in these scenarios. Over the full flowpath, positive correlations persist for comparatively long times between (1) the upstream isolator pressure and the pressure elsewhere, and (2) the pressure in the downstream diverging combustor section and the upstream pressure. As such, the influence of the pressure in the intermediate constant-area combustor section decays more rapidly. Conditional statistics suggest that flow blockage and pressurization from the injected mass reduce the local ignition delay, thereby facilitating increased pressurization via heat release in a positive feedback loop.

Investigation of the risk influential factors of maritime accidents: A novel topology and robustness analytical framework

This study aims to develop a novel and fully data-driven approach to analyse the maritime accidents risk influential factors (RIFs) by integrating Association Rule Mining (ARM) and Complex Network (CN) modelling. Firstly, a comprehensive dataset comprising 21,206 maritime accident records from Marine Accident Investigation Branch and Transportation Safety Board is collected and processed to serve as the foundational data source supporting the development of the new approach. Secondly, a novel Combined Association Rule Mining method is proposed to extract the interconnections among RIFs, with the mined results mapped into a CN framework. Finally, two importance ranking algorithms, namely the PageRank-Information-Entropy algorithm and edge betweenness centrality, are applied to identify the key RIFs and their information transmission paths. By simulating deliberate and random attacks within this network, a robustness analysis is conducted to further explore the evolution of RIFs. The findings reveal that ship-related factors demonstrate greater centrality and connectivity, exerting a more substantial influence on information propagation within the network structure. The robustness analysis illustrates that strategic node and edge removals are effective in preventing risk propagation. It therefore makes contributions to the development of a theoretical basis for stakeholders to develop cost-effective preventive measures against specific RIFs, ultimately enhancing maritime safety.

Source localization in signed networks based on dynamic message passing algorithm

Sign characteristics of social networks play a crucial role in the process of information dissemination, and structural balance theory is a significant property of signed networks. Despite some progress in source localization, the sign features of network structures are widely overlooked. Furthermore, the impact of structural balance on tracing remains unclear. In this paper, we explore a model of information propagation in signed networks and investigate source localization in the context of a given network state snapshot. We first propose a modified signed susceptibility-infection-recovery (S-SIR) propagation model, combining the positive/negative transmission rates based on structural balance theory, which is designed to better approximate the real-world social network structure. Next, a signed dynamic message passing algorithm (S-DMP) is proposed for source localization. Simulation experiments show that the S-DMP algorithm can fully utilize both the positive and negative attributes of the edges in the signed network and outperforms other methods in terms of source localization accuracy. These experiments prove that the proposed method can be used for source localization in the early stage of information transmission. Furthermore, we find that the accuracy of source localization is highest when there is a balance between the number of positive and negative edges.

Hierarchical-Concatenate Fusion TDNN for sound event classification.

Semantic feature combination/parsing issue is one of the key problems in sound event classification for acoustic scene analysis, environmental sound monitoring, and urban soundscape analysis. The input audio signal in the acoustic scene classification is composed of multiple acoustic events, which usually leads to low recognition rate in complex environments. To address this issue, this paper proposes the Hierarchical-Concatenate Fusion(HCF)-TDNN model by adding HCF Module to ECAPA-TDNN model for sound event classification. In the HCF module, firstly, the audio signal is converted into two-dimensional time-frequency features for segmentation. Then, the segmented features are convolved one by one for improving the small receptive field in perceiving details. Finally, after the convolution is completed, the two adjacent parts are combined before proceeding with the next convolution for enlarging the receptive field in capturing large targets. Therefore, the improved model further enhances the scalability by emphasizing channel attention and efficient propagation and aggregation of feature information. The proposed model is trained and validated on the Urbansound8K dataset. The experimental results show that the proposed model can achieve the best classification accuracy of 95.83%, which is an approximate improvement of 5% (relatively) over the ECAPA-TDNN model.

Key Frame Selection for Temporal Graph Optimization of Skeleton-Based Action Recognition

Graph neural networks (GNNs) are extensively utilized to capture the spatial–temporal relationships among human body parts for skeleton-based action recognition. However, due to the inefficient information propagation caused by redundant sampling of video frames in the temporal domain, we focus on refining temporal graphs through key frame selection. To this end, we propose a multi-stage key frame selection (MSKFS) method, aiming to find the most representative frames as the graph nodes to learn compact temporal graph representations of human skeletons for action recognition. The MSKFS progressively selects key frames in two stages: (1) salient posture frame selection based on the global dynamics of body parts and (2) key frame refinement and alignment according to intra-frame correlations. The first stage captures the most salient information and aligns the corresponding information of skeleton sequences within the same category. The second stage enriches the subtle information for the integrity of the information derived by the salient frames. Moreover, variational inference is applied to differentiate the key frame refinement and alignment procedure, allowing the end-to-end optimization of arbitrary graph-based models to represent the obtained compact graph for skeleton-based action recognition. Our MSKFS method achieves state-of-the-art performances on two challenging action recognition datasets.

DMHANT: DropMessage Hypergraph Attention Network for Information Propagation Prediction.

Predicting propagation cascades is crucial for understanding information propagation in social networks. Existing methods always focus on structure or order of infected users in a single cascade sequence, ignoring the global dependencies of cascades and users, which is insufficient to characterize their dynamic interaction preferences. Moreover, existing methods are poor at addressing the problem of model robustness. To address these issues, we propose a predication model named DropMessage Hypergraph Attention Networks, which constructs a hypergraph based on the cascade sequence. Specifically, to dynamically obtain user preferences, we divide the diffusion hypergraph into multiple subgraphs according to the time stamps, develop hypergraph attention networks to explicitly learn complete interactions, and adopt a gated fusion strategy to connect them for user cascade prediction. In addition, a new drop immediately method DropMessage is added to increase the robustness of the model. Experimental results on three real-world datasets indicate that proposed model significantly outperforms the most advanced information propagation prediction model in both MAP@k and Hits@K metrics, and the experiment also proves that the model achieves more significant prediction performance than the existing model under data perturbation.

UPI-LT: Enhancing Information Propagation Predictions in Social Networks Through User Influence and Temporal Dynamics

The TEST pervasive use of social media has highlighted the importance of developing sophisticated models for early information warning systems within online communities. Despite the advancements that have been made, existing models often fail to adequately consider the pivotal role of network topology and temporal dynamics in information dissemination. This results in suboptimal predictions of content propagation patterns. This study introduces the User Propagation Influence-based Linear Threshold (UPI-LT) model, which represents a novel approach to the simulation of information spread. The UPI-LT model introduces an innovative approach to consider the number of active neighboring nodes, incorporating a time decay factor to account for the evolving influence of information over time. The model’s technical innovations include the incorporation of a homophily ratio, which assesses the similarity between users, and a dynamic adjustment of activation thresholds, which reflect a deeper understanding of social influence mechanisms. Empirical results on real-world datasets validate the UPI-LT model’s enhanced predictive capabilities for information spread.

Interweaving Insights: High-Order Feature Interaction for Fine-Grained Visual Recognition

AbstractThis paper presents a novel approach for Fine-Grained Visual Classification (FGVC) by exploring Graph Neural Networks (GNNs) to facilitate high-order feature interactions, with a specific focus on constructing both inter- and intra-region graphs. Unlike previous FGVC techniques that often isolate global and local features, our method combines both features seamlessly during learning via graphs. Inter-region graphs capture long-range dependencies to recognize global patterns, while intra-region graphs delve into finer details within specific regions of an object by exploring high-dimensional convolutional features. A key innovation is the use of shared GNNs with an attention mechanism coupled with the Approximate Personalized Propagation of Neural Predictions (APPNP) message-passing algorithm, enhancing information propagation efficiency for better discriminability and simplifying the model architecture for computational efficiency. Additionally, the introduction of residual connections improves performance and training stability. Comprehensive experiments showcase state-of-the-art results on benchmark FGVC datasets, affirming the efficacy of our approach. This work underscores the potential of GNN in modeling high-level feature interactions, distinguishing it from previous FGVC methods that typically focus on singular aspects of feature representation. Our source code is available at https://github.com/Arindam-1991/I2-HOFI.

The Role of Public Figures amidst Indonesia’s Early Social Restrictions Policy on Twitter (X): A Social Network Analysis

The Government of Indonesia implemented large-scale social restrictions (Indonesian: Pembatasan Sosial Berskala Besar, abbreviated as PSBB) following the first confirmed cases of COVID-19. Due to social media role in information propagation, this decision quickly became a trending topic on Twitter. This study investigates the main actors and the dynamics of these discussions surrounding PSBB. Utilizing RStudio software, tweets containing the keyword „psbb“ and the hashtag #psbb were mined as of May 6, 2020. The data were analyzed and compared with research conducted during May 2020. Key findings include the significant role of the musician Fiersa Besari in shaping discussions about social restrictions, the emergence of seven major opinion leaders, and the prominence of online news outlets like detikcom and CNN Indonesia in the conversation. Additionally, the study highlights critical commentary from actors affiliated with the Democratic Faction of the Indonesian House of Representatives regarding the government‘s social restrictions policies. These findings provide insights into the network dynamics and public opinion on social restrictions during the early social restrictions policy in Indonesia.

Border Gateway Protocol Route Leak Detection Technique Based on Graph Features and Machine Learning

In the Internet, ASs are interconnected using BGP. However, due to a lack of security considerations in the design of BGP, a series of security issues arise during the propagation of routing information, such as prefix hijacking, route leakage, and AS path tampering. Therefore, this paper conducts research on the detection of route leakage. By analyzing BGP routing information, we abstract the routing propagation relationship between ASs into a network topology graph, and extract graph features from the graph abstracted from routing data at certain time intervals. Based on the structural robustness features and centrality measurement features of the graph, we determine whether a route leakage has occurred during the current time period. To this end, we use machine learning methods and propose a weighted voting model. This model trains multiple single models and assigns weights to them, and through the weighted analysis of the results of multiple models, it can determine whether a route leakage has occurred. In addition, to determine the corresponding weights, we use genetic algorithms for identifying route leaks. The experimental results show that the method used in this paper has a high accuracy rate, and compared with a single model, it performs better on multiple datasets.

System-environment quantum information flow

The return of the information from the environment to the system is a phenomenon that can be related to the existence of non-Markovian mechanisms in the environment, and such a transformation of resources can be useful for quantum information applications. Thus, understanding the details of the system-environment information dynamics, i.e., the transference of quantum resources, is of key importance to design noise-resilient quantum technologies. In this Letter, we show how a quantum resource propagates from the main system to an environment, using as a model a single qubit coupled to two linear chains of qubits, and also the information dynamics among the environment qubits. In this way, we characterize the propagation of information leaving the main qubit and going through the environment. Finally, we connect the conditions for the emergence of this dynamics to the existence of quantum Darwinism. Published by the American Physical Society 2024

Influence maximization based on discrete particle swarm optimization on multilayer network

Influence maximization (IM) aims to strategically select influential users to maximize information propagation in social networks. Most of the existing studies focus on IM in single-layer networks. However, we have observed that individuals often engage in multiple social platforms to fulfill various social needs. To make better use of this observation, we consider an extended problem of how to maximize influence spread in multilayer networks. The Multilayer Influence Maximization (MLIM) problem is different from the IM problem because information propagation behaves differently in multilayer networks compared to single-layer networks: users influenced on one layer may trigger the propagation of information on another layer. Our work successfully models the information propagation process as a Multilayer Independent Cascade model in multilayer networks. Based on the characteristics of this model, we introduce an approximation function called Multilayer Expected Diffusion Value (MLEDV) for it. However, the NP-hardness of the MLIM problem has posed significant challenges to our work. To tackle the issue, we devise a novel algorithm based on Discrete Particle Swarm Optimization. Our algorithm consists of two stages: 1) the candidate node selection, where we devise a novel centrality metric called Random connectivity Centrality to select candidate nodes, which assesses the importance of nodes from a connectivity perspective. 2)the seed selection, where we employ a discrete particle swarm algorithm to find seed nodes from the candidate nodes. We use MLEDV as a fitness function to measure the spreading power of candidate solutions in our algorithm. Additionally, we introduce a Neighborhood Optimization strategy to increase the convergence of the algorithm. We conduct experiments on four real-world networks and two self-built networks and demonstrate that our algorithms are effective for the MLIM problem.

Higher-order network information propagation model based on social impact theory

User relationships are becoming increasingly diverse in current online social networks. This paper utilizes simplicial complexes in higher-order networks to depict multiple user relationships and characterize the topology of social networks. By employing social impact theory and factors such as user interest and information aging to define state transition rules among users, we establish a UAPR information propagation model based on simplicial complexes to simulate the information propagation process in higher-order social networks. The proposed model is simulated on three types of synthetic networks and four real-world simplicial complexes, demonstrating its ability to accurately describe the dynamics and influences of information propagation. Furthermore, our results indicate that different network structures, user interest values, information aging speeds, and intimacy levels significantly influence the information transmission process.

A lighter hybrid feature fusion framework for polyp segmentation

Colonoscopy is widely recognized as the most effective method for the detection of colon polyps, which is crucial for early screening of colorectal cancer. Polyp identification and segmentation in colonoscopy images require specialized medical knowledge and are often labor-intensive and expensive. Deep learning provides an intelligent and efficient approach for polyp segmentation. However, the variability in polyp size and the heterogeneity of polyp boundaries and interiors pose challenges for accurate segmentation. Currently, Transformer-based methods have become a mainstream trend for polyp segmentation. However, these methods tend to overlook local details due to the inherent characteristics of Transformer, leading to inferior results. Moreover, the computational burden brought by self-attention mechanisms hinders the practical application of these models. To address these issues, we propose a novel CNN-Transformer hybrid model for polyp segmentation (CTHP). CTHP combines the strengths of CNN, which excels at modeling local information, and Transformer, which excels at modeling global semantics, to enhance segmentation accuracy. We transform the self-attention computation over the entire feature map into the width and height directions, significantly improving computational efficiency. Additionally, we design a new information propagation module and introduce additional positional bias coefficients during the attention computation process, which reduces the dispersal of information introduced by deep and mixed feature fusion in the Transformer. Extensive experimental results demonstrate that our proposed model achieves state-of-the-art performance on multiple benchmark datasets for polyp segmentation. Furthermore, cross-domain generalization experiments show that our model exhibits excellent generalization performance.

CDAN: Convolutional dense attention-guided network for low-light image enhancement

Low-light images, characterized by inadequate illumination, pose challenges of diminished clarity, muted colors, and reduced details. Low-light image enhancement, an essential task in computer vision, aims to rectify these issues by improving brightness, contrast, and overall perceptual quality, thereby facilitating accurate analysis and interpretation. This paper introduces the Convolutional Dense Attention-guided Network (CDAN), a novel solution for enhancing low-light images. CDAN integrates an autoencoder-based architecture with convolutional and dense blocks, complemented by an attention mechanism and skip connections. This architecture ensures efficient information propagation and feature learning. During training, we utilize a composite loss function that merges L2 and VGG losses for improved numeric and perceptual results. Furthermore, a dedicated post-processing phase refines color balance and contrast. Our approach demonstrates notable progress compared to state-of-the-art results in low-light image enhancement, showcasing its robustness across a wide range of challenging scenarios. Our model performs remarkably on benchmark datasets, effectively mitigating under-exposure and proficiently restoring textures and colors in diverse low-light scenarios. This achievement underscores CDAN's potential for diverse computer vision tasks, notably enabling robust object detection and recognition in challenging low-light conditions.

Vul-LMGNNs: Fusing language models and online-distilled graph neural networks for code vulnerability detection

Code Language Models (codeLMs) and Graph Neural Networks (GNNs) are widely used in code vulnerability detection. However, a critical yet often overlooked issue is that GNNs primarily rely on aggregating information from adjacent nodes, limiting structural information transfer to single-layer updates. In code graphs, nodes and relationships typically require cross-layer information propagation to fully capture complex program logic and potential vulnerability patterns. Furthermore, while some studies utilize codeLMs to supplement GNNs with code semantic information, existing integration methods have not fully explored the potential of their collaborative effects.To address these challenges, we introduce Vul-LMGNNs that integrates pre-trained CodeLMs with GNNs, leveraging knowledge distillation to facilitate cross-layer propagation of both code semantic knowledge and structural information. Specifically, Vul-LMGNNs utilizes Code Property Graphs (CPGs) to incorporate code syntax, control flow, and data dependencies, while employing gated GNNs to extract structural information in the CPG. To achieve cross-layer information transmission, we implement an online knowledge distillation (KD) program that enables a single student GNN to acquire structural information extracted from a simultaneously trained counterpart through an alternating training procedure. Additionally, we leverage pre-trained CodeLMs to extract semantic features from code sequences. Finally, we propose an ”implicit-explicit” joint training framework to better leverage the strengths of both CodeLMs and GNNs. In the implicit phase, we utilize CodeLMs to initialize the node embeddings of each student GNN. Through online knowledge distillation, we facilitate the propagation of both code semantics and structural information across layers. In the explicit phase, we perform linear interpolation between the CodeLM and the distilled GNN to learn a late fusion model. The proposed method, evaluated across four real-world vulnerability datasets, demonstrated superior performance compared to 17 state-of-the-art approaches. Our source code can be accessed via GitHub: https://github.com/Vul-LMGNN/vul-LMGGNN.