AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Powered by AMiner. Clicking this button will take you away from SciOpen.
Home Tsinghua Science and Technology Article
PDF (2.1 MB)
Cite
EndNote(RIS) BibTeX
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access

BSIN: A Behavior Schema of Information Networks Based on Approximate Bisimulation

School of Electrical Engineering, Guangxi University, Nanning 530004, China
Show Author Information

Abstract

Information networks are becoming increasingly important in practice. However, their escalating complexity is gradually impeding the efficiency of data mining. A novel network schema called the Behavior Schema of Information Networks (BSIN) is proposed to address this issue. This work defines the behavior of nodes as connected paths in BSIN, proposes a novel function distinguish behavior differences, and introduces approximate bisimulation into the acquisition of quotient sets for node types. The major highlight of BSIN is its ability to directly obtain a high-efficiency network on the basis of approximate bisimulation, rather than reducing the existing information network. It provides an effective representation of information networks, and the resulting novel network has a simple structure that more efficiently expresses semantic information than current network representations. The theoretical analysis of the connected paths between the original and the obtained networks demonstrates that errors are controllable; and semantic information is approximately retained. Case studies show that BSIN yields a simple network and is highly cost-effective.

Keywords

data mininginformation networkapproximate bisimulationcontrollable error

References

[1]

E. Michielssen and A. Boag, A multilevel matrix decomposition algorithm for analyzing scattering from large structures, IEEE Trans. Antennas Propag., vol. 44, no. 8, pp. 1086–1093, 1996.
Crossref Google Scholar
[2]
T. Mikolov, I. Sutskever, K. Chen, G. Corrado, and J. Dean, Distributed representations of words and phrases and their compositionality, in Proc. 26 th Int. Conf. Neural Information Processing Systems, Lake Tahoe, NV, USA, 2013, pp. 3111−3119.
[3]
T. Y. Fu, W. C. Lee, and Z. Lei, HIN2Vec: Explore meta-paths in heterogeneous information networks for representation learning, in Proc. 2017 ACM on Conf. Information and Knowledge Management, Singapore, 2017, pp. 1797–1806.
[4]
C. Yang, Z. Liu, D. Zhao, M. Sun, and E. Y. Chang, Network representation learning with rich text information, in Proc. 24 th Int. Conf. Artificial Intelligence, Buenos Aires, Argentina, 2015, pp. 2111–2117.
[5]
A. Grover and J. Leskovec, node2vec: Scalable feature learning for networks, in Proc. 22 nd ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, San Francisco, CA, USA, 2016, pp. 855–864.
Crossref
[6]
H. Ji, S. Z. He, L. H. Xu, K. Liu, and J. Zhao, Knowledge graph embedding via dynamic mapping matrix, in Proc. 53 rd Annu. Meeting of the Association for Computational Linguistics and the 7 th Int. Joint Conf. Natural Language Processing, Beijing, China, 2015, pp. 687–696.
Crossref
[7]
Z. Huang, Y. Zheng, R. Cheng, Y. Sun, N. Mamoulis, and X. Li, Meta structure: Computing relevance in large heterogeneous information networks, in Proc. 22 nd ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, San Francisco, CA, USA, 2016, pp. 1595–1604.
Crossref
[8]
J. Shang, M. Qu, J. Liu, L. M. Kaplan, J. Han, and J. Peng, Meta-path guided embedding for similarity search in large-scale heterogeneous information networks, arXiv preprint arXiv: 1610.09769, 2016.
[9]

C. Shi, B. Hu, W. X. Zhao, and P. S. Yu, Heterogeneous information network embedding for recommendation, IEEE Trans. Knowl. Data Eng., vol. 31, no. 2, pp. 357–370, 2019.
Crossref Google Scholar
[10]

C. Shi, Y. Li, P. S. Yu, and B. Wu, Constrained-meta-path-based ranking in heterogeneous information network, Knowl. Inf. Syst., vol. 49, no. 2, pp. 719–747, 2016.
Crossref Google Scholar
[11]

P. K. Chan, M. D. F. Schlag, and J. Y. Zien, Spectral K-way ratio-cut partitioning and clustering, IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 13, no. 9, pp. 1088–1096, 1994.
Crossref Google Scholar
[12]
C. H. Q. Ding, X. He, H. Zha, M. Gu, and H. D. Simon, A min-max cut algorithm for graph partitioning and data clustering, in Proc. 2001 IEEE Int. Conf. Data Mining, San Jose, CA, USA, 2001, pp. 107−114.
[13]
B. Gao, T. Y. Liu, X. Zheng, Q. S. Cheng, and W. Y. Ma, Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering, in Proc. 11 th ACM SIGKDD Int. Conf. Knowledge Discovery in Data Mining, Chicago, IL, USA, 2005, pp. 41–50.
Crossref
[14]
B. Hendrickson and R. Leland, A multi-level algorithm for partitioning graphs, in Proc. 1995 ACM/IEEE Conf. Supercomputing, San Diego, CA, USA, 1995, p. 28.
Crossref
[15]

G. Karypis and V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM J. Sci. Comput., vol. 20, no. 1, pp. 359–392, 1998.
Crossref Google Scholar
[16]
Z. Huang and N. Mamoulis, Heterogeneous information network embedding for meta path based proximity, arXiv preprint arXiv: 1701.05291, 2017.
[17]
H. Ji, C. Shi, and B. Wang, Attention based meta path fusion for heterogeneous information network embedding, in Proc. 15 th Pacific Rim Int. Conf. on Artificial Intelligence, Nanjing, China, 2018, pp. 348–360.
Crossref
[18]
Z. Liu, Y. Liang, X. Xie, Z. Wang, and Y. Du, FallbackWalk: A random walk based fallback for heterogeneous information network, in Proc. IEEE 6 th Int. Conf. Cloud Computing and Big Data Analytics, Chengdu, China, 2021, pp. 272–280.
Crossref
[19]

P. Pham and P. Do, W-Com2Vec: A topic-driven meta-path- based intra-community embedding for content-based heterogeneous information network, Intell. Data Anal., vol. 24, no. 5, pp. 1207–1233, 2020.
Crossref Google Scholar
[20]

N. Chairatanakul, X. Liu, and T. Murata, PGRA: Projected graph relation-feature attention network for heterogeneous information network embedding, Inf. Sci., vol. 570, pp. 769–794, 2021.
Crossref Google Scholar
[21]

Z. Zhang, J. Huang, Q. Tan, H. Sun, and Y. Zhou, CMG2Vec: A composite meta-graph based heterogeneous information network embedding approach, Knowl.-Based Syst., vol. 216, p. 106661, 2021.
Crossref Google Scholar
[22]

B. Yu, J. Hu, Y. Xie, C. Zhang, and Z. Tang, Rich heterogeneous information preserving network representation learning, Pattern Recognit., vol. 108, p. 107564, 2020.
Crossref Google Scholar
[23]
Y. Dong, N. V. Chawla, and A. Swami, metapath2vec: Scalable representation learning for heterogeneous networks, in Proc. 23 rd ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, Halifax, Canada, 2017, 135–144.
Crossref
[24]

Y. Zhang, X. Wang, N. Liu, and C. Shi, Embedding heterogeneous information network in hyperbolic spaces, ACM Trans. Knowl. Discov. Data, vol. 16, no. 2, p. 35, 2022.
Crossref Google Scholar
[25]
H. Han, T. Zhao, C. Yang, H. Zhang, Y. Liu, X. Wang, and C. Shi, Openhgnn: an open source toolkit for heterogeneous graph neural network, in Proc. of the 31st ACM International Conference on Information and Knowledge Management, Atlanta, GA, USA, 2022, pp. 3993−3997.
Crossref
Tsinghua Science and Technology
Volume 29 Issue 4,
August 2024
Pages 1092-1104
DOI: 10.26599/TST.2023.9010081
Cite this article:
Hu W, Wu J. BSIN: A Behavior Schema of Information Networks Based on Approximate Bisimulation. Tsinghua Science and Technology, 2024, 29(4): 1092-1104. https://doi.org/10.26599/TST.2023.9010081

590

Views

139

Downloads

0

Crossref

0

Web of Science

0

Scopus

0

CSCD

Altmetrics
Received: 18 April 2023
Revised: 16 July 2023
Accepted: 04 August 2023
Published: 09 February 2024
© The Author(s) 2024.

The articles published in this open access journal are distributed under the terms of theCreative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).
Return