{"id":"https://openalex.org/W4416857064","doi":"https://doi.org/10.1145/3779064","title":"Polarized Communities Meet Densest Subgraph: Efficient and Effective Polarization Detection in Signed Networks","display_name":"Polarized Communities Meet Densest Subgraph: Efficient and Effective Polarization Detection in Signed Networks","publication_year":2025,"publication_date":"2025-12-01","ids":{"openalex":"https://openalex.org/W4416857064","doi":"https://doi.org/10.1145/3779064"},"language":"en","primary_location":{"id":"doi:10.1145/3779064","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3779064","pdf_url":null,"source":{"id":"https://openalex.org/S41523882","display_name":"ACM Transactions on Knowledge Discovery from Data","issn_l":"1556-4681","issn":["1556-4681","1556-472X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Knowledge Discovery from Data","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/A5026420819","display_name":"Francesco Gullo","orcid":"https://orcid.org/0000-0002-7052-1114"},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Francesco Gullo","raw_affiliation_strings":["University of L\u2019Aquila, L\u2019Aquila, Italy","University of L\u2019Aquila, Italy"],"raw_orcid":"https://orcid.org/0000-0002-7052-1114","affiliations":[{"raw_affiliation_string":"University of L\u2019Aquila, L\u2019Aquila, Italy","institution_ids":["https://openalex.org/I26415053"]},{"raw_affiliation_string":"University of L\u2019Aquila, Italy","institution_ids":["https://openalex.org/I26415053"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089958462","display_name":"Domenico Mandaglio","orcid":"https://orcid.org/0000-0002-8506-1974"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Domenico Mandaglio","raw_affiliation_strings":["University of Calabria, Rende, Italy","University of Calabria, Italy"],"raw_orcid":"https://orcid.org/0000-0002-8506-1974","affiliations":[{"raw_affiliation_string":"University of Calabria, Rende, Italy","institution_ids":["https://openalex.org/I45204951"]},{"raw_affiliation_string":"University of Calabria, Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021211836","display_name":"Andrea Tagarelli","orcid":"https://orcid.org/0000-0002-8142-503X"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Andrea Tagarelli","raw_affiliation_strings":["University of Calabria, Rende, Italy","University of Calabria, Italy"],"raw_orcid":"https://orcid.org/0000-0002-8142-503X","affiliations":[{"raw_affiliation_string":"University of Calabria, Rende, Italy","institution_ids":["https://openalex.org/I45204951"]},{"raw_affiliation_string":"University of Calabria, Italy","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8037,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.78369156,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"20","issue":"2","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.5889000296592712,"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.5889000296592712,"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.15449999272823334,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.06930000334978104,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6790000200271606},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.5134999752044678},{"id":"https://openalex.org/keywords/polarization","display_name":"Polarization (electrochemistry)","score":0.5002999901771545},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.48969998955726624},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4196000099182129},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.373199999332428}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6790000200271606},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.5134999752044678},{"id":"https://openalex.org/C205049153","wikidata":"https://www.wikidata.org/wiki/Q2698605","display_name":"Polarization (electrochemistry)","level":2,"score":0.5002999901771545},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.48969998955726624},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47429999709129333},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44769999384880066},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4196000099182129},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.373199999332428},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37299999594688416},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3499999940395355},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32749998569488525},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.322299987077713},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.3206000030040741},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.2818000018596649},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2770000100135803},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3779064","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3779064","pdf_url":null,"source":{"id":"https://openalex.org/S41523882","display_name":"ACM Transactions on Knowledge Discovery from Data","issn_l":"1556-4681","issn":["1556-4681","1556-472X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Knowledge Discovery from Data","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1980769375","https://openalex.org/W2083392533","https://openalex.org/W2217968126","https://openalex.org/W2308341436","https://openalex.org/W2912708407","https://openalex.org/W2914959486","https://openalex.org/W2968871805","https://openalex.org/W3156116725","https://openalex.org/W3186154190","https://openalex.org/W3217136206","https://openalex.org/W4387188357","https://openalex.org/W4393085118","https://openalex.org/W4399879414","https://openalex.org/W4400451135"],"related_works":[],"abstract_inverted_index":{"Signed":[0],"networks":[1,84],"represent":[2],"interactions":[3],"among":[4],"users":[5],"(nodes),":[6],"with":[7],"edges":[8,44,51,60,97],"labeled":[9],"as":[10,38],"positive":[11],"for":[12,17],"friendly":[13],"relations":[14],"and":[15,56,98,138,158,163,179,198],"negative":[16],"antagonistic":[18],"ones.":[19],"The":[20,75],"2-Polarized-Communities":[21],"(":[22,78],"2pc":[23,104,142,173],")":[24,80],"combinatorial":[25],"optimization":[26],"problem":[27,81,105,134],"seeks":[28],"two":[29,156],"disjoint":[30],"polarized":[31],"communities":[32,53],"in":[33,72,82,86,193],"a":[34,88,109,152,160],"signed":[35],"network,":[36],"so":[37],"to":[39,67,141,171,190],"satisfy":[40],"three":[41],"conditions:":[42],"most":[43,50],"within":[45],"each":[46],"community":[47],"are":[48,54],"positive,":[49],"between":[52,94,154],"negative,":[55],"the":[57,68,73,103,117,126,132,155,183],"number":[58,69,95,99],"of":[59,70,96,100,186,195],"satisfying":[61],"these":[62],"conditions":[63],"is":[64],"high":[65],"compared":[66,189],"nodes":[71],"communities.":[74],"Densest":[76],"Subgraph":[77],"ds":[79,133,169],"unsigned":[83,136],"consists":[85],"finding":[87,108],"subgraph":[89],"that":[90],"exhibits":[91],"maximum":[92],"ratio":[93],"nodes.":[101],"Although":[102],"intuitively":[106],"suggests":[107],"dense":[110],"subgraph,":[111],"no":[112],"prior":[113],"work":[114,145],"has":[115],"explored":[116],"implicitly":[118],"optimized":[119],"density":[120],"measure":[121],"or":[122],"algorithmic":[123],"methods":[124,170],"from":[125],"rich,":[127],"yet":[128],"distinct,":[129],"literature":[130],"on":[131,177],"(in":[135],"networks)":[137],"applied":[139],"them":[140],".":[143,174],"This":[144],"bridges":[146],"this":[147],"gap":[148],"by":[149,168],"formally":[150],"establishing":[151],"link":[153],"problems":[157],"introducing":[159],"highly":[161],"efficient":[162],"effective":[164],"greedy":[165],"algorithm":[166],"inspired":[167],"solve":[172],"Experimental":[175],"results":[176],"synthetic":[178],"real":[180],"datasets":[181],"demonstrate":[182],"superior":[184],"performance":[185],"our":[187],"method":[188],"competing":[191],"approaches":[192],"terms":[194],"both":[196],"accuracy":[197],"efficiency.":[199]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-12-01T00:00:00"}