| 146 | 0 | 58 |
| 下载次数 | 被引频次 | 阅读次数 |
为了挖掘网络节点数据,实现网络关键节点挖掘,提出多层时序有偏PageRank算法的网络中关键节点数据挖掘方法。运用时间层之间与层内节点之间的连接关系描述时序网络,以此为基础,采用节点层间相似性的超邻接矩阵(SSAM)方法构建多层时序网络模型。在SSAM多层时序网络模型中,基于有偏随机游走过程计算网络节点的转移概率矩阵,确定游走者下一个跳转的邻近节点,采用PageRank方法计算转移概率矩阵所确定跳转节点的KeyRank值,依据KeyRank值完成多层时序网络中跳转节点的重要度排序,实现多层时序网络中关键节点挖掘。实验结果表明,所提方法能够考虑时间层之间的相似性与差异性,提高关键节点挖掘的准确性。
Abstract:This paper proposes the data mining method of key nodes in network based on the multi-layer temporal biased PageRank algorithm to mine network node data, so as to realize network key nodes mining. The temporal network is described by the connection relationship between the time layers and the nodes in the layer, based on which a multi-layer temporal network model is built by similarity-based supra-adjacency matrix(SSAM) method. In the SSAM multi-layer temporal network model, the transition probability matrix of the network node is calculated based on the biased random walk process, and the next jump neighbor node of the walker is determined. The PageRank method is used to calculate the KeyRank value of the jump node determined by the transition probability matrix, and the importance ranking of the jump node in the multi-layer temporal network is completed according to the KeyRank value, so as to realize the key node mining in the multi-layer temporal network. The experiment results show that the proposed method can consider the similarity and difference between time layers and improve the accuracy of key node mining.
[1] 石少青,郑楷洪,周尚礼,等.电量预测中的多分辨时序神经网络模型研究[J].山东科技大学学报:自然科学版,2022,41(2):117-126.
[2] 陈诗,任卓明,刘闯,等.时序网络中关键节点的识别方法研究进展[J].电子科技大学学报,2020,49(2):291-314.
[3] 姚杰,程春玲,韩静,等.云工作流中基于多任务时序卷积网络的异常检测方法[J].计算机应用,2021,41(6):1701-1708.
[4] 朱敬成,刘辉,王伦文,等.基于网络拓扑重合度的关键节点识别方法[J].计算机应用研究,2021,38(12):3581-3585.
[5] 冯小伟,胡聪,许畅,等.基于网络效率最优的关键节点识别方法[J].计算机工程与设计,2019,40(2):328-335.
[6] 王倩,胡松旺,郭嘉伟,等.有向复杂网络结构熵的软件动态执行关键节点挖掘算法[J].小型微型计算机系统,2019,40(4):884-889.
[7] 罗浩,闫光辉,张萌,等.基于证据理论的多关系网络重要节点挖掘方法[J].计算机学报,2020,43(12):2398-2413.
[8] 魏明奎,周全,宋雨妍,等.基于PageRank算法的输电网连锁故障脆弱线路辨识[J].中国电力,2021,54(5):74-82.
[9] 李星,朱宇航,柏溢,等.基于共同邻居邻域拓扑稠密性加权的链路预测方法[J].计算机应用研究,2021,38(5):1503-1507.
[10] 姜金川,王冲.基于学习自动机和用户兴趣的PageRank算法研究[J].计算机工程与应用,2020,56(3):80-85.
[11] 朱大锐,王睿,程文姬,等.基于改进PageRank算法的输电网关键节点辨识方法研究[J].电力系统保护与控制,2022,50(5):86-93.
基本信息:
中图分类号:TP311.13;O157.5
引用信息:
[1]吴凯,张琦佳,常晓润,等.基于多层时序有偏PageRank算法的网络中关键节点数据挖掘[J].微型电脑应用,2025,41(02):174-177.
2025-02-20
2025-02-20