{"id":"https://openalex.org/W2554565524","doi":"https://doi.org/10.1109/tkde.2018.2819651","title":"Uncertain Graph Sparsification","display_name":"Uncertain Graph Sparsification","publication_year":2018,"publication_date":"2018-03-26","ids":{"openalex":"https://openalex.org/W2554565524","doi":"https://doi.org/10.1109/tkde.2018.2819651","mag":"2554565524"},"language":"en","primary_location":{"id":"doi:10.1109/tkde.2018.2819651","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2018.2819651","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","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 Transactions on Knowledge and Data Engineering","raw_type":"journal-article"},"type":"article","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/A5043783492","display_name":"Panos Parchas","orcid":"https://orcid.org/0009-0002-7458-454X"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Panos Parchas","raw_affiliation_strings":["Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Hong Kong","institution_ids":["https://openalex.org/I200769079"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032003787","display_name":"Nikolaos Papailiou","orcid":"https://orcid.org/0000-0001-6030-2762"},"institutions":[{"id":"https://openalex.org/I174458059","display_name":"National Technical University of Athens","ror":"https://ror.org/03cx6bg69","country_code":"GR","type":"education","lineage":["https://openalex.org/I174458059"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Nikolaos Papailiou","raw_affiliation_strings":["National Technical University of Athens, Zografou, Greece"],"raw_orcid":"https://orcid.org/0000-0001-6030-2762","affiliations":[{"raw_affiliation_string":"National Technical University of Athens, Zografou, Greece","institution_ids":["https://openalex.org/I174458059"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091887420","display_name":"Dimitris Papadias","orcid":null},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Dimitris Papadias","raw_affiliation_strings":["Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Hong Kong"],"raw_orcid":"https://orcid.org/0000-0001-5588-1026","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Hong Kong","institution_ids":["https://openalex.org/I200769079"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022272025","display_name":"Francesco Bonchi","orcid":"https://orcid.org/0000-0001-9464-8315"},"institutions":[{"id":"https://openalex.org/I134940468","display_name":"Institute for Scientific Interchange","ror":"https://ror.org/00te2x188","country_code":"IT","type":"facility","lineage":["https://openalex.org/I134940468"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Francesco Bonchi","raw_affiliation_strings":["ISI Foundation, Torino, Italy"],"raw_orcid":"https://orcid.org/0000-0001-9464-8315","affiliations":[{"raw_affiliation_string":"ISI Foundation, Torino, Italy","institution_ids":["https://openalex.org/I134940468"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1323,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.87852349,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"30","issue":"12","first_page":"2435","last_page":"2449"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9986000061035156,"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.9986000061035156,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9984999895095825,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9976000189781189,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7762738466262817},{"id":"https://openalex.org/keywords/clustering-coefficient","display_name":"Clustering coefficient","score":0.555597722530365},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49449798464775085},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4872352182865143},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.46821168065071106},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.42872336506843567},{"id":"https://openalex.org/keywords/biological-network","display_name":"Biological network","score":0.42841464281082153},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.4142017066478729},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4005661606788635},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.17629513144493103},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14406388998031616}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7762738466262817},{"id":"https://openalex.org/C22047676","wikidata":"https://www.wikidata.org/wiki/Q898680","display_name":"Clustering coefficient","level":3,"score":0.555597722530365},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49449798464775085},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4872352182865143},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.46821168065071106},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.42872336506843567},{"id":"https://openalex.org/C28225019","wikidata":"https://www.wikidata.org/wiki/Q4915005","display_name":"Biological network","level":2,"score":0.42841464281082153},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.4142017066478729},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4005661606788635},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.17629513144493103},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14406388998031616},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tkde.2018.2819651","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2018.2819651","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","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 Transactions on Knowledge and Data Engineering","raw_type":"journal-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-94849","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-94849","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"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":"Article"},{"id":"pmh:oai:repository.ust.hk:1783.1-94849","is_oa":false,"landing_page_url":"http://www.scopus.com/record/display.url?eid=2-s2.0-85044381793&origin=inward","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W57330","https://openalex.org/W793431435","https://openalex.org/W1543491698","https://openalex.org/W1854214752","https://openalex.org/W1951702208","https://openalex.org/W1969080501","https://openalex.org/W1981377410","https://openalex.org/W1983193888","https://openalex.org/W1983596562","https://openalex.org/W1996575062","https://openalex.org/W1997010704","https://openalex.org/W1997315949","https://openalex.org/W1998369386","https://openalex.org/W2002041206","https://openalex.org/W2002894241","https://openalex.org/W2017322423","https://openalex.org/W2019040312","https://openalex.org/W2044112344","https://openalex.org/W2049607688","https://openalex.org/W2049633694","https://openalex.org/W2055935910","https://openalex.org/W2063471322","https://openalex.org/W2101706513","https://openalex.org/W2123017611","https://openalex.org/W2126021606","https://openalex.org/W2130674086","https://openalex.org/W2130983041","https://openalex.org/W2133238553","https://openalex.org/W2134277721","https://openalex.org/W2136618432","https://openalex.org/W2137442080","https://openalex.org/W2143668817","https://openalex.org/W2146008005","https://openalex.org/W2157747946","https://openalex.org/W2336483534","https://openalex.org/W2337889385","https://openalex.org/W2591972614","https://openalex.org/W3104306072","https://openalex.org/W4231761369","https://openalex.org/W4245082111","https://openalex.org/W4250589301","https://openalex.org/W6639055396"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W1531601525","https://openalex.org/W2128644323","https://openalex.org/W2072971818","https://openalex.org/W4283723149","https://openalex.org/W31445736"],"abstract_inverted_index":{"Uncertain":[0],"graphs":[1,43],"are":[2],"prevalent":[3],"in":[4,57,88],"several":[5,136],"applications":[6],"including":[7,140],"communications":[8],"systems,":[9],"biological":[10],"databases,":[11],"and":[12,27,84,108,113,126,146],"social":[13],"networks.":[14],"The":[15,76,100],"ever":[16],"increasing":[17],"size":[18,40],"of":[19,41,52,82,132],"the":[20,39,47,58,67,80,92,117,130],"underlying":[21,98],"data":[22],"renders":[23],"both":[24],"graph":[25,93,102,138],"storage":[26],"query":[28,112],"processing":[29],"extremely":[30],"expensive.":[31],"Sparsification":[32],"has":[33],"often":[34],"been":[35],"used":[36,105],"to":[37,90,106],"reduce":[38,79],"deterministic":[42,53],"by":[44],"maintaining":[45],"only":[46],"important":[48],"edges.":[49],"However,":[50],"adaptation":[51],"sparsification":[54,69],"methods":[55,78],"fails":[56],"uncertain":[59,74],"setting.":[60],"To":[61],"overcome":[62],"this":[63],"problem,":[64],"we":[65],"introduce":[66],"first":[68],"techniques":[70,134],"aimed":[71],"explicitly":[72],"at":[73],"graphs.":[75],"proposed":[77],"number":[81],"edges":[83],"redistribute":[85],"their":[86],"probabilities":[87],"order":[89],"decrease":[91],"size,":[94],"while":[95],"preserving":[96],"its":[97],"structure.":[99],"resulting":[101],"can":[103],"be":[104],"efficiently":[107],"accurately":[109],"approximate":[110],"any":[111],"mining":[114],"tasks":[115],"on":[116,135],"original":[118],"graph.":[119],"An":[120],"extensive":[121],"experimental":[122],"evaluation":[123],"with":[124],"real":[125],"synthetic":[127],"datasets":[128],"illustrates":[129],"effectiveness":[131],"our":[133],"common":[137],"tasks,":[139],"clustering":[141],"coefficient,":[142],"page":[143],"rank,":[144],"reliability,":[145],"shortest":[147],"path":[148],"distance.":[149]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}