{"id":"https://openalex.org/W2774553394","doi":"https://doi.org/10.1093/comnet/cnx034","title":"An improved hyperbolic embedding algorithm","display_name":"An improved hyperbolic embedding algorithm","publication_year":2017,"publication_date":"2017-08-11","ids":{"openalex":"https://openalex.org/W2774553394","doi":"https://doi.org/10.1093/comnet/cnx034","mag":"2774553394"},"language":"en","primary_location":{"id":"doi:10.1093/comnet/cnx034","is_oa":true,"landing_page_url":"https://doi.org/10.1093/comnet/cnx034","pdf_url":"https://academic.oup.com/comnet/article-pdf/6/3/321/25031954/cnx034.pdf","source":{"id":"https://openalex.org/S2531583244","display_name":"Journal of Complex Networks","issn_l":"2051-1310","issn":["2051-1310","2051-1329"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Complex Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://academic.oup.com/comnet/article-pdf/6/3/321/25031954/cnx034.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067742201","display_name":"Kenny Chowdhary","orcid":null},"institutions":[{"id":"https://openalex.org/I192454743","display_name":"Sandia National Laboratories California","ror":"https://ror.org/058m7ey48","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1330989302","https://openalex.org/I192454743","https://openalex.org/I198811213","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kenny Chowdhary","raw_affiliation_strings":["Sandia National Laboratories, Livermore, CA"],"affiliations":[{"raw_affiliation_string":"Sandia National Laboratories, Livermore, CA","institution_ids":["https://openalex.org/I192454743"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039127251","display_name":"Tamara G. Kolda","orcid":"https://orcid.org/0000-0003-4176-2493"},"institutions":[{"id":"https://openalex.org/I192454743","display_name":"Sandia National Laboratories California","ror":"https://ror.org/058m7ey48","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1330989302","https://openalex.org/I192454743","https://openalex.org/I198811213","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Tamara G Kolda","raw_affiliation_strings":["Sandia National Laboratories, Livermore, CA"],"affiliations":[{"raw_affiliation_string":"Sandia National Laboratories, Livermore, CA","institution_ids":["https://openalex.org/I192454743"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5039127251"],"corresponding_institution_ids":["https://openalex.org/I192454743"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":{"value":4151,"currency":"USD","value_usd":4151},"fwci":0.7462,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.72914255,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"6","issue":"3","first_page":"321","last_page":"341"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9753999710083008,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9753999710083008,"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/T10799","display_name":"Data Visualization and Analytics","score":0.96670001745224,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9616000056266785,"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/embedding","display_name":"Embedding","score":0.7541381120681763},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7113159894943237},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5557768940925598},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5496196150779724},{"id":"https://openalex.org/keywords/python","display_name":"Python (programming language)","score":0.5046032667160034},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4547015130519867},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.44725021719932556},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4452393054962158},{"id":"https://openalex.org/keywords/hyperbolic-space","display_name":"Hyperbolic space","score":0.44406628608703613},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4072827696800232},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.351570188999176},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3377457857131958},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2838422656059265},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10687413811683655}],"concepts":[{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.7541381120681763},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7113159894943237},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5557768940925598},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5496196150779724},{"id":"https://openalex.org/C519991488","wikidata":"https://www.wikidata.org/wiki/Q28865","display_name":"Python (programming language)","level":2,"score":0.5046032667160034},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4547015130519867},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.44725021719932556},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4452393054962158},{"id":"https://openalex.org/C83677898","wikidata":"https://www.wikidata.org/wiki/Q1878538","display_name":"Hyperbolic space","level":2,"score":0.44406628608703613},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4072827696800232},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.351570188999176},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3377457857131958},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2838422656059265},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10687413811683655},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1093/comnet/cnx034","is_oa":true,"landing_page_url":"https://doi.org/10.1093/comnet/cnx034","pdf_url":"https://academic.oup.com/comnet/article-pdf/6/3/321/25031954/cnx034.pdf","source":{"id":"https://openalex.org/S2531583244","display_name":"Journal of Complex Networks","issn_l":"2051-1310","issn":["2051-1310","2051-1329"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Complex Networks","raw_type":"journal-article"},{"id":"pmh:oai:osti.gov:1466759","is_oa":true,"landing_page_url":"https://www.osti.gov/biblio/1466759","pdf_url":"https://www.osti.gov/servlets/purl/1466759","source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.1093/comnet/cnx034","is_oa":true,"landing_page_url":"https://doi.org/10.1093/comnet/cnx034","pdf_url":"https://academic.oup.com/comnet/article-pdf/6/3/321/25031954/cnx034.pdf","source":{"id":"https://openalex.org/S2531583244","display_name":"Journal of Complex Networks","issn_l":"2051-1310","issn":["2051-1310","2051-1329"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Complex Networks","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1741288133","display_name":null,"funder_award_id":"Sandia","funder_id":"https://openalex.org/F4320332369","funder_display_name":"National Nuclear Security Administration"},{"id":"https://openalex.org/G2209453243","display_name":null,"funder_award_id":"DE-NA0003525","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G2214935549","display_name":null,"funder_award_id":"NA0003525","funder_id":"https://openalex.org/F4320338291","funder_display_name":"Sandia National Laboratories"},{"id":"https://openalex.org/G288067973","display_name":null,"funder_award_id":"0003525","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G3437464539","display_name":null,"funder_award_id":"DE-NA000352","funder_id":"https://openalex.org/F4320332369","funder_display_name":"National Nuclear Security Administration"},{"id":"https://openalex.org/G3821936529","display_name":null,"funder_award_id":"Sandia","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G4903105778","display_name":null,"funder_award_id":"NA0003525","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G4947178736","display_name":null,"funder_award_id":"-NA0003525","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G5211897158","display_name":null,"funder_award_id":"DE-NA0003525","funder_id":"https://openalex.org/F4320332369","funder_display_name":"National Nuclear Security Administration"},{"id":"https://openalex.org/G5339743583","display_name":null,"funder_award_id":"NA0003525","funder_id":"https://openalex.org/F4320332369","funder_display_name":"National Nuclear Security Administration"},{"id":"https://openalex.org/G648530007","display_name":null,"funder_award_id":"DE-NA000352","funder_id":"https://openalex.org/F4320338291","funder_display_name":"Sandia National Laboratories"},{"id":"https://openalex.org/G8279418378","display_name":null,"funder_award_id":"DE-NA0003525","funder_id":"https://openalex.org/F4320338291","funder_display_name":"Sandia National Laboratories"}],"funders":[{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320332369","display_name":"National Nuclear Security Administration","ror":"https://ror.org/03sk1we31"},{"id":"https://openalex.org/F4320338291","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2774553394.pdf","grobid_xml":"https://content.openalex.org/works/W2774553394.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W1890754837","https://openalex.org/W1965748532","https://openalex.org/W1971215074","https://openalex.org/W1980940295","https://openalex.org/W1982803213","https://openalex.org/W2051434435","https://openalex.org/W2051669046","https://openalex.org/W2117897639","https://openalex.org/W2139484566","https://openalex.org/W2151633447","https://openalex.org/W2153319198","https://openalex.org/W2153580689","https://openalex.org/W2162737890","https://openalex.org/W2167597870","https://openalex.org/W2171074980","https://openalex.org/W2469279958","https://openalex.org/W2755088640","https://openalex.org/W2952099486","https://openalex.org/W3029645440","https://openalex.org/W3124525317","https://openalex.org/W4251936928","https://openalex.org/W4301014524","https://openalex.org/W6652369258","https://openalex.org/W6677635523","https://openalex.org/W6682612744","https://openalex.org/W6689365536","https://openalex.org/W6695977759","https://openalex.org/W6744271739","https://openalex.org/W6764969287"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600","https://openalex.org/W2761711678"],"abstract_inverted_index":{"Because":[0],"hyperbolic":[1,47,101,112],"space":[2],"has":[3],"properties":[4],"that":[5],"make":[6],"it":[7],"amenable":[8],"to":[9,98],"graph":[10,167],"representations,":[11],"there":[12],"is":[13,76,84,129],"significant":[14,137],"interest":[15],"in":[16,106,116,139],"scalable":[17],"hyperbolic-space":[18],"embedding":[19,48,58,113,165],"methods.":[20],"These":[21],"embeddings":[22],"enable":[23],"constant-time":[24],"approximation":[25],"of":[26,132,142,153,161],"shortest-path":[27,37,144],"distances,":[28],"and":[29,135,156,172],"so":[30],"are":[31,96,148],"significantly":[32,87],"more":[33],"efficient":[34],"than":[35],"full":[36],"computations.":[38],"In":[39],"this":[40],"article,":[41],"we":[42,95,157],"improve":[43],"on":[44,150],"existing":[45],"landmark-based":[46],"algorithms":[49],"for":[50],"large-scale":[51],"graphs.":[52],"Whereas":[53],"previous":[54],"methods":[55],"compute":[56],"the":[57,61,70,100,107,121,140,143,159],"by":[59,164],"using":[60],"derivative-free":[62],"Nelder\u2013Mead":[63],"simplex":[64],"optimization":[65],"method,":[66,74],"our":[67,111,162],"approach":[68],"uses":[69],"limited-memory":[71],"BFGS":[72],"(LBFGS)":[73],"which":[75],"quasi-Newton":[77],"optimization,":[78],"with":[79,168],"analytic":[80],"gradients.":[81],"Our":[82,127],"method":[83,114,128,163],"not":[85],"only":[86],"faster":[88,134],"but":[89],"also":[90],"produces":[91],"higher-quality":[92],"embeddings.":[93],"Moreover,":[94],"able":[97],"include":[99],"curvature":[102],"as":[103],"a":[104,151,166],"variable":[105],"optimization.":[108],"We":[109],"compare":[110],"implementation":[115],"Python":[117],"(called":[118],"Hypy)":[119],"against":[120],"best":[122],"publicly":[123],"available":[124],"software,":[125],"Rigel.":[126],"an":[130],"order":[131],"magnitude":[133],"shows":[136],"improvements":[138],"accuracy":[141],"distance":[145],"calculations.":[146],"Tests":[147],"performed":[149],"variety":[152],"real-world":[154],"networks,":[155],"show":[158],"scalability":[160],"1.8":[169],"billion":[170],"edges":[171],"65":[173],"million":[174],"nodes.":[175]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}