{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:21Z","timestamp":1750220601601,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,8,12]],"date-time":"2020-08-12T00:00:00Z","timestamp":1597190400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,8,12]]},"DOI":"10.1145\/3410566.3410601","type":"proceedings-article","created":{"date-parts":[[2020,8,25]],"date-time":"2020-08-25T16:11:46Z","timestamp":1598371906000},"page":"1-9","source":"Crossref","is-referenced-by-count":0,"title":["Local connectivity in centroid clustering"],"prefix":"10.1145","author":[{"given":"Deepak","family":"P","sequence":"first","affiliation":[{"name":"Queen's University Belfast, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,8,25]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Savitha Abraham P Deepak and Sowmya Sundaram. 2020. Fairness in Clustering with Multiple Sensitive Attributes. In EDBT.  Savitha Abraham P Deepak and Sowmya Sundaram. 2020. Fairness in Clustering with Multiple Sensitive Attributes. In EDBT."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Mihael Ankerst Markus M Breunig Hans-Peter Kriegel and J\u00f6rg Sander. 1999. OPTICS: ordering points to identify the clustering structure. ACM Sigmod record 28 2 (1999) 49--60.  Mihael Ankerst Markus M Breunig Hans-Peter Kriegel and J\u00f6rg Sander. 1999. OPTICS: ordering points to identify the clustering structure. ACM Sigmod record 28 2 (1999) 49--60.","DOI":"10.1145\/304181.304187"},{"key":"e_1_3_2_1_3_1","unstructured":"Kasra Babaei ZhiYuan Chen and Tomas Maul. 2019. Detecting Point Outliers Using Prune-based Outlier Factor (PLOF). arXiv preprint arXiv:1911.01654 (2019).  Kasra Babaei ZhiYuan Chen and Tomas Maul. 2019. Detecting Point Outliers Using Prune-based Outlier Factor (PLOF). arXiv preprint arXiv:1911.01654 (2019)."},{"key":"e_1_3_2_1_4_1","unstructured":"Vipin Balachandran P Deepak and Deepak Khemani. 2012. Interpretable and reconfigurable clustering of document datasets by deriving word-based rules. Knowledge and information systems 32 3 (2012) 475--503.  Vipin Balachandran P Deepak and Deepak Khemani. 2012. Interpretable and reconfigurable clustering of document datasets by deriving word-based rules. Knowledge and information systems 32 3 (2012) 475--503."},{"key":"e_1_3_2_1_5_1","unstructured":"Suman Bera Deeparnab Chakrabarty Nicolas Flores and Maryam Negahbani. 2019. Fair algorithms for clustering. In Advances in Neural Information Processing Systems. 4955--4966.  Suman Bera Deeparnab Chakrabarty Nicolas Flores and Maryam Negahbani. 2019. Fair algorithms for clustering. In Advances in Neural Information Processing Systems. 4955--4966."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3351095.3372864"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335388"},{"key":"e_1_3_2_1_8_1","unstructured":"Xingyu Chen Brandon Fain Charles Lyu and Kamesh Munagala. 2019. Proportionally Fair Clustering. In ICML.  Xingyu Chen Brandon Fain Charles Lyu and Kamesh Munagala. 2019. Proportionally Fair Clustering. In ICML."},{"key":"e_1_3_2_1_9_1","unstructured":"Flavio Chierichetti Ravi Kumar Silvio Lattanzi and Sergei Vassilvitskii. 2017. Fair clustering through fairlets. In NIPS. 5029--5037.  Flavio Chierichetti Ravi Kumar Silvio Lattanzi and Sergei Vassilvitskii. 2017. Fair clustering through fairlets. In NIPS. 5029--5037."},{"key":"e_1_3_2_1_10_1","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume":"96","author":"Ester Martin","year":"1996","journal-title":"Kdd"},{"key":"e_1_3_2_1_11_1","unstructured":"Anil K Jain. 2010. Data clustering: 50 years beyond K-means. Pattern recognition letters 31 8 (2010) 651--666.  Anil K Jain. 2010. Data clustering: 50 years beyond K-means. Pattern recognition letters 31 8 (2010) 651--666."},{"key":"e_1_3_2_1_12_1","unstructured":"Anil K Jain M Narasimha Murty and Patrick J Flynn. 1999. Data clustering: a review. ACM computing surveys (CSUR) 31 3 (1999) 264--323.  Anil K Jain M Narasimha Murty and Patrick J Flynn. 1999. Data clustering: a review. ACM computing surveys (CSUR) 31 3 (1999) 264--323."},{"key":"e_1_3_2_1_13_1","unstructured":"Rawls John. 1971. A theory of justice. (1971).  Rawls John. 1971. A theory of justice. (1971)."},{"key":"e_1_3_2_1_14_1","unstructured":"Jihwan Lee and Nam-Wook Cho. 2016. Fast outlier detection using a grid-based algorithm. PloS one 11 11 (2016).  Jihwan Lee and Nam-Wook Cho. 2016. Fast outlier detection using a grid-based algorithm. PloS one 11 11 (2016)."},{"key":"e_1_3_2_1_15_1","article-title":"How to Include Ethics in Machine Learning Research","volume":"116","author":"Loi Michele","year":"2019","journal-title":"ERCIM News"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the fifth Berkeley symposium on mathematical statistics and probability","volume":"1","author":"MacQueen James","year":"1967"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Fionn Murtagh. 1983. A survey of recent advances in hierarchical clustering algorithms. The computer journal 26 4 (1983) 354--359.  Fionn Murtagh. 1983. A survey of recent advances in hierarchical clustering algorithms. The computer journal 26 4 (1983) 354--359.","DOI":"10.1093\/comjnl\/26.4.354"},{"volume-title":"AI for Social Good Workshop. Harvard CRCS.","year":"2020","author":"Deepak","key":"e_1_3_2_1_18_1"},{"key":"e_1_3_2_1_19_1","unstructured":"Deepak P and Savitha Sam Abraham. 2020. Representativity Fairness in Clustering. In ACM Web Science.  Deepak P and Savitha Sam Abraham. 2020. Representativity Fairness in Clustering. In ACM Web Science."},{"key":"e_1_3_2_1_20_1","unstructured":"Leonard KAUFMAN Peter J RDUSSEEUN. 1987. Clustering by means of medoids. (1987).  Leonard KAUFMAN Peter J RDUSSEEUN. 1987. Clustering by means of medoids. (1987)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3068335"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021841728075"}],"event":{"name":"IDEAS 2020: 24th International Database Engineering & Applications Symposium","acronym":"IDEAS 2020","location":"Seoul Republic of Korea"},"container-title":["Proceedings of the 24th Symposium on International Database Engineering & Applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3410566.3410601","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3410566.3410601","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:32:00Z","timestamp":1750195920000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3410566.3410601"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,12]]},"references-count":23,"alternative-id":["10.1145\/3410566.3410601","10.1145\/3410566"],"URL":"https:\/\/doi.org\/10.1145\/3410566.3410601","relation":{},"subject":[],"published":{"date-parts":[[2020,8,12]]}}}