{"id":"https://openalex.org/W2043407077","doi":"https://doi.org/10.1109/tnet.2012.2228881","title":"DMFSGD: A Decentralized Matrix Factorization Algorithm for Network Distance Prediction","display_name":"DMFSGD: A Decentralized Matrix Factorization Algorithm for Network Distance Prediction","publication_year":2012,"publication_date":"2012-12-13","ids":{"openalex":"https://openalex.org/W2043407077","doi":"https://doi.org/10.1109/tnet.2012.2228881","mag":"2043407077"},"language":"en","primary_location":{"id":"doi:10.1109/tnet.2012.2228881","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2012.2228881","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1201.1174","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Yongjun Liao","orcid":null},"institutions":[{"id":"https://openalex.org/I157674565","display_name":"University of Li\u00e8ge","ror":"https://ror.org/00afp2z80","country_code":"BE","type":"education","lineage":["https://openalex.org/I157674565"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Yongjun Liao","raw_affiliation_strings":["Research Unit in Networking (RUN), University of Li\u00e8ge, Liege, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Unit in Networking (RUN), University of Li\u00e8ge, Liege, Belgium","institution_ids":["https://openalex.org/I157674565"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Wei Du","orcid":null},"institutions":[{"id":"https://openalex.org/I190249584","display_name":"Universit\u00e4t Innsbruck","ror":"https://ror.org/054pv6659","country_code":"AT","type":"education","lineage":["https://openalex.org/I190249584"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Wei Du","raw_affiliation_strings":["Universitat Innsbruck, Innsbruck, Tirol, AT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universitat Innsbruck, Innsbruck, Tirol, AT","institution_ids":["https://openalex.org/I190249584"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Pierre Geurts","orcid":null},"institutions":[{"id":"https://openalex.org/I157674565","display_name":"University of Li\u00e8ge","ror":"https://ror.org/00afp2z80","country_code":"BE","type":"education","lineage":["https://openalex.org/I157674565"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Pierre Geurts","raw_affiliation_strings":["Systems and Modeling, University of Li\u00e8ge, Liege, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Systems and Modeling, University of Li\u00e8ge, Liege, Belgium","institution_ids":["https://openalex.org/I157674565"]}]},{"author_position":"last","author":{"id":null,"display_name":"Guy Leduc","orcid":null},"institutions":[{"id":"https://openalex.org/I157674565","display_name":"University of Li\u00e8ge","ror":"https://ror.org/00afp2z80","country_code":"BE","type":"education","lineage":["https://openalex.org/I157674565"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Guy Leduc","raw_affiliation_strings":["Research Unit in Networking (RUN), University of Li\u00e8ge, Liege, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Unit in Networking (RUN), University of Li\u00e8ge, Liege, Belgium","institution_ids":["https://openalex.org/I157674565"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.0824,"has_fulltext":true,"cited_by_count":79,"citation_normalized_percentile":{"value":0.91994201,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"21","issue":"5","first_page":"1511","last_page":"1524"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.6100000143051147,"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.6100000143051147,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.07029999792575836,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.05700000002980232,"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/pairwise-comparison","display_name":"Pairwise comparison","score":0.7060999870300293},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.5807999968528748},{"id":"https://openalex.org/keywords/euclidean-distance-matrix","display_name":"Euclidean distance matrix","score":0.5472999811172485},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5360000133514404},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.5284000039100647},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5214999914169312},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.507099986076355},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4984999895095825},{"id":"https://openalex.org/keywords/matrix-completion","display_name":"Matrix completion","score":0.4745999872684479},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.4706999957561493}],"concepts":[{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.7060999870300293},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.5807999968528748},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.554099977016449},{"id":"https://openalex.org/C171558263","wikidata":"https://www.wikidata.org/wiki/Q5406122","display_name":"Euclidean distance matrix","level":3,"score":0.5472999811172485},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5360000133514404},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.5284000039100647},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5250999927520752},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5214999914169312},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.507099986076355},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4984999895095825},{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.4745999872684479},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4706999957561493},{"id":"https://openalex.org/C111208986","wikidata":"https://www.wikidata.org/wiki/Q901698","display_name":"Distance matrix","level":2,"score":0.4593999981880188},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.4523000121116638},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.43309998512268066},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.41990000009536743},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.4187999963760376},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4138000011444092},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.3977000117301941},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36000001430511475},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35659998655319214},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3465999960899353},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.33820000290870667},{"id":"https://openalex.org/C2639959","wikidata":"https://www.wikidata.org/wiki/Q1344778","display_name":"Distance measures","level":2,"score":0.33149999380111694},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.31360000371932983},{"id":"https://openalex.org/C5349765","wikidata":"https://www.wikidata.org/wiki/Q5282866","display_name":"Distance matrices in phylogeny","level":2,"score":0.3034999966621399},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3012000024318695},{"id":"https://openalex.org/C46030957","wikidata":"https://www.wikidata.org/wiki/Q1238125","display_name":"Kronecker product","level":3,"score":0.2946000099182129},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.26649999618530273},{"id":"https://openalex.org/C152671427","wikidata":"https://www.wikidata.org/wiki/Q10843505","display_name":"Non-negative matrix factorization","level":4,"score":0.26080000400543213},{"id":"https://openalex.org/C49777392","wikidata":"https://www.wikidata.org/wiki/Q5535495","display_name":"Geometric networks","level":3,"score":0.2524999976158142},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25130000710487366},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.25060001015663147}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tnet.2012.2228881","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2012.2228881","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1201.1174","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1201.1174","pdf_url":"https://arxiv.org/pdf/1201.1174","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"pmh:oai:orbi.ulg.ac.be:2268/135818","is_oa":true,"landing_page_url":"https://orbi.uliege.be/handle/2268/135818","pdf_url":"https://orbi.uliege.be/bitstream/2268/135818/1/dmf_journal_ton_final_author.pdf","source":{"id":"https://openalex.org/S4306400651","display_name":"Open Repository and Bibliography (University of Li\u00e8ge)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I157674565","host_organization_name":"University of Li\u00e8ge","host_organization_lineage":["https://openalex.org/I157674565"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE/ACM Transactions on Networking, 21 (5), 1511-1524 (2013-10-11)","raw_type":"http://purl.org/coar/resource_type/c_6501"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1201.1174","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1201.1174","pdf_url":"https://arxiv.org/pdf/1201.1174","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1518340120","https://openalex.org/W1606393135","https://openalex.org/W1987196661","https://openalex.org/W1994982577","https://openalex.org/W2000157792","https://openalex.org/W2002913916","https://openalex.org/W2047071281","https://openalex.org/W2090976551","https://openalex.org/W2103325283","https://openalex.org/W2109321157","https://openalex.org/W2110096996","https://openalex.org/W2113802117","https://openalex.org/W2117897639","https://openalex.org/W2126762950","https://openalex.org/W2132051999","https://openalex.org/W2132212948","https://openalex.org/W2135797138","https://openalex.org/W2141934596","https://openalex.org/W2148647281","https://openalex.org/W2153319198","https://openalex.org/W2294521418","https://openalex.org/W2611328865","https://openalex.org/W3162105941","https://openalex.org/W4229864669","https://openalex.org/W4241257019","https://openalex.org/W4242392370","https://openalex.org/W6602174211","https://openalex.org/W6629036869","https://openalex.org/W6629928782","https://openalex.org/W6680012447","https://openalex.org/W6680492289","https://openalex.org/W6686735282"],"related_works":[],"abstract_inverted_index":{"The":[0,89],"knowledge":[1],"of":[2,15,96,171,183,189,199,210],"end-to-end":[3],"network":[4,64,119,175,200],"distances":[5,18],"is":[6,19,27,80,115,128],"essential":[7],"to":[8,28,34,66,136,139,167],"many":[9],"Internet":[10,219],"applications.":[11,220],"As":[12],"active":[13],"probing":[14],"all":[16],"pairwise":[17,58],"infeasible":[20],"in":[21,56,217],"large-scale":[22],"networks,":[23],"a":[24,30,57,63,184],"natural":[25],"idea":[26],"measure":[29],"few":[31],"pairs":[32],"and":[33,131,138,154,164,188,207],"predict":[35],"the":[36,46,53,72,78,93,126,169,172,181,205,208],"other":[37],"ones":[38],"without":[39],"actually":[40],"measuring":[41],"them.":[42],"This":[43],"paper":[44],"formulates":[45],"prediction":[47],"problem":[48,79],"as":[49,152],"matrix":[50,60,74,87,146,162],"completion":[51],"where":[52],"unknown":[54],"entries":[55],"distance":[59,73,176],"constructed":[61],"from":[62],"are":[65],"be":[67],"predicted.":[68],"By":[69,117],"assuming":[70],"that":[71],"has":[75],"low-rank":[76,83],"characteristics,":[77],"solvable":[81],"by":[82,110],"approximation":[84],"based":[85,99],"on":[86,100,174,194],"factorization.":[88],"new":[90,104],"formulation":[91],"circumvents":[92],"well-known":[94],"drawbacks":[95],"existing":[97],"approaches":[98],"Euclidean":[101,165],"embedding.":[102],"A":[103],"algorithm,":[105],"so-called":[106],"Decentralized":[107],"Matrix":[108],"Factorization":[109],"Stochastic":[111],"Gradient":[112],"Descent":[113],"(DMFSGD),":[114],"proposed.":[116],"letting":[118],"nodes":[120,150],"exchange":[121],"messages":[122],"with":[123,143],"each":[124,134],"other,":[125],"algorithm":[127],"fully":[129],"decentralized":[130],"only":[132,204],"requires":[133],"node":[135],"collect":[137],"process":[140],"local":[141],"measurements,":[142],"neither":[144],"explicit":[145],"constructions":[147],"nor":[148],"special":[149],"such":[151],"landmarks":[153],"central":[155],"servers.":[156],"In":[157],"addition,":[158],"we":[159],"compared":[160],"comprehensively":[161],"factorization":[163],"embedding":[166],"demonstrate":[168],"suitability":[170],"former":[173],"prediction.":[177],"We":[178],"further":[179],"studied":[180],"incorporation":[182],"robust":[185],"loss":[186],"function":[187],"nonnegativity":[190],"constraints.":[191],"Extensive":[192],"experiments":[193],"various":[195],"publicly":[196],"available":[197],"datasets":[198],"delays":[201],"show":[202],"not":[203],"scalability":[206],"accuracy":[209],"our":[211],"approach,":[212],"but":[213],"also":[214],"its":[215],"usability":[216],"real":[218]},"counts_by_year":[{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}