{"id":"https://openalex.org/W2612663217","doi":"https://doi.org/10.1007/978-3-319-60795-5_10","title":"Link Prediction Using Top-k Shortest Distances","display_name":"Link Prediction Using Top-k Shortest Distances","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2612663217","doi":"https://doi.org/10.1007/978-3-319-60795-5_10","mag":"2612663217"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-60795-5_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-60795-5_10","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036478346","display_name":"Andrei Lebedev","orcid":"https://orcid.org/0000-0003-1994-9163"},"institutions":[{"id":"https://openalex.org/I4210116741","display_name":"Innopolis University","ror":"https://ror.org/02b7jh107","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210116741"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Andrei Lebedev","raw_affiliation_strings":["Innnopolis University, Innopolis, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Innnopolis University, Innopolis, Russia","institution_ids":["https://openalex.org/I4210116741"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100401551","display_name":"Jooyoung Lee","orcid":"https://orcid.org/0000-0003-4444-6496"},"institutions":[{"id":"https://openalex.org/I4210116741","display_name":"Innopolis University","ror":"https://ror.org/02b7jh107","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210116741"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"JooYoung Lee","raw_affiliation_strings":["Innnopolis University, Innopolis, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Innnopolis University, Innopolis, Russia","institution_ids":["https://openalex.org/I4210116741"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102928191","display_name":"V\u00edctor Rivera","orcid":"https://orcid.org/0000-0002-1946-8979"},"institutions":[{"id":"https://openalex.org/I4210116741","display_name":"Innopolis University","ror":"https://ror.org/02b7jh107","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210116741"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Victor Rivera","raw_affiliation_strings":["Innnopolis University, Innopolis, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Innnopolis University, Innopolis, Russia","institution_ids":["https://openalex.org/I4210116741"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075175655","display_name":"Manuel Mazzara","orcid":"https://orcid.org/0000-0002-3860-4948"},"institutions":[{"id":"https://openalex.org/I4210116741","display_name":"Innopolis University","ror":"https://ror.org/02b7jh107","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210116741"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Manuel Mazzara","raw_affiliation_strings":["Innnopolis University, Innopolis, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Innnopolis University, Innopolis, Russia","institution_ids":["https://openalex.org/I4210116741"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":6.1384,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.97020725,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"101","last_page":"105"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.979200005531311,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.975600004196167,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.865371584892273},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.7690651416778564},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6769891381263733},{"id":"https://openalex.org/keywords/jaccard-index","display_name":"Jaccard index","score":0.6024912595748901},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.594890296459198},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5576956868171692},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.500927209854126},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4798673987388611},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.4779653251171112},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.4673595428466797},{"id":"https://openalex.org/keywords/link","display_name":"Link (geometry)","score":0.43274661898612976},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4302913546562195},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41700249910354614},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4131309688091278},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.40306609869003296},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.3913223445415497},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34076109528541565},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2794753909111023},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2483755350112915},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.23054161667823792},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.16238027811050415},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12690052390098572},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.11955934762954712},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.05031198263168335}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.865371584892273},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.7690651416778564},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6769891381263733},{"id":"https://openalex.org/C203519979","wikidata":"https://www.wikidata.org/wiki/Q865360","display_name":"Jaccard index","level":3,"score":0.6024912595748901},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.594890296459198},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5576956868171692},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.500927209854126},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4798673987388611},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.4779653251171112},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4673595428466797},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.43274661898612976},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4302913546562195},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41700249910354614},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4131309688091278},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.40306609869003296},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.3913223445415497},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34076109528541565},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2794753909111023},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2483755350112915},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.23054161667823792},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.16238027811050415},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12690052390098572},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.11955934762954712},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.05031198263168335},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-60795-5_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-60795-5_10","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W297109221","https://openalex.org/W328847996","https://openalex.org/W1976746127","https://openalex.org/W2005945380","https://openalex.org/W2014616935","https://openalex.org/W2014889099","https://openalex.org/W2037933327","https://openalex.org/W2079399703","https://openalex.org/W2114507260","https://openalex.org/W2131058166","https://openalex.org/W2138561370","https://openalex.org/W2168001829","https://openalex.org/W2611196248","https://openalex.org/W3169943864","https://openalex.org/W4232932184"],"related_works":["https://openalex.org/W2357391150","https://openalex.org/W2161960576","https://openalex.org/W2368964068","https://openalex.org/W2523719706","https://openalex.org/W2384965074","https://openalex.org/W2388051136","https://openalex.org/W4352982540","https://openalex.org/W2158422636","https://openalex.org/W2170980056","https://openalex.org/W2136866103"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}