基于SCL-CMM模型的超网络链路预测方法

任玉媛; 马宏; 刘树新; 王凯

doi:10.11959/j.issn.2096-109x.2024039

您当前的位置：

首页 >

文章列表页 >

基于SCL-CMM模型的超网络链路预测方法

学术论文 | 更新时间：2024-08-14

- 基于SCL-CMM模型的超网络链路预测方法
- Hypernetwork link prediction method based on the SCL-CMM model
- 网络与信息安全学报 2024年10卷第3期页码：52-65
- 作者机构：
  
  信息工程大学，河南郑州 450001
- 作者简介：
  
  [ "任玉媛（1997- ），女，河北张家口人，信息工程大学硕士生，主要研究方向为链路预测。" ]
  [ "马宏（1968- ），男，江苏东台人，国家数字交换系统工程技术研究中心研究员，主要研究方向为社会网络分析、电信网关防护。" ]
  [ "刘树新（1987- ），男，山东潍坊人，博士，国家数字交换系统工程技术研究中心助理研究员，主要研究方向为复杂网络、网络信息挖掘。" ]
  [ "王凯（1980- ），男，博士，国家数字交换系统工程技术研究中心副研究员，主要研究方向链路预测、社会网络分析。" ]
- 基金信息：
  
  中原英才计划项目(6212101510002)
- DOI：10.11959/j.issn.2096-109x.2024039
  中图分类号： TP301.6
- 收稿：2023-01-04，
  
  修回：2023-06-03，
  
  纸质出版：2024-06-25
- 稿件说明：
移动端阅览
任玉媛, 马宏, 刘树新, 等. 基于SCL-CMM模型的超网络链路预测方法[J]. 网络与信息安全学报, 2024, 10(3): 52-65.

REN Y Y, MA H, LIU S X, et al. Hypernetwork link prediction method based on the SCL-CMM model[J]. Chinese Journal of Network and Information Security, 2024, 10(3): 52-65.
任玉媛, 马宏, 刘树新, 等. 基于SCL-CMM模型的超网络链路预测方法[J]. 网络与信息安全学报, 2024, 10(3): 52-65. DOI： 10.11959/j.issn.2096-109x.2024039.

REN Y Y, MA H, LIU S X, et al. Hypernetwork link prediction method based on the SCL-CMM model[J]. Chinese Journal of Network and Information Security, 2024, 10(3): 52-65. DOI： 10.11959/j.issn.2096-109x.2024039.

摘要

图为建模现实系统的内在交互提供了一种有效的方式，但却无法显示捕获的多个实体之间广泛存在的高阶异质性，超图则可以很好地突破低阶关系的限制。超网络的链路预测就是根据观测到的超图结构来预测未知的超链路，因其可以充分地刻画复杂系统的关联模式而成为网络科学中的热点问题。现有的方法通常针对整个拓扑结构设计推理模型，忽略了网络中隐含的聚集特性，导致预测的超链路类别不全面。针对上述问题，提出了基于超图谱聚类解析器的协调矩阵最小化（coordination matrix minimization based on hyper graph spectral clustering parser，SCL-CMM）模型的超网络链路预测方法。该方法将高阶超网络映射到具有一定语义的异质超图上，然后利用谱聚类解析器来提取超链路的结构特征，将原始超图重构为多个同质子图，进而在子图的观测空间而不是整个网络的邻接空间推断潜在超链路的分布情况，还原完整的超网络结构。该方法联合学习超网络的结构特征与集聚属性来建模各个子图的高阶非线性行为，解决了异构超图链路预测类别单一、精度低的问题。在9个真实数据集上进行了大量的对比实验表明，该方法在AUC（area under curve）评分和召回率方面都显著优于现有方法。

Abstract

An effective method for the internal interaction within modeling reality systems is provided by graphs; however

they have been unable to effectively display and capture the high-order heterogeneity that widely exists between multiple entities. Hypergraphs have been recognized for their ability to surpass the limitations imposed by low-order relationships. Hypernetwork link prediction

which involves predicting unknown hyperlinks based on the observed hypergraph structure

has increasingly become a hot topic in network science due to its capacity to fully describe the association patterns of complex systems. Existing methods typically design reasoning models for the entire topology

often overlooking the implicit aggregation characteristics within the network

which leads to an incomplete prediction of hyperlink categories. To address these issues

a coordination matrix minimization model based on hypergraph spectral clustering parser (SCL-CMM) was proposed. Initially

higher-order hypernetworks were mapped into heterogeneous hypergraphs with certain semantics. Subsequently

the spectral clustering parser was employed to extract the structural features of hyperlinks. The original hypergraph was reconstructed into multiple homoprotonic graphs

and the distribution of potential hyperlinks was inferred within the observation space of the subgraph

rather than the entire adjacency space

in order to restore the complete hypernetwork structure. This method federated learned the structural characteristics and aggregation attributes of hypernetworks to model the high-order nonlinear behavior of each subgraph

thereby solving the problems of single category and low precision in heterogeneous hypergraphs link prediction. Extensive comparative experiments were conducted on nine real datasets

demonstrating that this method significantly outperformed existing methods in terms of AUC score and recall rate.

关键词

Keywords

references

马扬 . 基于谱聚类的复杂网络时序链路预测技术研究 [D ] . 长沙 : 国防科学技术大学 , 2016 .

MA Y . Research on complex networks time-series link prediction based on spectral clustering [D ] . Changsha : National University of

Defense Science and Technology , 2016 .

LI C , JI X , LIU S , et al . A new method for predicting future links in temporal networks based on node influence [J ] . International Journal of Modern Physics C , 2021 , 32 ( 12 ): 2150160 .

LIAO L , HE X , ZHANG H , et al . Attributed social network embedding [J ] . IEEE Transactions on Knowledge and Data Engineering , 2018 , 30 ( 12 ): 2257 - 2270 .

WANG P , XU B W , WU Y R , et al . Link prediction in social networks: the state-of-the-art [J ] . Science China Information Sciences , 2015 , 58 ( 1 ): 1 - 38 .

HAGHANI S , KEYVANPOUR M R . A systemic analysis of link prediction in social network [J ] . Artificial Intelligence Review , 2019 , 52 ( 3 ): 1961 - 1995 .

SHI C , HU B , ZHAO W X , et al . Heterogeneous information network embedding for recommendation [J ] . IEEE Transactions on Knowledge and Data Engineering , 2018 , 31 ( 2 ): 357 - 370 .

ZHU X , YANG X , YING C , et al . A new classification algorithm recommendation method based on link prediction [J ] . Knowledge-Based Systems , 2018 , 159 : 171 - 185 .

KAYA B . A hotel recommendation system based on customer location: a link prediction approach [J ] . Multimedia Tools and Applications , 2020 , 79 ( 3 ): 1745 - 1758 .

DETTMERS T , MINERVINI P , STENETORP P , et al . Convolutional 2d knowledge graph embeddings [C ] // Proceedings of the AAAI Conference on Artificial Intelligence . 2018 : 32 .

SULAIMANY S , KHANSARI M , NEJAD A M . Link prediction potentials for biological networks [J ] . International Journal of Data Mining and Bioinformatics , 2018 , 20 ( 2 ): 161 - 184 .

BREIT A , OTT S , AGIBETOV A , et al . OpenBioLink: a benchmarking framework for large-scale biomedical link prediction [J ] . Bioinformatics , 2020 , 36 ( 13 ): 4097 - 4098 .

YADATI N , NITIN V , NIMISHAKAVI M , et al . Link prediction in hypergraphs using graph convolutional networks [R ] . 2018 .

刘怡君 , 唐先一 , 李倩倩 , 等 . 超链路预测 [J ] . 管理评论 , 2012 , 24 ( 12 ): 9 .

LIU Y J , TANG X Y , LI Q Q , et al . Superlink prediction [J ] Management Review , 2012 , 24 ( 12 ): 9

ZHANG M , CUI Z , JIANG S , et al . Beyond link prediction: predicting hyperlinks in adjacency space [C ] // Proceedings of the AAAI Conference on Artificial Intelligence . 2018 : 32 .

LI D , XU Z , LI S , et al . Link prediction in social networks based on hypergraph [C ] // Proceedings of the 22nd International Conference on World Wide Web . 2013 : 41 - 42 .

ARYA D , WORRING M . Exploiting relational information in social networks using geometric deep learning on hypergraphs [C ] // Proceedings of the 2018 ACM on International Conference on Multimedia Retrieval . 2018 : 117 - 125 .

LUGO-MARTINEZ J , ZEIBERG D , GAUDELET T , et al . Classification in biological networks with hypergraphlet kernels [J ] . Bioinformatics , 2021 , 37 ( 7 ): 1000 - 1007 .

FAN H , ZHANG F , WEI Y , et al . Heterogeneous hypergraph variational autoencoder for link prediction [J ] . IEEE Transactions on Pattern Analysis and Machine Intelligence , 2021 .

PATIL P , SHARMA G , MURTY M N . Negative sampling for hyperlink prediction in networks [C ] // Pacific-Asia Conference on Knowledge Discovery and Data Mining . 2020 : 607 - 619 .

ZHANG M , CUI Z , OYETUNDE T , et al . Recovering metabolic networks using a novel hyperlink prediction method [J ] . arXiv Preprint arXiv: 1610.06941 , 2016 .

FATEMI B , TASLAKIAN P , VAZQUEZ D , et al . Knowledge hypergraphs: prediction beyond binary relations [EB ] . arXiv Preprint arXiv: 1906.00137 , 2019 .

GHAHRAMANI Z , HELLER K A . Bayesian sets [C ] // Proceedings of Advances in Neural Information Processing Systems . 2005 : 18 .

KATZ L . A new status index derived from sociometric analysis [J ] . Psychometrika , 1953 , 18 ( 1 ): 39 - 43 .

LIBEN-NOWELL D , KLEINBERG J . The link-prediction problem for social networks [J ] . Journal of the American society for information science and technology , 2007 , 58 ( 7 ): 1019 - 1031 .

XU Y , ROCKMORE D , KLEINBAUM A M . Hyperlink prediction in hypernetworks using latent social features [C ] // Proceedings of International Conference on Discovery Science . Springer, Berlin, Heidelberg , 2013 : 324 - 339 .

SHARMA G , PATIL P , MURTY M N . C3MM: clique-closure based hyperlink prediction [C ] // Proceedings of the Twenty-Ninth International Conference on International Joint Conferences on Artificial Intelligence . 2021 : 3364 - 3370 .

TU K , CUI P , WANG X , et al . Structural deep embedding for hyper-networks [C ] // Proceedings of the AAAI Conference on Artificial Intelligence . 2018 , 32(1) .

HUANG J , LIU X , SONG Y . Hyper-path-based representation learning for hyper-networks [C ] // Proceedings of the 28th ACM International Conference on Information and Knowledge Management . 2019 : 449 - 458 .

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

面向强稀疏性移动社交网络的链路预测深度学习方法

基于非回溯矩阵中心性的超图可靠性研究

基于节点匹配度的动态网络链路预测方法

基于广义共同邻居的有向网络链路预测方法

基于复杂网络动力学模型的链路预测方法