arXiv subjects

Dengcheng Yan

Publications and source records attributed to Dengcheng Yan.

7 recordsLinked to original sources

arXiv2023

Betweenness Approximation for Edge Computing with Hypergraph Neural Network

Edge computing is highly demanded to achieve their full potentials Internet of Things (IoT), since various IoT systems have been generating big data facilitating modern latency-sensitive applications. As a basic problem, network dismantling tries to find an optimal set of nodes of which will maximize the connectivity degradation in a network. However, current approaches mainly focus on simple networks modeling only pairwise interactions between two nodes, while higher order groupwise interactions among arbitrary number of nodes are ubiquitous in real world which can be better modeled as hypernetwork. The structural difference between simple network and hypernetwork restricts the direct application of simple network dismantling methods to hypernetwork. Even though some hypernetwork centrality measures such as betweenness can be used for hypernetwork dismantling, they face the problem of balancing effectiveness and efficiency. Therefore, we propose a betweenness approximation-based hypernetwork dismantling method with hypergraph neural network, namely HND. HND trains a transferable hypergraph neural network-based regression model on plenty of generated small-scale synthetic hypernetwork in a supervised way, and utilizes the well-trained model to approximate nodes' betweenness. Extensive experiments on five real hypernetworks demonstrate the effectiveness and efficiency of HND comparing with various baselines.

cs.SI↗

arXiv2022

HyperCI: A Higher Order Collective Influence Measure for Hypernetwork Dismantling

The connectivity of networked systems is often dependent on a small portion of critical nodes. Network dismantling studies the strategy to identify a subset of nodes the removal of which will maximally destroy the connectivity of a network and fragment it into disconnected components. However, conventional network dismantling approaches focus on simple network which models only pairwise interaction between nodes while groupwise interactions among arbitrary number of nodes are ubiquitous in networked systems like integrated circuits. Groupwise interactions modeled by hypernetwork introduce higher order connectivity patterns, which limits the application of conventional network dismantling methods on hypernetwork. In this brief, we propose HyperCI, a higher order collective influence measure for hypernetwork dismantling. It considers the node co-occurrence characteristics and higher order influence ability both introduced by hyperedges in hypernetwork. We evaluate the effectiveness of our proposed HyperCI on six real world hypernetworks including integrated circuits and citation networks and the results indicate our proposed HyperCI outperforms baseline network dismantling methods for both simple network and hypernetwork.

cs.SI↗

arXiv2022

Hypernetwork Dismantling via Deep Reinforcement Learning

Network dismantling aims to degrade the connectivity of a network by removing an optimal set of nodes. It has been widely adopted in many real-world applications such as epidemic control and rumor containment. However, conventional methods usually focus on simple network modeling with only pairwise interactions, while group-wise interactions modeled by hypernetwork are ubiquitous and critical. In this work, we formulate the hypernetwork dismantling problem as a node sequence decision problem and propose a deep reinforcement learning (DRL)-based hypernetwork dismantling framework. Besides, we design a novel inductive hypernetwork embedding method to ensure the transferability to various real-world hypernetworks. Our framework first generates small-scale synthetic hypernetworks and embeds the nodes and hypernetworks into a low dimensional vector space to represent the action and state space in DRL, respectively. Then trial-and-error dismantling tasks are conducted by an agent on these synthetic hypernetworks, and the dismantling strategy is continuously optimized. Finally, the well-optimized strategy is applied to real-world hypernetwork dismantling tasks. Experimental results on five real-world hypernetworks demonstrate the effectiveness of our proposed framework.

cs.LG↗

arXiv2022

Heterogeneous Information Network-based Interest Composition with Graph Neural Network for Recommendation

Heterogeneous information networks (HINs) are widely applied to recommendation systems due to their capability of modeling various auxiliary information with meta-paths. However, existing HIN-based recommendation models usually fuse the information from various meta-paths by simple weighted sum or concatenation, which limits performance improvement because it lacks the capability of interest compositions among meta-paths. In this article, we propose an HIN-based Interest Composition model for Recommendation (HicRec). Specifically, user and item representations are learned with a graph neural network on both the graph structure and features in each meta-path, and a parameter sharing mechanism is utilized here to ensure that the user and item representations are in the same latent space. Then, users' interests in each item from each pair of related meta-paths are calculated by a combination of the user and item representations. The composed user interests are obtained by their single interest from both intra- and inter-meta-paths for recommendation. Extensive experiments are conducted on three real-world datasets and the results demonstrate that our proposed HicRec model outperforms the baselines.

cs.IR↗

arXiv2022

Session-based Social and Dependency-aware Software Recommendation

With the increase of complexity of modern software, social collaborative coding and reuse of open source software packages become more and more popular, which thus greatly enhances the development efficiency and software quality. However, the explosive growth of open source software packages exposes developers to the challenge of information overload. While this can be addressed by conventional recommender systems, they usually do not consider particular constraints of social coding such as social influence among developers and dependency relations among software packages. In this paper, we aim to model the dynamic interests of developers with both social influence and dependency constraints, and propose the Session-based Social and Dependency-aware software Recommendation (SSDRec) model. This model integrates recurrent neural network (RNN) and graph attention network (GAT) into a unified framework. An RNN is employed to model the short-term dynamic interests of developers in each session and two GATs are utilized to capture social influence from friends and dependency constraints from dependent software packages, respectively. Extensive experiments are conducted on real-world datasets and the results demonstrate that our model significantly outperforms the competitive baselines.

cs.IR↗

arXiv2021

PersonalityGate: A General Plug-and-Play GNN Gate to Enhance Cascade Prediction with Personality Recognition Task

Cascade prediction estimates the size or the state of a cascade from either microscope or macroscope. It is of paramount importance for understanding the information diffusion process such as the spread of rumors and the propagation of new technologies in social networks. Recently, instead of extracting hand-crafted features or embedding cascade sequences into feature vectors for cascade prediction, graph neural networks (GNNs) are introduced to utilize the network structure which governs the cascade effect. However, these models do not take into account social factors such as personality traits which drive human's participation in the information diffusion process. In this work, we propose a novel multitask framework for enhancing cascade prediction with a personality recognition task. Specially, we design a general plug-and-play GNN gate, named PersonalityGate, to couple into existing GNN-based cascade prediction models to enhance their effectiveness and extract individuals' personality traits jointly. Experimental results on two real-world datasets demonstrate the effectiveness of our proposed framework in enhancing GNN-based cascade prediction models and in predicting individuals' personality traits as well.

cs.SI↗

arXiv2021

MUSE: Multi-faceted Attention for Signed Network Embedding

Signed network embedding is an approach to learn low-dimensional representations of nodes in signed networks with both positive and negative links, which facilitates downstream tasks such as link prediction with general data mining frameworks. Due to the distinct properties and significant added value of negative links, existing signed network embedding methods usually design dedicated methods based on social theories such as balance theory and status theory. However, existing signed network embedding methods ignore the characteristics of multiple facets of each node and mix them up in one single representation, which limits the ability to capture the fine-grained attentions between node pairs. In this paper, we propose MUSE, a MUlti-faceted attention-based Signed network Embedding framework to tackle this problem. Specifically, a joint intra- and inter-facet attention mechanism is introduced to aggregate fine-grained information from neighbor nodes. Moreover, balance theory is also utilized to guide information aggregation from multi-order balanced and unbalanced neighbors. Experimental results on four real-world signed network datasets demonstrate the effectiveness of our proposed framework.

cs.SI↗