{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T10:28:39Z","timestamp":1776680919555,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T00:00:00Z","timestamp":1597881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,8,23]]},"DOI":"10.1145\/3394486.3403190","type":"proceedings-article","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T23:18:56Z","timestamp":1597965536000},"page":"1371-1381","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["In and Out: Optimizing Overall Interaction in Probabilistic Graphs under Clustering Constraints"],"prefix":"10.1145","author":[{"given":"Domenico","family":"Mandaglio","sequence":"first","affiliation":[{"name":"University of Calabria, Rende (CS), Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Tagarelli","sequence":"additional","affiliation":[{"name":"University of Calabria, Rende (CS), Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Gullo","sequence":"additional","affiliation":[{"name":"UniCredit, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,8,20]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"JACM","volume":"55","author":"Ailon N.","year":"2008","unstructured":"N. Ailon , M. Charikar , and A. Newman . 2008. Aggregating inconsistent information: Ranking and clustering . JACM , Vol. 55 , 5 ( 2008 ), 23:1--23:27. N. Ailon, M. Charikar, and A. Newman. 2008. Aggregating inconsistent information: Ranking and clustering. JACM, Vol. 55, 5 (2008), 23:1--23:27."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000033116.57574.95"},{"key":"e_1_3_2_2_3_1","volume-title":"Proc. ACM KDD Conf. 1316--1325","author":"Bonchi F.","unstructured":"F. Bonchi , F. Gullo , A. Kaltenbrunner , and Y. Volkovich . 2014. Core decomposition of uncertain graphs . In Proc. ACM KDD Conf. 1316--1325 . F. Bonchi, F. Gullo, A. Kaltenbrunner, and Y. Volkovich. 2014. Core decomposition of uncertain graphs. In Proc. ACM KDD Conf. 1316--1325."},{"key":"e_1_3_2_2_4_1","first-page":"472","article-title":"Clustering Uncertain Graphs","volume":"11","author":"Ceccarello M.","year":"2017","unstructured":"M. Ceccarello , C. Fantozzi , A. Pietracaprina , G. Pucci , and F. Vandin . 2017 . Clustering Uncertain Graphs . PVLDB , Vol. 11 , 4 (2017), 472 -- 484 . M. Ceccarello, C. Fantozzi, A. Pietracaprina, G. Pucci, and F. Vandin. 2017. Clustering Uncertain Graphs. PVLDB, Vol. 11, 4 (2017), 472--484.","journal-title":"PVLDB"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.012"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.05.008"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"P. Esmailian and M. Jalili. 2015. Community detection in signed networks: the role of negative ties in different scales. Scientific reports Vol. 5 (2015) 14339.  P. Esmailian and M. Jalili. 2015. Community detection in signed networks: the role of negative ties in different scales. Scientific reports Vol. 5 (2015) 14339.","DOI":"10.1038\/srep14339"},{"key":"e_1_3_2_2_8_1","first-page":"1117","article-title":"Effective and Efficient Clustering Methods for Correlated Probabilistic Graphs","volume":"26","author":"Y.","year":"2014","unstructured":"Yu G., Chunpeng G., Gao C., and Ge Y. 2014 . Effective and Efficient Clustering Methods for Correlated Probabilistic Graphs . IEEE TKDE , Vol. 26 , 5 (2014), 1117 -- 1130 . Yu G., Chunpeng G., Gao C., and Ge Y. 2014. Effective and Efficient Clustering Methods for Correlated Probabilistic Graphs. IEEE TKDE, Vol. 26, 5 (2014), 1117--1130.","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.016114"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.04.043"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/3311880.3311884"},{"key":"e_1_3_2_2_12_1","volume-title":"Proc. EDBT Conf. 535--546","author":"Khan A.","unstructured":"A. Khan , F. Bonchi , A. Gionis , and F. Gullo . 2014. Fast Reliability Search in Uncertain Graphs . In Proc. EDBT Conf. 535--546 . A. Khan, F. Bonchi, A. Gionis, and F. Gullo. 2014. Fast Reliability Search in Uncertain Graphs. In Proc. EDBT Conf. 535--546."},{"key":"e_1_3_2_2_13_1","first-page":"2078","article-title":"Conditional Reliability in Uncertain Graphs","volume":"30","author":"Khan A.","year":"2018","unstructured":"A. Khan , F. Bonchi , F. Gullo , and A. Nufer . 2018 a. Conditional Reliability in Uncertain Graphs . IEEE TKDE , Vol. 30 , 11 (2018), 2078 -- 2092 . A. Khan, F. Bonchi, F. Gullo, and A. Nufer. 2018a. Conditional Reliability in Uncertain Graphs. IEEE TKDE, Vol. 30, 11 (2018), 2078--2092.","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"A. Khan Y. Ye and L. Chen. 2018b. On Uncertain Graphs .Morgan & Claypool.  A. Khan Y. Ye and L. Chen. 2018b. On Uncertain Graphs .Morgan & Claypool.","DOI":"10.1007\/978-3-031-01860-2"},{"key":"e_1_3_2_2_15_1","first-page":"325","article-title":"Clustering Large Probabilistic Graphs","volume":"25","author":"Kollios G.","year":"2013","unstructured":"G. Kollios , M. Potamias , and E. Terzi . 2013 . Clustering Large Probabilistic Graphs . IEEE TKDE , Vol. 25 , 2 (2013), 325 -- 336 . G. Kollios, M. Potamias, and E. Terzi. 2013. Clustering Large Probabilistic Graphs. IEEE TKDE, Vol. 25, 2 (2013), 325--336.","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_2_16_1","volume-title":"Proc. ACML Conf. 232--247","author":"Li Y.","unstructured":"Y. Li , X. Kong , C. Jia , and J. Li . 2018. Clustering Uncertain Graphs with Node Attributes . In Proc. ACML Conf. 232--247 . Y. Li, X. Kong, C. Jia, and J. Li. 2018. Clustering Uncertain Graphs with Node Attributes. In Proc. ACML Conf. 232--247."},{"key":"e_1_3_2_2_17_1","volume-title":"Proc. IEEE ICDM Conf. 459--468","author":"Liu L.","unstructured":"L. Liu , R. Jin , C. C. Aggarwal , and Y. Shen . 2012. Reliable Clustering on Uncertain Graphs . In Proc. IEEE ICDM Conf. 459--468 . L. Liu, R. Jin, C. C. Aggarwal, and Y. Shen. 2012. Reliable Clustering on Uncertain Graphs. In Proc. IEEE ICDM Conf. 459--468."},{"key":"e_1_3_2_2_18_1","volume-title":"Expert Systems","volume":"35","author":"Pandove D.","year":"2018","unstructured":"D. Pandove , S. Goel , and R. Rani . 2018. Correlation clustering methodologies and their fundamental results . Expert Systems , Vol. 35 , 1 ( 2018 ). D. Pandove, S. Goel, and R. Rani. 2018. Correlation clustering methodologies and their fundamental results. Expert Systems, Vol. 35, 1 (2018)."},{"key":"e_1_3_2_2_19_1","volume-title":"ACM TODS","volume":"40","author":"Parchas P.","year":"2015","unstructured":"P. Parchas , F. Gullo , D. Papadias , and F. Bonchi . 2015. Uncertain Graph Processing through Representative Instances . ACM TODS , Vol. 40 , 3 ( 2015 ), 20:1--20:39. P. Parchas, F. Gullo, D. Papadias, and F. Bonchi. 2015. Uncertain Graph Processing through Representative Instances. ACM TODS, Vol. 40, 3 (2015), 20:1--20:39."},{"key":"e_1_3_2_2_20_1","volume-title":"Proc. ACM-SIAM SODA Conf. 526--527","author":"Swamy C.","year":"2004","unstructured":"C. Swamy . 2004 . Correlation Clustering: maximizing agreements via semidefinite programming . In Proc. ACM-SIAM SODA Conf. 526--527 . C. Swamy. 2004. Correlation Clustering: maximizing agreements via semidefinite programming. In Proc. ACM-SIAM SODA Conf. 526--527."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.036115"}],"event":{"name":"KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event CA USA","acronym":"KDD '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403190","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394486.3403190","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:34Z","timestamp":1750195894000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403190"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,20]]},"references-count":21,"alternative-id":["10.1145\/3394486.3403190","10.1145\/3394486"],"URL":"https:\/\/doi.org\/10.1145\/3394486.3403190","relation":{},"subject":[],"published":{"date-parts":[[2020,8,20]]},"assertion":[{"value":"2020-08-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}