Please wait a minute...
文章检索
复杂系统与复杂性科学  2026, Vol. 23 Issue (3): 64-72    DOI: 10.13306/j.1672-3813.2026.03.008
  复杂网络 本期目录 | 过刊浏览 | 高级检索 |
基于图卷积的城市公共交通网络链路预测算法
叶延军, 杨圣文, 钱琛浩
西南林业大学 a.机械与交通学院;b.云南省高校高原山区机动车环保与安全重点实验室, 昆明 650224
A Link Prediction Algorithm for Urban Public Transportation Network Based on Graph Convolution
YE Yanjun, YANG Shengwen, QIAN Chenhao
a. School of Machinery and Transportation; b. Key Laboratory of Environmental Protection and Safety of Motor Vehicles in Highland Mountainous Areas of Yunnan University, Southwest Forestry University, Kunming 650224, China
全文: PDF(3392 KB)  
输出: BibTeX | EndNote (RIS)      
摘要 为提高城市公共交通系统的管理效率,提出一种复杂网路链路预测算法GCNs-LP。算法整合多源数据,设计了元路径随机游走和skip-gram模型训练,通过神经网络特征学习获得节点的低维向量表示,基于节点向量对的相似度进行链路预测。实验结果表明:该算法在深圳市、上海市和南京市的地铁网络数据集上均取得了优于基线方法(CN、PA、Node2Vec、LPNMF等)的预测性能,AUC值分别提升至少29%,14.6%,7.1%。GCNs-LP算法能有效捕捉交通网络中的复杂结构特性。
服务
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章
叶延军
杨圣文
钱琛浩
关键词 复杂网络链路预测图卷积神经网络图嵌入    
Abstract:In order to improve the management efficiency of urban public transportation system, a complex network link prediction algorithm GCNs-LP is proposed. The algorithm integrates multi-source data, designs the meta-path random walk and skip-gram model training, obtains the low-dimensional vector representation of nodes through the feature learning of neural network, and makes link prediction based on the similarity of node vector pairs. The experimental results show that the proposed algorithm achieves better prediction performance than the baseline method (CN, PA, Node2Vec, LPNMF, etc.) on the subway network data sets of Shenzhen, Shanghai and Nanjing, and the AUC value increases by at least 29%, 14.6% and 7.1%, respectively. GCNs-LP algorithm can capture the complex structure characteristics of traffic network effectively.
Key wordscomplex network    link prediction    graph convolutional neural network    graph embedding
收稿日期: 2024-09-14      出版日期: 2026-07-14
ZTFLH:  TB391  
  U12  
基金资助:云南省教育厅科学研究基金项目(2023Y0769)
通讯作者: 杨圣文(1976-),男,云南大理人,硕士,正高级工程师,主要研究方向为交通运输规划与管理。   
作者简介: 叶延军(1998-),男,四川成都人,硕士研究生,主要研究方向为交通运输规划与管理。
引用本文:   
叶延军, 杨圣文, 钱琛浩. 基于图卷积的城市公共交通网络链路预测算法[J]. 复杂系统与复杂性科学, 2026, 23(3): 64-72.
YE Yanjun, YANG Shengwen, QIAN Chenhao. A Link Prediction Algorithm for Urban Public Transportation Network Based on Graph Convolution[J]. Complex Systems and Complexity Science, 2026, 23(3): 64-72.
链接本文:  
https://fzkx.qdu.edu.cn/CN/10.13306/j.1672-3813.2026.03.008      或      https://fzkx.qdu.edu.cn/CN/Y2026/V23/I3/64
[1] DAUD N N, AB HAMID S H, SAADOON M, et al. Applications of link prediction in social networks: a review[J]. Journal of Network and Computer Applications, 2020, 166: 102716.
[2] COŞKUN M, KOYUTÜRK M. Node similarity-based graph convolution forlink prediction in biological networks[J]. Bioinformatics, 2021, 37(23): 4501-4508.
[3] GU S, LI K, LIANG Y, et al. A transportation network evolution model based on link prediction[J]. International Journal of Modern Physics B, 2021, 35(31): 2150316.
[4] ISLEK I, OGUDUCU S G. A hierarchical recommendation system for E-commerce using online user reviews[J]. Electronic Commerce Research and Applications, 2022, 52: 101131.
[5] LIAO M, SUNDAR S S. When e-commerce personalization systems show and tell: investigating the relative persuasive appeal of content-based versus collaborative filtering[J]. Journal of Advertising, 2022, 51(2): 256-267.
[6] AHMAD I, AKHTAR M U, NOOR S, et al. Missing link prediction using common neighbor and centrality based parameterized algorithm[J]. Scientific Reports, 2020, 10(1): 364.
[7] ADAMIC L A, Adar E. Friends and neighbors on the web[J]. Social Networks, 2003, 25(3): 211-230.
[8] BAG S, KUMAR S K, TIWARI M K. An efficient recommendation generation using relevant Jaccard similarity[J]. Information Sciences, 2019, 483: 53-64.
[9] PIVA G G, RIBEIRO F L, MATA A S. Networks with growth and preferential attachment: modelling and applications[J]. Journal of Complex Networks, 2021, 9(1): cnab008.
[10] NGUYEN D H, NGUYEN C H, MAMITSUKA H. Learning subtree pattern importance for Weisfeiler-Lehman based graph kernels[J]. Machine Learning, 2021, 110(7): 1585-1607.
[11] FOROUZANDEH S, BERAHMAND K, SHEIKHPOUR R, et al. A new method for recommendation based on embedding spectral clustering in heterogeneous networks (RESCHet)[J]. Expert Systems with Applications, 2023, 231: 120699.
[12] COŞKUN M, BAGGAG A, KOYUTÜRK M. Fast computation of Katz index for efficient processing of link prediction queries[J]. Data Mining and Knowledge Discovery, 2021, 35(4): 1342-1368.
[13] SAXENA A, FLETCHER G, PECHENIZKIY M. NodeSim: node similarity based network embedding for diverse link prediction[J]. EPJ Data Science, 2022, 11(1): 24.
[14] XIAO Y, LI R, LU X, et al. Link prediction based on feature representation and fusion[J]. Information Sciences, 2021, 548: 1-17.
[15] ZHANG M H, CHEN Y X. Link prediction based on graph neural networks[C]//Proceedings of the 32nd International Conference on Neural Information Processing Systems. Montréal, Canada, 2018: 5171-5181.
[16] ZHANG K, TIAN Z, CAI Z, et al. Link-privacy preserving graph embedding data publication with adversarial learning[J]. Tsinghua Science and Technology, 2021, 27(2): 244-256.
[17] COLEY C W, JIN W, ROGERS L, et al. A graph-convolutional neural network model for the prediction of chemical reactivity[J]. Chemical Science, 2019, 10(2): 370-377.
[18] CAI H, ZHENG V W, CHANG K C C. A comprehensive survey of graph embedding: problems, techniques, and applications[J]. IEEE Transactions on Knowledge and Data Engineering, 2018, 30(9): 1616-1637.
[19] DONG Y, CHAWLA N V, SWAMI A. metapath2vec: Scalable representation learning for heterogeneous networks[DB/OL].[2024-05-20]. https://dl.acm.org/doi/abs/10.1145/3097983.3098036.
[20] CHEN J, WANG X, XU X. GC-LSTM: Graph convolution embedded LSTM for dynamic network link prediction[J]. Applied Intelligence, 2022, 52(7): 7513-7528.
[21] CHEN J, ZHANG J, XU X, et al. E-LSTM-D: A deep learning framework for dynamic network link prediction[J]. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2019, 51(6): 3699-3712.
[22] MAHMOODI R, SEYEDI S A, Tab F A, et al. Link prediction by adversarial nonnegative matrix factorization[J]. Knowledge-Based Systems, 2023, 280: 110998.
[23] HANLEY J A, MCNEIL B J. The meaning and use of the area under a receiver operating characteristic (ROC) curve[J]. Radiology, 1982, 143(1): 29-36.
[1] 何宇, 田杰鑫, 覃朝晖, 陈珍珍. 能源价格冲击下集群式供应链网络风险传播仿真[J]. 复杂系统与复杂性科学, 2026, 23(3): 11-18.
[2] 何玉钧, 李璇, 曹竟妍. 基于MFF-GCN的电力通信网络关键节点识别研究[J]. 复杂系统与复杂性科学, 2026, 23(3): 45-52.
[3] 吴爱萍, 吴逸凡, 李华, 陈哲. 中国电子元器件产业链网络关键节点识别与韧性测度[J]. 复杂系统与复杂性科学, 2026, 23(3): 53-63.
[4] 岳芳, 张涵, 樊茂瑞, 戴文慧, 郭剑锋. 开放式交互平台知识协同中的群体观点演化模型与实证[J]. 复杂系统与复杂性科学, 2026, 23(2): 8-18.
[5] 孙艳琴, 吴怀宇, 陈志环. 异维异构多重边复杂网络的广义外同步控制[J]. 复杂系统与复杂性科学, 2026, 23(2): 34-40.
[6] 于海波, 高彦丽, 陈世明, 凤超. 异质耦合下铁路-经济多层网络鲁棒性分析[J]. 复杂系统与复杂性科学, 2026, 23(2): 48-56.
[7] 聂廷远, 王艳伟, 聂晶晶, 刘鹏飞. 基于注意力机制和复杂网络的FPGA可布性预测[J]. 复杂系统与复杂性科学, 2026, 23(1): 53-59.
[8] 户佐安, 杨江浩, 邓锦程. 考虑多元变量的世界航空网络综合鲁棒性研究[J]. 复杂系统与复杂性科学, 2026, 23(1): 60-69.
[9] 孙小慧, 刘毅, 米玉梅, 吕凯. 韧性视角下城市地铁与常规公交网络关键站点及线路识别[J]. 复杂系统与复杂性科学, 2026, 23(1): 26-36.
[10] 牟奇锋, 李晓倩. 基于邻接矩阵的复杂网络演化融合迭代方法[J]. 复杂系统与复杂性科学, 2026, 23(1): 79-86.
[11] 孙文静, 余路粉, 潘文林, 蓝春江. 基于节点影响因子和贡献因子的复杂网络重要节点识别[J]. 复杂系统与复杂性科学, 2026, 23(1): 87-95.
[12] 卢新彪, 刘泽诚, 陈贵允, 杨铁流, 高兴. 基于图卷积网络的复杂网络能控性提升方法[J]. 复杂系统与复杂性科学, 2025, 22(4): 24-28.
[13] 周青, 李依函, 陈文冲. “互联网+”企业创新生态系统网络演化分析[J]. 复杂系统与复杂性科学, 2025, 22(4): 1-7.
[14] 章浩淳, 寇博潇, 张泰杰, 唐智慧. 基于Granger Causality的滑坡机理网络客观权值确定方法[J]. 复杂系统与复杂性科学, 2025, 22(4): 63-70.
[15] 韩世翔, 闫光辉, 裴华艳. 复杂网络上双向免疫对传染病传播的影响[J]. 复杂系统与复杂性科学, 2025, 22(4): 55-62.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed