journal article·2023Open access

Role-Based Network Embedding via Quantum Walk with Weighted Features Fusion

Mingqiang Zhou, Mengjiao Li, Zhiyuan Qian, Kunpeng Li

Computers, Materials & Continua· Volume 76· Issue 2

Abstract

Role-based network embedding aims to embed role-similar nodes into a similar embedding space, which is widely used in graph mining tasks such as role classification and detection. Roles are sets of nodes in graph networks with similar structural patterns and functions. However, the role-similar nodes may be far away or even disconnected from each other. Meanwhile, the neighborhood node features and noise also affect the result of the role-based network embedding, which are also challenges of current network embedding work. In this paper, we propose a Role-based network Embedding via Quantum walk with weighted Features fusion (REQF), which simultaneously considers the influence of global and local role information, node features, and noise. Firstly, we capture the global role information of nodes via quantum walk based on its superposition property which emphasizes the local role information via biased quantum walk. Secondly, we utilize the quantum walk weighted characteristic function to extract and fuse features of nodes and their neighborhood by different distributions which contain role information implicitly. Finally, we leverage the Variational Auto-Encoder (VAE) to reduce the effect of noise. We conduct extensive experiments on seven real-world datasets, and the results show that REQF is more effective at capturing role information in the network, which outperforms the best baseline by up to 14.6% in role classification, and 23% in role detection on average.
Source: openalex_inverted_index · Quality: baseline

Research context

OpenAlex topics: Advanced Graph Neural Networks · Privacy-Preserving Technologies in Data · Complex Network Analysis Techniques

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

References (30)

Show source-provided references
1. Role discovery in networks10.1109/TKDE.2014.2349913 ↗
2. Traffic dynamics on multilayer networks with different speeds
3. A survey on role-oriented network embedding10.1109/TBDATA.2021.3131610 ↗
4. Role-based graph embeddings10.1109/TKDE.2020.3006475 ↗
5. RED: Learning the role embedding in networks via discrete-time quantum walk10.1007/s10489-021-02342-1 ↗
6. RoLX: Structural role extraction & mining in large graphs
7. Role-oriented graph auto-encoder guided by structural information
8. Role discovery-guided network embedding based on autoencoder and attention mechanism
9. Characteristic functions on graphs: Birds of a feather, from statistical descriptors to parametric models
10. Auto-encoding variational Bayes
11. Role-based network embedding via structural features reconstruction with degree-regularized constraint10.1016/j.knosys.2021.106872 ↗
12. On proximity and structural role-based embeddings in networks: Misconceptions, techniques, and applications10.1145/3397191 ↗
13. Learning structural node embeddings via diffusion wavelets
14. Riwalk: Fast structural node embedding via role identification
15. GraLSP: Graph neural networks with local structural patterns
16. Quantum walks: A comprehensive review10.1007/s11128-012-0432-5 ↗
17. A highly secured image encryption scheme using quantum walk and chaos10.32604/cmc.2022.028876 ↗
18. An r-convolution graph kernel based on fast discrete-time quantum walk
19. Adversarial variational embedding for robust semi-supervised learning
20. Dual adversarial variational embedding for robust recommendation
21. Purify and generate: Learning faithful item-to-item graph from noisy user-item interaction behaviors
22. Quantum computers: A review on how quantum computing can boom AI
23. QSIM: A novel approach to node proximity estimation based on discrete-time quantum walk10.1007/s10489-020-01970-3 ↗
24. It’s who you know: Graph mining using recursive structural features
25. Improved mutual information measure for clustering, classification, and community detection
26. Understanding the adjusted rand index and other partition comparison indices based on counting object pairs10.1007/s00357-022-09413-z ↗
27. Spatial association between regionalizations using the information-theoretical v-measure10.1080/13658816.2018.1511794 ↗
28. Cluster quality analysis using silhouette score
29. Conceptual and empirical comparison of dimensionality reduction algorithms (PCA, KPCA, LDA, MDS, SVD, LLE, ISOMAP, LE, ICA, t-SNE)10.1016/j.cosrev.2021.100378 ↗
30. S. Kang and S. Kyun Kim, “Outlier behavior detection for indoor environment based on t-SNE clustering,” Computers, Materials & Continua, vol. 68, no. 3, pp. 3725–3736, 2021.10.32604/cmc.2021.016828 ↗