{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:07Z","timestamp":1750220287589,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T00:00:00Z","timestamp":1645142400000},"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":[[2022,2,18]]},"DOI":"10.1145\/3529836.3529860","type":"proceedings-article","created":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T20:27:55Z","timestamp":1655843275000},"page":"160-164","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Junction density based clustering algorithm for data with arbitrary shapes"],"prefix":"10.1145","author":[{"given":"Ruijia","family":"Li","sequence":"first","affiliation":[{"name":"Institute of Fundamental and Frontier Sciences, University of Electronic Science and Technology of China, China"}]},{"given":"Zhiling","family":"Cai","sequence":"additional","affiliation":[{"name":"Institute of Fundamental and Frontier Sciences, University of Electronic Science and Technology of China, China"}]},{"given":"Hong","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, University of Electronic Science and Technology of China, China"}]}],"member":"320","published-online":{"date-parts":[[2022,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Norbert Beckmann Hans-Peter Kriegel Ralf Schneider and Bernhard Seeger. 1990. The R*-tree: An efficient and robust access method for points and rectangles. In SIGMOD.  Norbert Beckmann Hans-Peter Kriegel Ralf Schneider and Bernhard Seeger. 1990. The R*-tree: An efficient and robust access method for points and rectangles. In SIGMOD.","DOI":"10.1145\/93597.98741"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.198"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.08.048"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107624"},{"key":"e_1_3_2_1_5_1","unstructured":"Dheeru Dua and Casey Graff. 2017. UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml  Dheeru Dua and Casey Graff. 2017. UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Levent Ert\u00f6z Michael Steinbach and Vipin Kumar. 2003. Finding Clusters of Different Sizes Shapes and Densities in Noisy High Dimensional Data. In SDM.  Levent Ert\u00f6z Michael Steinbach and Vipin Kumar. 2003. Finding Clusters of Different Sizes Shapes and Densities in Noisy High Dimensional Data. In SDM.","DOI":"10.1137\/1.9781611972733.5"},{"key":"e_1_3_2_1_7_1","unstructured":"Martin Ester Hans-Peter Kriegel J\u00f6rg Sander and Xiaowei Xu. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In KDD.  Martin Ester Hans-Peter Kriegel J\u00f6rg Sander and Xiaowei Xu. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In KDD."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Pasi Fr\u00e4nti and Sami Sieranoja. 2018. K-means properties on six clustering benchmark datasets. Appl. Intell. (2018).  Pasi Fr\u00e4nti and Sami Sieranoja. 2018. K-means properties on six clustering benchmark datasets. Appl. Intell. (2018).","DOI":"10.1007\/s10489-018-1238-7"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-020-01068-9"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.781637"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2016.03.008"},{"key":"e_1_3_2_1_13_1","unstructured":"Peng Li and Haibin Xie. 2022. Two-stage clustering algorithm based on evolution and propagation patterns. Appl. Intell. (2022).  Peng Li and Haibin Xie. 2022. Two-stage clustering algorithm based on evolution and propagation patterns. Appl. Intell. (2022)."},{"key":"e_1_3_2_1_14_1","unstructured":"Ruijia Li and Zhiling Cai. 2022. A clustering algorithm based on density decreased chain for data with arbitrary shapes and densities. Appl. Intell. (2022).  Ruijia Li and Zhiling Cai. 2022. A clustering algorithm based on density decreased chain for data with arbitrary shapes and densities. Appl. Intell. (2022)."},{"key":"e_1_3_2_1_15_1","volume-title":"Local gap density for clustering high-dimensional data with varying densities. Knowl.-Based Syst. 184, 104905","author":"Li Ruijia","year":"2019","unstructured":"Ruijia Li , Xiaofei Yang , Xiaolong Qin , and William Zhu . 2019. Local gap density for clustering high-dimensional data with varying densities. Knowl.-Based Syst. 184, 104905 ( 2019 ). Ruijia Li, Xiaofei Yang, Xiaolong Qin, and William Zhu. 2019. Local gap density for clustering high-dimensional data with varying densities. Knowl.-Based Syst. 184, 104905 (2019)."},{"volume-title":"Rough sets: Theoretical aspects of reasoning about data","author":"Pawlak Zdzislaw","key":"e_1_3_2_1_16_1","unstructured":"Zdzislaw Pawlak . 1991. Rough sets: Theoretical aspects of reasoning about data . Springer . Zdzislaw Pawlak. 1991. Rough sets: Theoretical aspects of reasoning about data. Springer."},{"key":"e_1_3_2_1_17_1","volume-title":"Clustering by fast search and find of density peaks. Science 344, 6191","author":"Rodriguez Alex","year":"2014","unstructured":"Alex Rodriguez and Alessandro Laio . 2014. Clustering by fast search and find of density peaks. Science 344, 6191 ( 2014 ), 1492\u20131496. Alex Rodriguez and Alessandro Laio. 2014. Clustering by fast search and find of density peaks. Science 344, 6191 (2014), 1492\u20131496."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1700770114"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-021-01284-x"},{"key":"e_1_3_2_1_20_1","unstructured":"Zhuolin Tan Anyong Qin Yongqing Sun and Yuan\u00a0Yan Tang. 2021. Distribution Preserving Deep Semi-Nonnegative Matrix Factorization. In SMC.  Zhuolin Tan Anyong Qin Yongqing Sun and Yuan\u00a0Yan Tang. 2021. Distribution Preserving Deep Semi-Nonnegative Matrix Factorization. In SMC."},{"key":"e_1_3_2_1_21_1","first-page":"2579","article-title":"Visualizing data using t-SNE","volume":"9","author":"Maaten Laurens Van\u00a0der","year":"2008","unstructured":"Laurens Van\u00a0der Maaten and Geoffrey Hinton . 2008 . Visualizing data using t-SNE . J. Mach. Learn. Res. 9 , 11 (2008), 2579 \u2013 2605 . Laurens Van\u00a0der Maaten and Geoffrey Hinton. 2008. Visualizing data using t-SNE. J. Mach. Learn. Res. 9, 11 (2008), 2579\u20132605.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.08.008"},{"key":"e_1_3_2_1_23_1","volume-title":"Multigraph Random Walk for Joint Learning of Multiview Clustering and Semisupervised Classification","author":"Wang Shiping","year":"2021","unstructured":"Shiping Wang , Lele Fu , Zhewen Wang , Haiping Xu , and William Zhu . 2021. Multigraph Random Walk for Joint Learning of Multiview Clustering and Semisupervised Classification . IEEE Transactions on Computational Social Systems ( 2021 ). Shiping Wang, Lele Fu, Zhewen Wang, Haiping Xu, and William Zhu. 2021. Multigraph Random Walk for Joint Learning of Multiview Clustering and Semisupervised Classification. IEEE Transactions on Computational Social Systems (2021)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.06.069"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2016.2628747"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108177"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2021.104396"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(03)00056-2"},{"key":"e_1_3_2_1_29_1","unstructured":"Xiang Zhu Zhiling Cai Ziniu Yu Junliang Wu and William Zhu. 2022. Fast spectral clustering with self-weighted features. J. Nonlinear Var. Anal.(2022).  Xiang Zhu Zhiling Cai Ziniu Yu Junliang Wu and William Zhu. 2022. Fast spectral clustering with self-weighted features. J. Nonlinear Var. Anal.(2022)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.107977"}],"event":{"name":"ICMLC 2022: 2022 14th International Conference on Machine Learning and Computing","acronym":"ICMLC 2022","location":"Guangzhou China"},"container-title":["2022 14th International Conference on Machine Learning and Computing (ICMLC)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3529836.3529860","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3529836.3529860","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:25Z","timestamp":1750188685000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3529836.3529860"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,18]]},"references-count":30,"alternative-id":["10.1145\/3529836.3529860","10.1145\/3529836"],"URL":"https:\/\/doi.org\/10.1145\/3529836.3529860","relation":{},"subject":[],"published":{"date-parts":[[2022,2,18]]},"assertion":[{"value":"2022-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}