{"id":"https://openalex.org/W4308671079","doi":"https://doi.org/10.1145/3539597.3570441","title":"Graph Summarization via Node Grouping: A Spectral Algorithm","display_name":"Graph Summarization via Node Grouping: A Spectral Algorithm","publication_year":2023,"publication_date":"2023-02-22","ids":{"openalex":"https://openalex.org/W4308671079","doi":"https://doi.org/10.1145/3539597.3570441"},"language":"en","primary_location":{"id":"doi:10.1145/3539597.3570441","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3539597.3570441","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3539597.3570441","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3539597.3570441","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038632957","display_name":"Arpit Merchant","orcid":"https://orcid.org/0000-0001-8143-1539"},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Arpit Merchant","raw_affiliation_strings":["University of Helsinki, Helsinki, Finland"],"raw_orcid":"https://orcid.org/0000-0001-8143-1539","affiliations":[{"raw_affiliation_string":"University of Helsinki, Helsinki, Finland","institution_ids":["https://openalex.org/I133731052"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077299582","display_name":"Michael Mathioudakis","orcid":"https://orcid.org/0000-0003-0074-3966"},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Michael Mathioudakis","raw_affiliation_strings":["University of Helsinki, Helsinki, Finland"],"raw_orcid":"https://orcid.org/0000-0003-0074-3966","affiliations":[{"raw_affiliation_string":"University of Helsinki, Helsinki, Finland","institution_ids":["https://openalex.org/I133731052"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065488679","display_name":"Yanhao Wang","orcid":"https://orcid.org/0000-0002-7661-3917"},"institutions":[{"id":"https://openalex.org/I66867065","display_name":"East China Normal University","ror":"https://ror.org/02n96ep67","country_code":"CN","type":"education","lineage":["https://openalex.org/I66867065"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yanhao Wang","raw_affiliation_strings":["East China Normal University, Shanghai, China"],"raw_orcid":"https://orcid.org/0000-0002-7661-3917","affiliations":[{"raw_affiliation_string":"East China Normal University, Shanghai, China","institution_ids":["https://openalex.org/I66867065"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4282,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.59808316,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"742","last_page":"750"},"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.9995999932289124,"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.9993000030517578,"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/automatic-summarization","display_name":"Automatic summarization","score":0.8222360014915466},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.8148195743560791},{"id":"https://openalex.org/keywords/graph-energy","display_name":"Graph energy","score":0.6726207137107849},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6673691272735596},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4824281632900238},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.47231197357177734},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4696684777736664},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45348235964775085},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.44268378615379333},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.435309499502182},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4332755506038666},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2477443814277649},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2205689549446106},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2018967866897583},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.2010534107685089},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16100409626960754}],"concepts":[{"id":"https://openalex.org/C170858558","wikidata":"https://www.wikidata.org/wiki/Q1394144","display_name":"Automatic summarization","level":2,"score":0.8222360014915466},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.8148195743560791},{"id":"https://openalex.org/C78913703","wikidata":"https://www.wikidata.org/wiki/Q5597087","display_name":"Graph energy","level":5,"score":0.6726207137107849},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6673691272735596},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4824281632900238},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.47231197357177734},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4696684777736664},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45348235964775085},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.44268378615379333},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.435309499502182},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4332755506038666},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2477443814277649},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2205689549446106},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2018967866897583},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.2010534107685089},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16100409626960754}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3539597.3570441","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3539597.3570441","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3539597.3570441","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2211.04169","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2211.04169","pdf_url":"https://arxiv.org/pdf/2211.04169","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:helda.helsinki.fi:10138/356630","is_oa":true,"landing_page_url":"http://hdl.handle.net/10138/356630","pdf_url":null,"source":{"id":"https://openalex.org/S4210213322","display_name":"Ty\u00f6v\u00e4entutkimus Vuosikirja","issn_l":"0784-1272","issn":["0784-1272","1459-7780"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference contribution"}],"best_oa_location":{"id":"doi:10.1145/3539597.3570441","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3539597.3570441","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3539597.3570441","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G309112268","display_name":null,"funder_award_id":"MLDB (322046) and HPC-HD (347747)","funder_id":"https://openalex.org/F4320321108","funder_display_name":"Academy of Finland"}],"funders":[{"id":"https://openalex.org/F4320310086","display_name":"Helsingin Yliopisto","ror":"https://ror.org/040af2s02"},{"id":"https://openalex.org/F4320321108","display_name":"Academy of Finland","ror":"https://ror.org/05k73zm37"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4308671079.pdf"},"referenced_works_count":47,"referenced_works":["https://openalex.org/W1550080987","https://openalex.org/W1966292582","https://openalex.org/W1971458834","https://openalex.org/W1977361006","https://openalex.org/W1978024959","https://openalex.org/W1994727615","https://openalex.org/W2029852131","https://openalex.org/W2036032872","https://openalex.org/W2068015060","https://openalex.org/W2073415627","https://openalex.org/W2080234606","https://openalex.org/W2082773934","https://openalex.org/W2086953401","https://openalex.org/W2100132188","https://openalex.org/W2108614537","https://openalex.org/W2108781142","https://openalex.org/W2142838865","https://openalex.org/W2146591355","https://openalex.org/W2153959628","https://openalex.org/W2154851992","https://openalex.org/W2165971212","https://openalex.org/W2199530723","https://openalex.org/W2292193262","https://openalex.org/W2418808916","https://openalex.org/W2434543269","https://openalex.org/W2624291017","https://openalex.org/W2916603171","https://openalex.org/W2963264680","https://openalex.org/W3005994946","https://openalex.org/W3029276328","https://openalex.org/W3036364901","https://openalex.org/W3094504436","https://openalex.org/W3099747923","https://openalex.org/W3101346938","https://openalex.org/W3103250330","https://openalex.org/W3104097132","https://openalex.org/W3160872503","https://openalex.org/W3167861891","https://openalex.org/W3176427671","https://openalex.org/W3176655742","https://openalex.org/W3177157354","https://openalex.org/W3178754776","https://openalex.org/W4212848460","https://openalex.org/W4246573341","https://openalex.org/W4287100258","https://openalex.org/W4291474301","https://openalex.org/W4301352956"],"related_works":["https://openalex.org/W4372284312","https://openalex.org/W3119082574","https://openalex.org/W4295974787","https://openalex.org/W4213150077","https://openalex.org/W4388347373","https://openalex.org/W2153421018","https://openalex.org/W125803343","https://openalex.org/W2117632582","https://openalex.org/W2770521059","https://openalex.org/W2062996107"],"abstract_inverted_index":{"Graph":[0],"summarization":[1,66,174],"via":[2,157],"node":[3],"grouping":[4,15],"is":[5,35],"a":[6,143],"popular":[7],"method":[8],"to":[9,47,88,132,135,151,172,178],"build":[10],"concise":[11],"graph":[12,20,44,115],"representations":[13],"by":[14,113],"nodes":[16,134],"from":[17],"the":[18,30,61,85,89,93,109,122,129,138,148],"original":[19],"into":[21,26,67],"supernodes":[22],"and":[23,51,176],"encoding":[24],"edges":[25],"superedges":[27],"such":[28],"that":[29,103,146,165],"loss":[31,62],"of":[32,92,105,128,182],"adjacency":[33,94,130],"information":[34],"minimized.":[36],"Such":[37],"summaries":[38,170],"have":[39],"immense":[40],"applications":[41],"in":[42],"large-scale":[43],"analytics":[45],"due":[46],"their":[48],"small":[49],"size":[50],"high":[52],"query":[53],"processing":[54],"efficiency.":[55],"In":[56,108,137],"this":[57],"paper,":[58],"we":[59,82,97,117,141,163],"reformulate":[60],"minimization":[63],"problem":[64],"for":[65,79],"an":[68,99],"equivalent":[69],"integer":[70,80],"maximization":[71],"problem.":[72],"By":[73],"initially":[74],"allowing":[75],"relaxed":[76],"(fractional)":[77],"solutions":[78],"maximization,":[81],"analytically":[83],"expose":[84],"underlying":[86],"connections":[87],"spectral":[90,114],"properties":[91],"matrix.":[95],"Consequently,":[96],"design":[98],"algorithm":[100],"called":[101],"SpecSumm":[102,166],"consists":[104],"two":[106],"phases.":[107],"first":[110],"phase,":[111,140],"motivated":[112],"theory,":[116],"apply":[118],"k-means":[119],"clustering":[120],"on":[121,160],"k":[123],"largest":[124],"(in":[125],"magnitude)":[126],"eigenvectors":[127],"matrix":[131],"assign":[133],"supernodes.":[136],"second":[139],"propose":[142],"greedy":[144],"heuristic":[145],"updates":[147],"initial":[149],"assignment":[150],"further":[152],"improve":[153],"summary":[154],"quality.":[155],"Finally,":[156],"extensive":[158],"experiments":[159],"11":[161],"datasets,":[162],"show":[164],"efficiently":[167],"produces":[168],"high-quality":[169],"compared":[171],"state-of-the-art":[173],"algorithms":[175],"scales":[177],"graphs":[179],"with":[180],"millions":[181],"nodes.":[183]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-03T08:13:44.112507","created_date":"2025-10-10T00:00:00"}