Skip to main content

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 482))

  • 1095 Accesses

Abstract

Link prediction is a challenging problem. It is an approach to determine the possibility of potential or missing link between node pairs in a network. Researches on transportation network’s link prediction are mainly about travel time prediction, path prediction, traffic flow prediction, congestion prediction and so on. However, current studies are restrained by direction of the link or a new route. To solve this problem, a node pair entropy based similarity method for link prediction is proposed. Firstly, the initial state of all nodes in the node pair are initialized. Then, the influence weights of upstream node to lower nodes and the feedback state are determined. So the uncertainty degree of a path is obtained. Finally, the link prediction of the unconnected node pair is measured by node pair entropy. This method differentiates the roles of different nodes, and the connection between the common points is considered. It becomes a good solution for transportation network’s link prediction.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ravasz E, Somera AL, Mongru DA et al (2002) Hierarchical organization of modularity in metabolic networks. Science 297(5586):1551

    Article  Google Scholar 

  2. Mitzenmacher M (2003) A brief history of generative models for power law and lognormal distributions. Internet Math 1(2):226–251

    Article  MathSciNet  MATH  Google Scholar 

  3. Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Assoc Info Sci Technol 58(7):1019–1031

    Article  Google Scholar 

  4. Adamic LA, Adar E (2003) Friends and neighbors on the Web. Soc Netw 25(3):211–230

    Article  Google Scholar 

  5. Martínez V, Berzal F, Cubero JC (2016) Adaptive degree penalization for link prediction. J Comput Sci 13:1–9

    Article  MathSciNet  Google Scholar 

  6. Lü L, Jin CH, Zhou T (2009) Similarity index based on local paths for link prediction of complex networks. Phys Rev E Stat Nonlin Soft Matter Phys 80(4 Pt 2):046122

    Article  Google Scholar 

  7. Li RH, Yu JX, Liu J (2011) Link prediction: the power of maximal entropy random walk. In: ACM International conference on information and knowledge management, ACM, pp 1147–1156

    Google Scholar 

  8. Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18(1):39–43

    Article  MATH  Google Scholar 

  9. Leicht EA, Holme P, Newman ME (2006) Vertex similarity in networks. Phys Rev E Stat Nonlin Soft Matter Phys 73(2 Pt 2):026120

    Article  Google Scholar 

  10. Simmons R, Browning B, Zhang Y et al (2006) Learning to predict driver route and destination intent. In: IEEE intelligent transportation systems conference, IEEE, pp 127–132

    Google Scholar 

  11. Mowshowitz A (1967) Entropy and the complexity of graphs. University of Michigan, pp 225–240

    Google Scholar 

  12. Xu Z, Pu C, Yang J (2016) Link prediction based on node pair entropy. Physica A Stat Mech Appl 456(5):294–301

    Article  Google Scholar 

  13. Xu Z, Pu C, Sharafat RR et al (2016) Entropy-based link prediction in weighted networks. Chinese Physic b English 1:588–594

    Google Scholar 

Download references

Acknowledgements

This paper is supported by The Chinese the State 13 Five-year Scientific and Technological Support Project (2016YFB1200402), The Big-Data Based Beijing Road Traffic Congestion Reduction Decision Support Project (PXM2016014212000036) and The Project of The Innovation and Collaboration Capital Center for World Urban Transport Improvement (PXM2016014212000030).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zundong Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, Z., Ma, W., Zhang, Z., Zhou, H. (2018). A Node Pair Entropy Based Similarity Method for Link Prediction in Transportation Networks. In: Jia, L., Qin, Y., Suo, J., Feng, J., Diao, L., An, M. (eds) Proceedings of the 3rd International Conference on Electrical and Information Technologies for Rail Transportation (EITRT) 2017. EITRT 2017. Lecture Notes in Electrical Engineering, vol 482. Springer, Singapore. https://doi.org/10.1007/978-981-10-7986-3_82

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-7986-3_82

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-7985-6

  • Online ISBN: 978-981-10-7986-3

  • eBook Packages: EnergyEnergy (R0)

Publish with us

Policies and ethics