Link Prediction Using Top-k Shortest Distances-Reference-Cited by-同舟云学术

Link Prediction Using Top-k Shortest Distances

Published:2017 Issue: Volume: Page:101-105
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Lebedev Andrei,Lee JooYoung,Rivera Victor,Mazzara Manuel

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-60795-5_10

Reference15 articles.

1. Akiba, T., Hayashi, T., Nori, N., Iwata, Y., Yoshida, Y.: Efficient top-k shortest-path distance queries on large networks by pruned landmark labeling. In: AAAI 2015, pp. 2–8 (2015)

2. Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: SIGMOD 2013, pp. 349–360 (2013)

3. Angles, R., Gutierrez, C.: Survey of graph database models. ACM Comput. Surv. 40(1), 1:1–1:39 (2008)

4. Eppstein, D.: Finding the $$k$$ shortest paths. SIAM J. Comput. 28(2), 652–673 (1999). doi: 10.1137/S0097539795290477

5. Goldberg, A.V., Harrelson, C.: Computing the shortest path: a search meets graph theory. In: SODA 2005, pp. 156–165 (2005)

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Top-k Distance Queries on Large Time-Evolving Graphs;IEEE Access;2023

2. Mining semantic information of co-word network to improve link prediction performance;Scientometrics;2022-01-04

3. Path-based estimation for link prediction;International Journal of Machine Learning and Cybernetics;2021-04-01

4. Evaluations of Similarity Measures on VK for Link Prediction;Data Science and Engineering;2018-09

5. Hikester - The Event Management Application;2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA);2018-05