{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:49:37Z","timestamp":1777614577662,"version":"3.51.4"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Hong Kong RGC","award":["16201615"],"award-info":[{"award-number":["16201615"]}]},{"name":"Hong Kong RGC","award":["16205117"],"award-info":[{"award-number":["16205117"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2018,12,1]]},"DOI":"10.1109\/tkde.2018.2819651","type":"journal-article","created":{"date-parts":[[2018,3,26]],"date-time":"2018-03-26T18:05:32Z","timestamp":1522087532000},"page":"2435-2449","source":"Crossref","is-referenced-by-count":18,"title":["Uncertain Graph Sparsification"],"prefix":"10.1109","volume":"30","author":[{"given":"Panos","family":"Parchas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6030-2762","authenticated-orcid":false,"given":"Nikolaos","family":"Papailiou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5588-1026","authenticated-orcid":false,"given":"Dimitris","family":"Papadias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9464-8315","authenticated-orcid":false,"given":"Francesco","family":"Bonchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989399"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026543900054"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2818182"},{"key":"ref32","first-page":"967","article-title":"The pursuit of a good possible world: Extracting representative instances of uncertain graphs","author":"parchas","year":"2014","journal-title":"Proc ACM SIGMOD Int Conf Manage Data"},{"key":"ref31","article-title":"The pagerank citation ranking: Bringing order to the web","author":"page","year":"1999"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758778"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.57"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30140-0_52"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920967"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130114"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-013-0328-8"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/080734029"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1955.5.33"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/1350486X.2015.1110492"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the EM algorithm","volume":"39","author":"dempster","year":"1977","journal-title":"J Roy Statist Soc"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993647"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2015.1130129"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.124"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1.5.263"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-008-0106-1"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755574"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF02189308"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020492"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40328-6_1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2492007.2492029"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113288"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20130"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/070705970"},{"key":"ref7","first-page":"47","article-title":"Approximating st minimum cuts in õ ($n^2$ ) time","author":"bencz\u00far","year":"1996","journal-title":"Proc 28th Annu ACM Symp Theory Comput"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213560"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623655"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.44"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090267"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1126\/science.1116869"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/141002281"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612676"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2808797.2809313"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816709"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8525379\/08325513.pdf?arnumber=8325513","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T09:56:31Z","timestamp":1719914191000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8325513\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,1]]},"references-count":40,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2018.2819651","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,1]]}}}