Please wait a minute...
文章检索
复杂系统与复杂性科学  2026, Vol. 23 Issue (3): 1-10    DOI: 10.13306/j.1672-3813.2026.03.001
  复杂网络 本期目录 | 过刊浏览 | 高级检索 |
基于高阶距离分布的超网络节点相似性计算方法
杨煜升, 郭磊, 樊静妍, 胡枫
青海师范大学 a.计算机学院; b.藏语智能信息处理及应用国家重点实验室, 西宁 810008
A Method for Calculating Node Similarity in Hypernetworks Based on Higher-order Distance Distribution
YANG Yusheng, GUO Lei, FAN Jingyan, HU Feng
a. College of Computer; b. The State Key Laboratory of Tibetan Intelligent Information Processing and Application, Qinghai Normal University, Xining 810008, China
全文: PDF(4080 KB)  
输出: BibTeX | EndNote (RIS)      
摘要 针对传统超网络节点相似性计算方法难以全面捕捉超网络中高阶拓扑结构的问题,提出一种基于高阶距离分布的超网络节点相似性计算方法(HDDNS),通过生成节点的高阶距离分布,并运用Jensen-Shannon散度量化节点间的相似性。为验证其有效性,在3类合成超网络及5个真实世界超网络上进行系统性实验,并与5种现有方法进行对比分析。实验结果表明,HDDNS在互相似指标和传播影响力两个关键评估维度上均表现出良好性能,能更准确有效地计算节点间相似性。
服务
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章
杨煜升
郭磊
樊静妍
胡枫
关键词 超网络节点相似性高阶距离分布Jensen-Shannon散度传播影响力    
Abstract:To address the limitations of traditional hypernetwork node similarity methods in capturing higher-order topological structures, a method for calculating node similarity in hypernetworks based on Higher-order Distance Distribution (HDDNS) is proposed. The method generates higher-order distance distributions for nodes and employs Jensen-Shannon divergence to quantify inter-node similarity. To evaluate its effectiveness, this study conducted systematic experiments on three synthetic hypernetworks and five real-world hypernetworks, comparative analysis with five existing methods demonstrates that HDDNS exhibits superior performance in two key evaluation dimensions: mutual similarity metrics and propagation influence, the results indicate that HDDNS enables more precise and efficient computation of inter-node similarity.
Key wordshypernetwork    node similarity    higher-order distance distribution    Jensen-Shannon Divergence    propagation influence
收稿日期: 2024-10-22      出版日期: 2026-07-14
ZTFLH:  TP301.5  
  O157.5  
基金资助:国家自然科学基金(61663041);青海省自然科学基金(2023-ZJ-916M)
通讯作者: 胡 枫(1970-),女,青海民和人,博士,教授,主要研究方向为复杂网络、超网络理论及应用。   
作者简介: 杨煜升(1998-),男,浙江绍兴人,硕士研究生,主要研究方向为超网络理论及应用。
引用本文:   
杨煜升, 郭磊, 樊静妍, 胡枫. 基于高阶距离分布的超网络节点相似性计算方法[J]. 复杂系统与复杂性科学, 2026, 23(3): 1-10.
YANG Yusheng, GUO Lei, FAN Jingyan, HU Feng. A Method for Calculating Node Similarity in Hypernetworks Based on Higher-order Distance Distribution[J]. Complex Systems and Complexity Science, 2026, 23(3): 1-10.
链接本文:  
https://fzkx.qdu.edu.cn/CN/10.13306/j.1672-3813.2026.03.001      或      https://fzkx.qdu.edu.cn/CN/Y2026/V23/I3/1
[1] ANASTASIEI B, DOSPINESCU N, DOSPINESCU O. Word-of-mouth engagement in online social networks: influence of networkcentrality and density[J]. Electronics, 2023, 12(13): 2857.
[2] MA A, WANG X, LI J, et al. Single-cell biological network inference using a heterogeneous graph transformer[J]. Nature Communications, 2023, 14(1): 964.
[3] DUAN J, LI D, HUANG H J. Reliability of the traffic network against cascading failures with individuals acting independently or collectively[J]. Transportation Research Part C: Emerging Technologies, 2023, 147: 104017.
[4] HASAN M K, HABIB A K M A, ISLAM S, et al. Smart grid communication networks for electric vehicles empowering distributed energy generation: Constraints, challenges, and recommendations[J]. Energies, 2023, 16(3): 1140.
[5] 周涛, 柏文洁, 汪秉宏, 等. 复杂网络研究概述[J]. 物理, 2005(1): 31-36.
ZHOU T, BAI W J, WANG B H, et al. A brief review of complex networks[J]. Physics, 2005(1): 31-36.
[6] ARENAS A, DÍAZ-GUILERA A, KURTHS J, et al. Synchronization in complex networks[J]. Physics reports, 2008, 469(3): 93-153.
[7] 顾亦然, 朱梓嫣. 基于LeaderRank和节点相似度的复杂网络重要节点排序算法[J]. 电子科技大学学报, 2017, 46(2): 441-448.
GU Y R, ZHU Z Y. Node ranking in complex networks based on LeaderRank and modes similarity[J]. Journal of University of Electronic Science and Technology of China, 2017, 46(2): 441-448.
[8] ROGHANI H, BOUYER A. A fast local balanced label diffusion algorithm for community detection in social networks[J]. IEEE Transactions on Knowledge and Data Engineering, 2022, 35(6): 5472-5484.
[9] SAXENA A, FLETCHER G, PECHENIZKIY M. NodeSim: node similarity based network embedding for diverse link prediction[J]. EPJ Data Science, 2022, 11(1): 24.
[10] JACCARD P. Étude comparative de la distribution florale dans une portion des Alpes et des Jura[J]. Bull Soc Vaudoise Sci Nat, 1901, 37: 547-579.
[11] SALTON G. Automatic text analysis: automatic document indexing and classification methods are examined and their effectiveness is assessed[J]. Science, 1970, 168(3929): 335-343.
[12] KATZ L. A new status index derived from sociometric analysis[J]. Psychometrika, 1953, 18(1): 39-43.
[13] LÜ L, JIN C H, ZHOU T. Similarity index based on local paths for link prediction of complex networks[J]. Physical Review E—Statistical, Nonlinear, and Soft Matter Physics, 2009, 80(4): 046122.
[14] LIU W, LÜ L. Link prediction based on local random walk[J]. Europhysics Letters, 2010, 89(5): 58007.
[15] 穆俊芳, 梁吉业, 郑文萍, 等. 面向复杂网络的节点相似性度量[J]. 计算机科学与探索, 2020, 14(5): 749-759.
MU J F, LIANG J Y, ZHEN W P, et al. Node similarity measure for complex networks[J]. Journal of Frontiers of Computer Science and Technology, 2020, 14(5): 749-759.
[16] BERGE C. Graphs and Hypergraphs[M]. Amsterdam: North-Holland Publishing Company, 1973.
[17] ESTRADA E, RODRíGUEZ-VELáZQUEZ J A. Subgraph centrality and clustering in complex hyper-networks[J]. Physica A: Statistical Mechanics and Its Applications, 2006, 364: 581-94.
[18] 潘旭伟, 曾雪梅, 李涛. 基于超网络的社会化标签相似性研究[J]. 运筹与管理, 2023, 32(9): 215-221.
PAN X W, ZENG X M, LI T. Hypernetwork-based tags similarity measure for social tagging systems[J]. Operations Research and Management Science, 2023, 32(9): 215-221.
[19] SURANA A, CHEN C, RAJAPAKSE I. Hypergraph similarity measures[J]. IEEE Transactions on Network Science and Engineering, 2022, 10(2): 658-674.
[20] AKSOY S G, JOSLYN C, MARRERO C O, et al. Hypernetwork science via high-order hypergraph walks[J]. EPJ Data Science, 2020, 9(1): 16.
[21] ZHANG Q, LI M, DENG Y. Measure the structure similarity of nodes in complex networks based on relative entropy[J]. Physica A: Statistical Mechanics and Its Applications, 2018, 491: 749-763.
[22] 王小刚, 闫光辉, 周宁. 多阶邻接分布熵下的复杂网络节点相似性分析方法[J]. 控制理论与应用, 2021, 38(6): 739-747.
WANG X G, YAN G H, ZHOU N. Analysis method of nodes similarity with multi-layer adjacency entropy[J]. Control Theory & Applications, 2021, 38(6): 739-747.
[23] HU F, GUO J L, LI F X, et al. Hypernetwork models based on random hypergraphs[J]. International Journal of Modern Physics C, 2019, 30(8): 1950052.
[24] BARABÁSI A L, ALBERT R. Emergence of scaling in random networks[J]. Science, 1999, 286(5439): 509-512.
[25] WATTS D J, STROGATZ S H. Collective dynamics of ‘small-world' networks[J]. Nature, 1998, 393(6684): 440-442.
[26] BENSON A R, ABEBE R, SCHAUB M T, et al. Simplicial closure and higher-order link prediction[J]. Proceedings of the National Academy of Sciences, 2018, 115(48): E11221-E11230.
[27] GOH K I, CUSICK M E, VALLE D, et al. The human disease network[J]. Proceedings of the National Academy of Sciences, 2007, 104(21): 8685-8690.
[28] OZELLA L, PAOLOTTI D, LICHAND G, et al. Using wearable proximity sensors to characterize social contact patterns in a village of rural Malawi[J]. EPJ Data Science, 2021, 10(1): 46.
[29] 吴英晗, 田阔, 李明达, 等. 利用节点传播熵识别超网络重要节点[J]. 计算机工程与应用, 2023, 59(19): 66-74.
WU Y H, TIAN K, LI M D, et al. Important node recognition in hypernetwork based on node propagation entropy[J]. Computer Engineering and Applications, 2023, 59(19): 66-74.
[1] 朱福祺, 贾晓妍, 卫良, 李发旭. 基于多指标决策矩阵的超网络节点重要性辨识方法[J]. 复杂系统与复杂性科学, 2026, 23(3): 27-36.
[2] 涂贵宇, 潘文林, 张天军. 基于信息熵的超网络重要节点识别方法[J]. 复杂系统与复杂性科学, 2025, 22(1): 18-25.
[3] 徐凤, 尹嘉男, 杨文东, 贾萌. 航班延误扰动下空铁联运超网络可靠性分析[J]. 复杂系统与复杂性科学, 2025, 22(1): 50-58.
[4] 周斌, 马福祥, 高淑洁, 马秀娟, 李明杰. 超边内部结构对无标度超网络鲁棒性的影响[J]. 复杂系统与复杂性科学, 2024, 21(3): 1-8.
[5] 吴英晗, 李明达, 胡枫. 基于熵的多属性决策超网络重要节点识别方法[J]. 复杂系统与复杂性科学, 2023, 20(4): 40-46.
[6] 周丽娜, 李发旭, 巩云超, 胡枫. 基于K-shell的超网络关键节点识别方法[J]. 复杂系统与复杂性科学, 2021, 18(3): 15-22.
[7] 王志平, 王佳. 基于超网络的舆论演化动态模型[J]. 复杂系统与复杂性科学, 2021, 18(2): 29-38.
[8] 彭华涛, 邱子恒. 超网络视角的精准创业扶贫资源拼凑机理研究[J]. 复杂系统与复杂性科学, 2020, 17(4): 48-57.
[9] 胡枫, 刘猛, 赵静, 雷蕾. 蛋白复合物超网络特性分析及应用[J]. 复杂系统与复杂性科学, 2018, 15(4): 31-38.
[10] 李甍娜, 郭进利, 卞闻, 常宁戈, 肖潇, 陆睿敏. 网络视角下的唐诗[J]. 复杂系统与复杂性科学, 2017, 14(4): 66-71.
[11] 杨晓波, 陈楚湘, 王至婉. 基于节点相似性的LFM社团发现算法[J]. 复杂系统与复杂性科学, 2017, 14(3): 85-90.
[12] 崔琼, 李建华, 冉淏丹, 南明莉. 任务流驱动的指挥信息系统动态超网络模型[J]. 复杂系统与复杂性科学, 2017, 14(3): 58-67.
[13] 廖日卿. 基于超网络的海关物流监控风险管理方法优化研究[J]. 复杂系统与复杂性科学, 2017, 14(2): 39-45.
[14] 索琪, 郭进利,. “随机”与“择优”——超网络演化的内在驱动力[J]. 复杂系统与复杂性科学, 2016, 13(4): 51-55.
[15] 杨迎辉, 李建华, 王刚, 南明莉. 基于超网络的作战信息流转建模及特性分析[J]. 复杂系统与复杂性科学, 2016, 13(3): 8-18.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed