{"id":"https://openalex.org/W2082190556","doi":"https://doi.org/10.1145/2701126.2701157","title":"Lossless graph summarization using dense subgraphs discovery","display_name":"Lossless graph summarization using dense subgraphs discovery","publication_year":2015,"publication_date":"2015-01-08","ids":{"openalex":"https://openalex.org/W2082190556","doi":"https://doi.org/10.1145/2701126.2701157","mag":"2082190556"},"language":"en","primary_location":{"id":"doi:10.1145/2701126.2701157","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2701126.2701157","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 9th International Conference on Ubiquitous Information Management and Communication","raw_type":"proceedings-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/A5045182513","display_name":"Kifayat Ullah Khan","orcid":"https://orcid.org/0000-0002-3916-1659"},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Kifayat Ullah Khan","raw_affiliation_strings":["Kyung Hee University, Yongin-si, Gyeonggi-do, Republic of Korea","Kyung Hee University, Yongin-si, Gyeonggi-do, Republic of Korea#TAB#"],"affiliations":[{"raw_affiliation_string":"Kyung Hee University, Yongin-si, Gyeonggi-do, Republic of Korea","institution_ids":["https://openalex.org/I35928602"]},{"raw_affiliation_string":"Kyung Hee University, Yongin-si, Gyeonggi-do, Republic of Korea#TAB#","institution_ids":["https://openalex.org/I35928602"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084823078","display_name":"Waqas Nawaz","orcid":"https://orcid.org/0000-0002-9989-6163"},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Waqas Nawaz","raw_affiliation_strings":["Kyung Hee University, Yongin-si, Gyeonggi-do, Republic of Korea","Kyung Hee University, Yongin-si, Gyeonggi-do, Republic of Korea#TAB#"],"affiliations":[{"raw_affiliation_string":"Kyung Hee University, Yongin-si, Gyeonggi-do, Republic of Korea","institution_ids":["https://openalex.org/I35928602"]},{"raw_affiliation_string":"Kyung Hee University, Yongin-si, Gyeonggi-do, Republic of Korea#TAB#","institution_ids":["https://openalex.org/I35928602"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039165136","display_name":"Young-Koo Lee","orcid":"https://orcid.org/0000-0003-2314-5395"},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Young-Koo Lee","raw_affiliation_strings":["Kyung Hee University, Yongin-si, Gyeonggi-do, Republic of Korea","Kyung Hee University, Yongin-si, Gyeonggi-do, Republic of Korea#TAB#"],"affiliations":[{"raw_affiliation_string":"Kyung Hee University, Yongin-si, Gyeonggi-do, Republic of Korea","institution_ids":["https://openalex.org/I35928602"]},{"raw_affiliation_string":"Kyung Hee University, Yongin-si, Gyeonggi-do, Republic of Korea#TAB#","institution_ids":["https://openalex.org/I35928602"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5045182513"],"corresponding_institution_ids":["https://openalex.org/I35928602"],"apc_list":null,"apc_paid":null,"fwci":0.5996,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.74781693,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9980000257492065,"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/T11106","display_name":"Data Management and Algorithms","score":0.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/automatic-summarization","display_name":"Automatic summarization","score":0.7684064507484436},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.7605440616607666},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6029290556907654},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5184006690979004},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48352837562561035},{"id":"https://openalex.org/keywords/minimum-description-length","display_name":"Minimum description length","score":0.4797040820121765},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.47089889645576477},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.46795451641082764},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4443422555923462},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3266220688819885},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3257412910461426},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32067692279815674},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.2841533124446869},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.18957015872001648},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1127781867980957},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.09028875827789307}],"concepts":[{"id":"https://openalex.org/C170858558","wikidata":"https://www.wikidata.org/wiki/Q1394144","display_name":"Automatic summarization","level":2,"score":0.7684064507484436},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.7605440616607666},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6029290556907654},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5184006690979004},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48352837562561035},{"id":"https://openalex.org/C87465248","wikidata":"https://www.wikidata.org/wiki/Q1417790","display_name":"Minimum description length","level":2,"score":0.4797040820121765},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.47089889645576477},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.46795451641082764},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4443422555923462},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3266220688819885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3257412910461426},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32067692279815674},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.2841533124446869},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.18957015872001648},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1127781867980957},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.09028875827789307}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2701126.2701157","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2701126.2701157","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 9th International Conference on Ubiquitous Information Management and Communication","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1500512125","https://openalex.org/W1535144194","https://openalex.org/W1964419312","https://openalex.org/W1966292582","https://openalex.org/W1967006938","https://openalex.org/W1978024959","https://openalex.org/W1984903982","https://openalex.org/W1994727615","https://openalex.org/W2029852131","https://openalex.org/W2032279394","https://openalex.org/W2036032872","https://openalex.org/W2054658115","https://openalex.org/W2108781142","https://openalex.org/W2125580539","https://openalex.org/W2148606255","https://openalex.org/W4235526601"],"related_works":["https://openalex.org/W2532922352","https://openalex.org/W231720905","https://openalex.org/W2604893261","https://openalex.org/W2915540008","https://openalex.org/W1482551403","https://openalex.org/W2361654510","https://openalex.org/W2128390795","https://openalex.org/W2604114816","https://openalex.org/W2954463587","https://openalex.org/W2393701947"],"abstract_inverted_index":{"Dense":[0],"subgraph":[1,62,183],"discovery,":[2,184],"in":[3,66,80],"a":[4,20,50,76,127,152],"large":[5],"graph,":[6],"is":[7],"useful":[8],"to":[9,75,107,125,142],"solve":[10,87],"the":[11,35,56,83,92,99,114,119,144,170,174],"community":[12],"search":[13,26],"problem.":[14],"Motivated":[15],"from":[16,155],"this,":[17],"we":[18,25,90,117,168],"propose":[19,91,139],"graph":[21],"summarization":[22],"method":[23],"where":[24],"and":[27,147,185],"aggregate":[28],"dense":[29,36,61,100,115,157,182],"subgraphs":[30,37,47,101],"into":[31],"super":[32,153],"nodes.":[33],"Since":[34],"have":[38,63,70],"high":[39],"overlap":[40],"of":[41,59,94,105,109],"common":[42,106],"neighbors,":[43],"thus":[44],"merging":[45],"such":[46],"can":[48],"produce":[49],"highly":[51,128],"compact":[52,129],"summary":[53,130],"graph.":[54],"Whereas":[55],"member":[57],"nodes":[58],"each":[60,156],"many":[64],"edges":[65,72],"common,":[67],"they":[68],"also":[69],"some":[71],"not":[73],"belonging":[74],"given":[77],"subgraph;":[78],"which":[79],"turn":[81],"reduce":[82],"compression":[84,148],"ratio.":[85],"To":[86,112],"this":[88],"problem,":[89],"concept":[93],"AutoPruning":[95],"that":[96,108],"effectively":[97],"filters":[98],"having":[102],"higher":[103],"ratio":[104,149],"non-common":[110],"neighbors.":[111],"summarize":[113],"subgraphs,":[116],"use":[118],"Minimum":[120,177],"Description":[121],"Length":[122],"(MDL)":[123],"principle":[124],"obtain":[126],"with":[131,173],"least":[132],"edge":[133],"corrections":[134],"for":[135,181],"lossless":[136],"compression.":[137],"We":[138],"two":[140,162],"alternatives":[141],"trade-off":[143],"computation":[145],"time":[146],"while":[150],"creating":[151],"node":[154],"subgraph.":[158],"Through":[159],"experiments":[160],"on":[161],"publicly":[163],"available":[164],"real":[165],"world":[166],"graphs,":[167],"compare":[169],"proposed":[171],"approach":[172],"well":[175],"known":[176],"Degree":[178],"Measure":[179],"(MDM),":[180],"observe":[186],"very":[187],"encouraging":[188],"results.":[189]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}