[1] 王立夫, 钟昊男, 郭戈. 基于拥堵系数的道路交通网络关键路段辨识[J]. 控制与决策, 2023, 38(3): 843-849.
WANG L F, ZHONG H N, GUO G. Identification of critical road links in road traffic networks based on congestion coefficient[J]. Control and Decision, 2023, 38(3): 843-849. (in Chinese)
[2] 王灵丽, 黄敏, 高亮. 基于聚类算法的交通网络节点重要性评价方法研究[J]. 交通信息与安全, 2020, 38(2): 80-88.
WANG L L, HUANG M, GAO L. Research on evaluation method of node importance in transportation networks based on clustering algorithm[J]. Journal of Transport Information and Safety, 2020, 38(2): 80-88. (in Chinese)
[3] 赵瑞琳, 牟海波, 肖丁, 等. 基于复杂网络理论的城轨线网抗毁性对比分析[J]. 交通信息与安全, 2021, 39(3): 41-49.
ZHAO R L, MOU H B, XIAO D, et al. Comparative invulnerability analysis of urban rail transit networks based on complex network theory[J]. Journal of Transport Information and Safety, 2021, 39(3): 41-49. (in Chinese)
[4] 王亭, 张永, 周明妮, 等. 融合网络拓扑结构特征与客流量的城市轨道交通关键节点识别研究[J]. 交通运输系统工程与信息, 2022, 22(6): 201-211.
WANG T, ZHANG Y, ZHOU M N, et al. Critical node identification in urban rail transit networks by integrating network topological features and passenger flow[J]. Journal of Transportation Systems Engineering and Information Technology, 2022, 22(6): 201-211. (in Chinese)
[5] XU M, WU J P, LIU M Q, et al. Discovery of critical nodes in road networks through mining from vehicle trajectories[J]. IEEE Transactions on Intelligent Transportation Systems, 2019, 20(2): 583-593.
[6] FREEMAN L C. Centrality in social networks: conceptual clarification[J]. Social Networks, 1978, 1(3): 215-239.
[7] FREEMAN L C. A set of measures of centrality based on betweenness[J]. Sociometry, 1977, 40(1): 35-41.
[8] PAGE L, BRIN S, MOTWANI R, et al. The PageRank citation ranking: bringing order to the Web: 1999-66[R]. Stanford, USA: Stanford InfoLab, 1999.
[9] LI S, QUAN Y, LUO X, et al. Influential nodes identification for complex networks based on multi-feature fusion[J]. Scientific Reports, 2025, 15(1): 11440.
[10] CURADO M, TORTOSA L, VICENT J F. A novel measure to identify influential nodes: return random walk gravity centrality[J]. Information Sciences, 2023, 628: 177-195.
[11] RUAN Y R, LIU S Z, TANG J, et al. GLC: a dual-perspective approach for identifying influential nodes in complex networks[J]. Expert Systems with Applications, 2025, 268: 126292.
[12] MA J L, HU J H. Identifying critical nodes in complex networks via a Multi-Scale Influence Spread method[J]. Chaos, Solitons & Fractals, 2025, 198: 116573.
[13] ULLAH A, MENG Y, MENDES J F F. OVED-Rank: a ranking scheme to evaluate complex network spreaders’ influence through the concept of effective distance and orbital velocity[J]. Information Processing & Management, 2025, 62(5): 104201.
[14] HUANG X L, CHEN J, CAI M, et al. Traffic node importance evaluation based on clustering in represented transportation networks[J]. IEEE Transactions on Intelligent Transportation Systems, 2022, 23(9): 16622-16631.
[15] XU M, ZHANG J. MGL2Rank: learning to rank the importance of nodes in road networks based on multi-graph fusion[J]. Information Sciences, 2024, 667: 120472.
[16] WANG X, WANG Z. Identifying influential nodes in weighted complex networks by considering the importance of shortest paths[J]. Journal of Big Data, 2025, 12(1): 100.
[17] XU H G, CHEN Y, LI C J, et al. Space-Time adaptive network for origin-destination passenger demand prediction[J]. Transportation Research Part C: Emerging Technologies, 2024, 167: 104842.
[18] XU M, XIANG J R, XIE Z L, et al. Learning to rank critical road segments via heterogeneous graphs with origin-destination flow integration[J]. Information Processing & Management, 2026, 63(6): 104702.
[19] LI P, BURGES C J C, WU Q. McRank: learning to rank using multiple classification and gradient boosting[C]//Advances in Neural Information Processing Systems 20. Red Hook, USA: Curran Associates, 2007: 897-904.
[20] PASUMARTHI R K, BRUCH S, WANG X H, et al. TF-Ranking: scalable TensorFlow library for learning-to-rank[C]//Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. New York, USA: ACM Press, 2019: 2970-2978.
[21] BURGES C J C, SHAKED T, RENSHAW E, et al. Learning to rank using gradient descent[C]//Proceedings of the 22nd International Conference on Machine Learning. New York, USA: ACM Press, 2005: 89-96.
[22] BURGES C J C. From RankNet to LambdaRank to LambdaMART: an overview: MSR-TR-2010-82[R]. Redmond, USA: Microsoft Research, 2010.
[23] WANG X H, LI C, GOLBANDI N, et al. The LambdaLoss framework for ranking metric optimization[C]//Proceedings of the 27th ACM International Conference on Information and Knowledge Management. New York, USA: ACM Press, 2018: 1313-1322.
[24] CAO Z, QIN T, LIU T Y, et al. Learning to rank: from pairwise approach to listwise approach[C]//Proceedings of the 24th International Conference on Machine Learning. New York, USA: ACM Press, 2007: 129-136.
[25] PANG L, XU J, AI Q, et al. SetRank: learning a permutation-invariant ranking model for information retrieval[C]//Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. New York, USA: ACM Press, 2020: 499-508.
[26] BUYL M, MISSAULT P, SONDAG P A. RankFormer: listwise learning-to-rank using listwide labels[C]//Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. New York, USA: ACM Press, 2023: 3762-3773.
[27] LOPEZ P A, BEHRISCH M, BIEKER-WALZ L, et al. Microscopic traffic simulation using SUMO[C]//Proceedings of the 21st International Conference on Intelligent Transportation Systems. Washington D. C., USA: IEEE Press, 2018: 2575-2582.
[28] JÄRVELIN K, KEKÄLÄINEN J. Cumulated gain-based evaluation of IR techniques[J]. ACM Transactions on Information Systems, 2002, 20(4): 422-446.
[29] KENDALL M G. A new measure of rank correlation[J]. Biometrika, 1938, 30(1/2): 81-93.
[30] AGRYZKOV T, OLIVER J L, TORTOSA L, et al. An algorithm for ranking the nodes of an urban network based on the concept of PageRank vector[J]. Applied Mathematics and Computation, 2012, 219(4): 2186-2193.
[31] HUANG X, SONG Q Q, LI Y N, et al. Graph recurrent networks with attributed random walks[C]//Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. New York, USA: ACM Press, 2019: 732-740.
[32] PEROZZI B, AL-RFOU R, SKIENA S. DeepWalk: online learning of social representations[C]//Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York, USA: ACM Press, 2014: 701-710.
[33] VELIČKOVIĆ P, CUCURULL G, CASANOVA A, et al. Graph attention networks[C]//Proceedings of the 6th International Conference on Learning Representations. Vancouver, Canada: OpenReview.net, 2018.
[34] HU Z N, DONG Y X, WANG K S, et al. Heterogeneous graph transformer[C]//Proceedings of the Web Conference 2020. New York, USA: ACM Press, 2020: 2704-2710.
[35] BRODY S, ALON U, YAHAV E. How attentive are graph attention networks?[C]//Proceedings of the 10th International Conference on Learning Representations. [S. l.]: OpenReview.net, 2022.
[36] YANG X C, YAN M Y, PAN S R, et al. Simple and efficient heterogeneous graph neural network[C]//Proceedings of the 37th AAAI Conference on Artificial Intelligence. Palo Alto, USA: AAAI Press, 2023: 10816-10824.
[37] FEI B W, BAO W D, ZHU X M, et al. Autonomous cooperative search model for multi-UAV with limited communication network[J]. IEEE Internet of Things Journal, 2022, 9(19): 19346-19361.
[38] LIU X T, QIAN C Y, ZHAO X Y. A dynamic regional-aggregation-based heterogeneous graph neural network for traffic prediction[J]. Mathematics, 2025, 13(9): 1458.
[39] JIANG R, JIA D, LIM E G, et al. A joint topology-data fusion graph network for robust traffic speed prediction with data anomalism[J]. Information Sciences, 2026, 729: 122826.
[40] DACHILLE J, ROSSI A, MAURYA S K, et al. BRAVA-GNN: betweenness ranking approximation via degree mass inspired graph neural network[J]. arXiv preprint arXiv:2602.09716, 2026.
|