Skip to main content

2024 | OriginalPaper | Buchkapitel

RGCNdist2vec: Using Graph Convolutional Networks and Distance2Vector to Estimate Shortest Path Distance Along Road Networks

verfasst von : Xiangfu Meng, Weipeng Xie, Jiangyan Cui

Erschienen in: Spatial Data and Intelligence

Verlag: Springer Nature Singapore

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Computing shortest distance estimation for road networks is an important component of map service systems. Existing embedded-based shortest path distance estimation methods either have a long training time or the model training time is reduced by sacrificing the estimation accuracy. To address the above problems, this paper proposes a Road Graph Convolutional Networks and Distance2Vector (RGCNdist2vec), which is suitable for road network scenarios, as an embedding method of road network vertices. Used to capture network structure information. In the aspect of sampling model training samples, a three-stage sampling method based on graph logical partition is designed, which can select a small number of high-quality samples for model training. In order to verify the validity of the model and sampling scheme, experiments were carried out on four real road network datasets and compared with existing relevant models. The results show that the proposed model has high estimation accuracy, and the training time of the model is nearly 4 times lower than that of the existing baseline model.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
2.
4.
Zurück zum Zitat Ouyang, D., et al.: When hierarchy meets 2-hop-labeling: efficient shortest distance queries on road networks. In: Proceedings of the 2018 International Conference on Management of Data, pp. 709–724. Houston, 10–15 June 2018. ACM, New York (2018) Ouyang, D., et al.: When hierarchy meets 2-hop-labeling: efficient shortest distance queries on road networks. In: Proceedings of the 2018 International Conference on Management of Data, pp. 709–724. Houston, 10–15 June 2018. ACM, New York (2018)
5.
Zurück zum Zitat Geisberger, R., Schieferdecker, D.: Heuristic contraction hierarchies with approximation guarantee. In: Proceedings of the Third Annual Symposium on Combinatorial Search, pp. 31–38. Stone Mountain, 8–10 July 2010. AAAI, Menlo Park (2010) Geisberger, R., Schieferdecker, D.: Heuristic contraction hierarchies with approximation guarantee. In: Proceedings of the Third Annual Symposium on Combinatorial Search, pp. 31–38. Stone Mountain, 8–10 July 2010. AAAI, Menlo Park (2010)
6.
Zurück zum Zitat Chechik, S.: Approximate distance oracles with improved bounds. In: Proceedings of the Forty-seventh Annual ACM Symposium on Theory of Computing, pp. 1–10. Portland, 14–17 June 2015. ACM, New York (2015) Chechik, S.: Approximate distance oracles with improved bounds. In: Proceedings of the Forty-seventh Annual ACM Symposium on Theory of Computing, pp. 1–10. Portland, 14–17 June 2015. ACM, New York (2015)
7.
Zurück zum Zitat Tang, L., Crovella, M.: Virtual landmarks for the internet. In: Proceedings of the 3rd ACM SIGCOMM Conference on Internet Measurement, pp. 143–152. Miami Beach, 27–29 October 2003. ACM, New York (2003) Tang, L., Crovella, M.: Virtual landmarks for the internet. In: Proceedings of the 3rd ACM SIGCOMM Conference on Internet Measurement, pp. 143–152. Miami Beach, 27–29 October 2003. ACM, New York (2003)
8.
Zurück zum Zitat Zhao, X.H., et al.: Orion: shortest path estimation for large social graphs. Networks 1, 5 (2010) Zhao, X.H., et al.: Orion: shortest path estimation for large social graphs. Networks 1, 5 (2010)
9.
Zurück zum Zitat Zhao, X., et al.: Efficient shortest paths on massive social graphs. In: Proceedings of the 7th International Conference on Collaborative Computing, pp. 77–86. Orlando, 15–18 October 2011. IEEE, Piscataway (2011) Zhao, X., et al.: Efficient shortest paths on massive social graphs. In: Proceedings of the 7th International Conference on Collaborative Computing, pp. 77–86. Orlando, 15–18 October 2011. IEEE, Piscataway (2011)
10.
Zurück zum Zitat Gubichev, A., et al.: Fast and accurate estimation of shortest paths in large graphs. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management, pp. 499–508. Toronto, 26–30 October 2010. ACM, New York (2010) Gubichev, A., et al.: Fast and accurate estimation of shortest paths in large graphs. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management, pp. 499–508. Toronto, 26–30 October 2010. ACM, New York (2010)
11.
Zurück zum Zitat Rizi, F.S., Schloetterer, J., Granitzer, M.: Shortest path distance approximation using deep learning techniques. In: Proceedings of the 2018 International Conference on Advances in Social Networks, pp. 1007–1014. Barcelona, 28–31 August 2018. IEEE, Piscataway (2018) Rizi, F.S., Schloetterer, J., Granitzer, M.: Shortest path distance approximation using deep learning techniques. In: Proceedings of the 2018 International Conference on Advances in Social Networks, pp. 1007–1014. Barcelona, 28–31 August 2018. IEEE, Piscataway (2018)
12.
Zurück zum Zitat Qi, J., et al.: A learning based approach to predict shortest-path distances. In: Proceedings of the 23rd International Conference on Extending Database Technology, 367–370. Copenhagen, 30 March – 02 April 2020. OpenProceedings, Greece (2020) Qi, J., et al.: A learning based approach to predict shortest-path distances. In: Proceedings of the 23rd International Conference on Extending Database Technology, 367–370. Copenhagen, 30 March – 02 April 2020. OpenProceedings, Greece (2020)
13.
Zurück zum Zitat Huang, S., et al.: A learning-based method for computing shortest path distances on road networks. In: 2021 IEEE 37th International Conference on Data Engineering, pp. 360–371. IEEE, Chania, 19–22 April 2021. IEEE, Piscataway (2021) Huang, S., et al.: A learning-based method for computing shortest path distances on road networks. In: 2021 IEEE 37th International Conference on Data Engineering, pp. 360–371. IEEE, Chania, 19–22 April 2021. IEEE, Piscataway (2021)
14.
Zurück zum Zitat Chen, X., Wang, S., Li, H., et al.: Ndist2vec: node with landmark and new distance to vector method for predicting shortest path distance along road networks. ISPRS Int. J. Geo Inf. 11(10), 514 (2022)CrossRef Chen, X., Wang, S., Li, H., et al.: Ndist2vec: node with landmark and new distance to vector method for predicting shortest path distance along road networks. ISPRS Int. J. Geo Inf. 11(10), 514 (2022)CrossRef
15.
Zurück zum Zitat Darmochwal, A.: The Euclidean space. Formalized Math. 2(4), 599–603 (1991) Darmochwal, A.: The Euclidean space. Formalized Math. 2(4), 599–603 (1991)
16.
Zurück zum Zitat Kleinberg, R.: Geographic routing using hyperbolic space. In: Proceedings of the 26th IEEE International Conference on Computer Communications, pp. 1902–1909. Anchorage, 6–12 May 2007. IEEE, Piscataway (2007) Kleinberg, R.: Geographic routing using hyperbolic space. In: Proceedings of the 26th IEEE International Conference on Computer Communications, pp. 1902–1909. Anchorage, 6–12 May 2007. IEEE, Piscataway (2007)
18.
Zurück zum Zitat Grover, A., Leskovec, J.: node2vec: Scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 855–864. San Francisco, 13–17 August 2016. ACM, New York (2016) Grover, A., Leskovec, J.: node2vec: Scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 855–864. San Francisco, 13–17 August 2016. ACM, New York (2016)
19.
Zurück zum Zitat Nickel, M., Kiela, D.: Poincaré embeddings for learning hierarchical representations. In: Advances in Neural Information Processing Systems, arXiv:1705.08039 (2017) Nickel, M., Kiela, D.: Poincaré embeddings for learning hierarchical representations. In: Advances in Neural Information Processing Systems, arXiv:​1705.​08039 (2017)
21.
Zurück zum Zitat Gilmer, J., et al.: Neural message passing for quantum chemistry. In: Proceedings of the 34th International Conference on Machine Learning, pp. 1263-1272. Sydney, 6–11 August 2017. PMLR, New York (2017) Gilmer, J., et al.: Neural message passing for quantum chemistry. In: Proceedings of the 34th International Conference on Machine Learning, pp. 1263-1272. Sydney, 6–11 August 2017. PMLR, New York (2017)
22.
Zurück zum Zitat Zhou, J., et al.: Graph neural networks: a review of methods and applications. AI Open 1, 57–81 (2020)CrossRef Zhou, J., et al.: Graph neural networks: a review of methods and applications. AI Open 1, 57–81 (2020)CrossRef
23.
Zurück zum Zitat Wu, Z., et al.: A comprehensive survey on graph neural networks. IEEE Trans. Neural Netw. Learn. Syst. 32(1), 4–24 (2021)MathSciNetCrossRef Wu, Z., et al.: A comprehensive survey on graph neural networks. IEEE Trans. Neural Netw. Learn. Syst. 32(1), 4–24 (2021)MathSciNetCrossRef
24.
Zurück zum Zitat Hamilton, W.L., Ying, R., Leskovec, J.: Inductive representation learning on large graphs. In: Advances in Neural Information Processing Systems, arXiv:1760.2216 (2017) Hamilton, W.L., Ying, R., Leskovec, J.: Inductive representation learning on large graphs. In: Advances in Neural Information Processing Systems, arXiv:​1760.​2216 (2017)
Metadaten
Titel
RGCNdist2vec: Using Graph Convolutional Networks and Distance2Vector to Estimate Shortest Path Distance Along Road Networks
verfasst von
Xiangfu Meng
Weipeng Xie
Jiangyan Cui
Copyright-Jahr
2024
Verlag
Springer Nature Singapore
DOI
https://doi.org/10.1007/978-981-97-2966-1_13

Premium Partner