2000 character limit reached
Multi-Relational Structural Entropy
Published 11 May 2024 in cs.SI, cs.IT, and math.IT | (2405.07096v1)
Abstract: Structural Entropy (SE) measures the structural information contained in a graph. Minimizing or maximizing SE helps to reveal or obscure the intrinsic structural patterns underlying graphs in an interpretable manner, finding applications in various tasks driven by networked data. However, SE ignores the heterogeneity inherent in the graph relations, which is ubiquitous in modern networks. In this work, we extend SE to consider heterogeneous relations and propose the first metric for multi-relational graph structural information, namely, Multi-relational Structural Entropy (MrSE). To this end, we first cast SE through the novel lens of the stationary distribution from random surfing, which readily extends to multi-relational networks by considering the choices of both nodes and relation types simultaneously at each step. The resulting MrSE is then optimized by a new greedy algorithm to reveal the essential structures within a multi-relational network. Experimental results highlight that the proposed MrSE offers a more insightful interpretation of the structure of multi-relational graphs compared to SE. Additionally, it enhances the performance of two tasks that involve real-world multi-relational graphs, including node clustering and social event detection.
- Statistical mechanics of complex networks. Reviews of modern physics, 74(1):47, 2002.
- Document clustering: Tf-idf approach. In 2016 International Conference on Electrical, Electronics, and Optimization Techniques (ICEEOT), pages 61–66. IEEE, 2016.
- Ginestra Bianconi. Entropy of network ensembles. Physical Review E, 79(3):036114, 2009.
- Latent dirichlet allocation. Journal of machine Learning research, 3(Jan):993–1022, 2003.
- The laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states. Annals of Combinatorics, 10:291–317, 2006.
- Knowledge-preserving incremental social event detection via heterogeneous gnns. In Proceedings of the Web Conference 2021, pages 3383–3395, 2021.
- Hierarchical and incremental structural entropy minimization for unsupervised social event detection. In Proceedings of AAAI 2024, pages 8255–8264, 2024.
- Mathematical formulation of multilayer networks. Physical Review X, 3(4):041022, 2013.
- Matthias Dehmer. Information processing in complex networks: Graph entropy and information functionals. Applied Mathematics and Computation, 201(1-2):82–94, 2008.
- metapath2vec: Scalable representation learning for heterogeneous networks. In Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining, pages 135–144, 2017.
- Magnn: Metapath aggregated graph neural network for heterogeneous graph embedding. In Proceedings of The Web Conference 2020, pages 2331–2341, 2020.
- node2vec: Scalable feature learning for networks. In Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining, pages 855–864, 2016.
- Generalized power method for sparse principal component analysis. Journal of Machine Learning Research, 11(2), 2010.
- Structural information and dynamical complexity of networks. IEEE Transactions on Information Theory, 62(6):3290–3339, 2016.
- Three-dimensional gene map of cancer cell types: Structural entropy minimisation principle for defining tumour subtypes. Scientific reports, 6(1):1–26, 2016.
- Decoding topologically associating domains with ultra-low resolution hi-c data by graph structural entropy. Nature communications, 9(1):3265, 2018.
- Story forest: Extracting events and telling stories from breaking news. ACM Transactions on Knowledge Discovery from Data (TKDD), 14(3):1–28, 2020.
- Bridging the gap between von neumann graph entropy and structural information: theory and applications. In Proceedings of the Web Conference 2021, pages 3699–3710, 2021.
- Rem: From structural entropy to community structure deception. Advances in Neural Information Processing Systems, 32, 2019.
- Are we really making much progress? revisiting, benchmarking and refining heterogeneous graph neural networks. In Proceedings of the 27th ACM SIGKDD conference on knowledge discovery & data mining, pages 1150–1160, 2021.
- A french corpus for event detection on twitter. In Proceedings of the Twelfth Language Resources and Evaluation Conference, pages 6220–6227. European Language Resources Association (ELRA), 2020.
- Building a large-scale corpus for evaluating event detection on twitter. In Proceedings of the 22nd ACM international conference on Information & Knowledge Management, pages 409–418, 2013.
- Mark EJ Newman. Finding community structure in networks using the eigenvectors of matrices. Physical review E, 74(3):036104, 2006.
- Multirank: co-ranking for objects and relations in multi-relational data. In Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 1217–1225, 2011.
- The pagerank citation ranking: Bringing order to the web. Technical report, Stanford InfoLab, 1999.
- Unsupervised attributed multiplex network embedding. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 34, pages 5371–5378, 2020.
- Reinforced, incremental and cross-lingual event detection from social messages. IEEE Transactions on Pattern Analysis and Machine Intelligence, 45(1):980–998, 2022.
- Unsupervised social bot detection via structural information theory. ACM Transactions on Information Systems, pages 1–42, 2024.
- Discrimination of isomeric structures using information theoretic topological indices. Journal of Computational Chemistry, 5(6):581–588, 1984.
- From known to unknown: quality-aware self-improving graph neural network for open set social event detection. In Proceedings of the 31st ACM International Conference on Information & Knowledge Management, pages 1696–1705, 2022.
- Uncertainty-guided boundary learning for imbalanced social event detection. IEEE Transactions on Knowledge and Data Engineering, 2023.
- Spectralnet: Spectral clustering using deep neural networks. In Proceedings of the International Conference on Learning Representations, 2018.
- Graph clustering with graph neural networks. Journal of Machine Learning Research, 24(127):1–21, 2023.
- Deep graph infomax. In Proceedings of the International Conference on Learning Representations, 2019.
- Structural entropy guided graph hierarchical pooling. In Proceedings of the International Conference on Machine Learning, pages 24017–24030. PMLR, 2022.
- Sega: Structural entropy guided anchor view for graph contrastive learning. In Proceedings of ICML, pages 1–20. PMLR, 2023.
- Unsupervised skin lesion segmentation via structural entropy minimization on multi-scale superpixel graphs. In 2023 IEEE International Conference on Data Mining (ICDM), pages 768–777. IEEE, 2023a.
- Effective and stable role-based multi-agent collaboration by structural information principles. In Proceedings of the AAAI conference on artificial intelligence, volume 37, pages 11772–11780, 2023b.
- Hierarchical state abstraction based on structural information principles. In Proceedings of IJCAI 2023, pages 4549–4557, 2023c.
- Adversarial socialbots modeling based on structural information principles. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 38, pages 392–400, 2024.
- Se-gsl: A general and effective graph structure learning framework through structural entropy optimization. In Proceedings of the ACM Web Conference 2023, pages 499–510, 2023.
- Multispans: A multi-range spatial-temporal transformer network for traffic forecast via structural entropy optimization. In Proceedings of the 17th ACM International Conference on Web Search and Data Mining, pages 1032–1041, 2024.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.