{"id":"https://openalex.org/W3080939901","doi":"https://doi.org/10.1145/3394486.3403190","title":"In and Out: Optimizing Overall Interaction in Probabilistic Graphs under Clustering Constraints","display_name":"In and Out: Optimizing Overall Interaction in Probabilistic Graphs under Clustering Constraints","publication_year":2020,"publication_date":"2020-08-20","ids":{"openalex":"https://openalex.org/W3080939901","doi":"https://doi.org/10.1145/3394486.3403190","mag":"3080939901"},"language":"en","primary_location":{"id":"doi:10.1145/3394486.3403190","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3394486.3403190","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","raw_type":"proceedings-article"},"type":"conference-paper","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/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 (CS), Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Calabria, Rende (CS), Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","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 (CS), Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Calabria, Rende (CS), Italy","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026420819","display_name":"Francesco Gullo","orcid":"https://orcid.org/0000-0002-7052-1114"},"institutions":[{"id":"https://openalex.org/I153551853","display_name":"UniCredit (Italy)","ror":"https://ror.org/00fgmmg43","country_code":"IT","type":"company","lineage":["https://openalex.org/I153551853"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Francesco Gullo","raw_affiliation_strings":["UniCredit, Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UniCredit, Rome, Italy","institution_ids":["https://openalex.org/I153551853"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1371","last_page":"1381"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9997000098228455,"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.9997000098228455,"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.9939000010490417,"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9864000082015991,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6837930679321289},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6514936685562134},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.6451579332351685},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6265694499015808},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5774816274642944},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5067136883735657},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4221493601799011},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4121999144554138},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3969663977622986},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33690139651298523},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.2669143080711365},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2523905634880066},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2180638611316681}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6837930679321289},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6514936685562134},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.6451579332351685},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6265694499015808},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5774816274642944},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5067136883735657},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4221493601799011},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4121999144554138},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3969663977622986},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33690139651298523},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2669143080711365},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2523905634880066},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2180638611316681},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3394486.3403190","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3394486.3403190","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1574010683","https://openalex.org/W1985875030","https://openalex.org/W1997987084","https://openalex.org/W1998369386","https://openalex.org/W2017732166","https://openalex.org/W2029682635","https://openalex.org/W2091478944","https://openalex.org/W2091858563","https://openalex.org/W2112461976","https://openalex.org/W2133238553","https://openalex.org/W2139619755","https://openalex.org/W2146081992","https://openalex.org/W2296603104","https://openalex.org/W2417643473","https://openalex.org/W2581291501","https://openalex.org/W2756390566","https://openalex.org/W2912284681","https://openalex.org/W2914959486","https://openalex.org/W2925326765","https://openalex.org/W2964253936","https://openalex.org/W4298203227","https://openalex.org/W6649858639","https://openalex.org/W6726546742","https://openalex.org/W6732456489"],"related_works":["https://openalex.org/W2487162673","https://openalex.org/W2942366970","https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W2793211469","https://openalex.org/W2949152769","https://openalex.org/W4252555497","https://openalex.org/W4372354731","https://openalex.org/W2562400057","https://openalex.org/W1692008701"],"abstract_inverted_index":{"We":[0,95],"study":[1],"two":[2],"novel":[3],"clustering":[4],"problems":[5,99],"in":[6,64,92,106,160],"which":[7],"the":[8,24,27,41,49,52,68,81,88,93,114,120],"pairwise":[9],"interactions":[10,84,91],"between":[11],"entities":[12,28,63,76],"are":[13,100,104],"characterized":[14],"by":[15,20],"probability":[16],"distributions":[17],"and":[18,67,102,126,130,140,164],"conditioned":[19],"external":[21],"factors":[22,55],"within":[23],"environment":[25],"where":[26,34,51],"interact.":[29],"This":[30],"covers":[31],"any":[32],"scenario":[33],"a":[35,65,73],"set":[36,74],"of":[37,62,75,90,108,122,134,147,162],"actions":[38],"can":[39,56],"alter":[40],"entities'":[42],"interaction":[43,53],"behavior.":[44],"In":[45],"particular,":[46],"we":[47,111],"consider":[48],"case":[50],"conditioning":[54],"be":[57],"modeled":[58],"as":[59,78,117,150,152],"cluster":[60],"memberships":[61],"graph":[66],"goal":[69],"is":[70],"to":[71,79,156],"partition":[72],"such":[77],"maximize":[80],"overall":[82],"vertex":[83],"or,":[85],"equivalently,":[86],"minimize":[87],"loss":[89],"graph.":[94],"show":[96],"that":[97],"both":[98,124,138,159],"NP-hard":[101],"they":[103],"equivalent":[105],"terms":[107,161],"optimality.":[109],"However,":[110],"focus":[112],"on":[113,137],"minimization":[115],"formulation":[116],"it":[118],"enables":[119],"possibility":[121],"devising":[123],"practical":[125],"efficient":[127],"approximation":[128],"algorithms":[129],"heuristics.":[131],"Experimental":[132],"evaluation":[133],"our":[135],"algorithms,":[136],"synthetic":[139],"real":[141],"network":[142],"datasets,":[143],"has":[144],"shown":[145],"evidence":[146],"their":[148],"meaningfulness":[149],"well":[151],"superiority":[153],"with":[154],"respect":[155],"competing":[157],"methods,":[158],"effectiveness":[163],"efficiency.":[165]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}