{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T15:13:32Z","timestamp":1761664412414,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T00:00:00Z","timestamp":1642723200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61973180, 61773384, U1806201, 61671261"],"award-info":[{"award-number":["61973180, 61773384, U1806201, 61671261"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"e Natural Science Foundation of Shandong Province, China","award":["ZR2018MF007"],"award-info":[{"award-number":["ZR2018MF007"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,1,21]]},"DOI":"10.1145\/3520084.3520106","type":"proceedings-article","created":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T23:40:54Z","timestamp":1650325254000},"page":"138-143","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Initial Seeds Selection for K-means Clustering Based on Outlier Detection"],"prefix":"10.1145","author":[{"given":"Zhiyong","family":"Yang","sequence":"first","affiliation":[{"name":"Qingdao University of Science and Technology, China"}]},{"given":"Feng","family":"Jiang","sequence":"additional","affiliation":[{"name":"Qingdao University of Science and Technology, China"}]},{"given":"Xu","family":"Yu","sequence":"additional","affiliation":[{"name":"Qingdao University of Science and Technology, China"}]},{"given":"Junwei","family":"Du","sequence":"additional","affiliation":[{"name":"Qingdao University of Science and Technology, China"}]}],"member":"320","published-online":{"date-parts":[[2022,4,18]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Francesco Masulli and Stefano Rovetta","author":"Filippone Maurizio","year":"2008","unstructured":"Maurizio Filippone , Francesco Camastra , Francesco Masulli and Stefano Rovetta . 2008 . A survey of kernel and spectral methods for clustering. Pattern recognition 41, 1 (January 2008), 176-190. https:\/\/doi.org\/10.1016\/j.patcog.2007.05.018 10.1016\/j.patcog.2007.05.018 Maurizio Filippone, Francesco Camastra, Francesco Masulli and Stefano Rovetta. 2008. A survey of kernel and spectral methods for clustering. Pattern recognition 41, 1 (January 2008), 176-190. https:\/\/doi.org\/10.1016\/j.patcog.2007.05.018"},{"key":"e_1_3_2_1_2_1","volume-title":"Vela","author":"EmreCelebi M.","year":"2013","unstructured":"M. EmreCelebi , Hassan A. Kingravi and Patricio A . Vela . 2013 . A comparative study of efficient initialization methods for the k-means clustering algorithm. Expert systems with applications 40, 1 (January 2013), 200-210. https:\/\/doi.org\/10.1016\/j.eswa.2012.07.021 10.1016\/j.eswa.2012.07.021 M. EmreCelebi, Hassan A.Kingravi and Patricio A.Vela. 2013. A comparative study of efficient initialization methods for the k-means clustering algorithm. Expert systems with applications 40, 1 (January 2013), 200-210. https:\/\/doi.org\/10.1016\/j.eswa.2012.07.021"},{"key":"e_1_3_2_1_3_1","first-page":"281","volume-title":"Proceedings of the 5th Berkeley symposium on mathematical statistics and probability","author":"MacQueen J","year":"1967","unstructured":"J MacQueen . 1967 . Some methods for classification and analysis of multivariate observations . In Proceedings of the 5th Berkeley symposium on mathematical statistics and probability . Berkeley, CA , 281 - 297 . J MacQueen. 1967. Some methods for classification and analysis of multivariate observations. In Proceedings of the 5th Berkeley symposium on mathematical statistics and probability. Berkeley, CA, 281-297."},{"key":"e_1_3_2_1_4_1","first-page":"2","article-title":"Initializing K-means clustering by bootstrap and data depth","volume":"38","author":"Torrente Aurora","year":"2020","unstructured":"Aurora Torrente and Juan Romo . 2020 . Initializing K-means clustering by bootstrap and data depth . Journal of Classification 38 , 2 (July 2020), 232-256. https:\/\/doi.org\/10.1007\/s00357-020-09372-3 10.1007\/s00357-020-09372-3 Aurora Torrente and Juan Romo. 2020. Initializing K-means clustering by bootstrap and data depth. Journal of Classification 38, 2 (July 2020), 232-256. https:\/\/doi.org\/10.1007\/s00357-020-09372-3","journal-title":"Journal of Classification"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.3390\/e22080902"},{"key":"e_1_3_2_1_6_1","volume-title":"Rama Mohan Reddy","author":"Mahesh Kumar K.","year":"2017","unstructured":"K. Mahesh Kumar and A. Rama Mohan Reddy . 2017 . An efficient k-means clustering filtering algorithm using density based initial cluster centers. Information Sciences 418-419, (December 2017), 286-301. https:\/\/doi.org\/10.1016\/j.ins.2017.07.036 10.1016\/j.ins.2017.07.036 K. Mahesh Kumar and A. Rama Mohan Reddy. 2017. An efficient k-means clustering filtering algorithm using density based initial cluster centers. Information Sciences 418-419, (December 2017), 286-301. https:\/\/doi.org\/10.1016\/j.ins.2017.07.036"},{"key":"e_1_3_2_1_7_1","first-page":"12","article-title":"An entropy-based initialization method of K-means clustering on the optimal number of clusters","volume":"33","author":"Chowdhury Kuntal","year":"2020","unstructured":"Kuntal Chowdhury , Debasis Chaudhuri and Arup K Pal . 2020 . An entropy-based initialization method of K-means clustering on the optimal number of clusters . Neural Computing and Applications 33 , 12 (November 2020), 6965-6982. https:\/\/doi.org\/10.1007\/s00521-020-05471-9 10.1007\/s00521-020-05471-9 Kuntal Chowdhury, Debasis Chaudhuri and Arup K Pal. 2020. An entropy-based initialization method of K-means clustering on the optimal number of clusters. Neural Computing and Applications 33, 12 (November 2020), 6965-6982. https:\/\/doi.org\/10.1007\/s00521-020-05471-9","journal-title":"Neural Computing and Applications"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxab078"},{"key":"e_1_3_2_1_9_1","first-page":"1027 1027","volume-title":"Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms","author":"Arthur David","year":"2007","unstructured":"David Arthur and Sergei Vassilvitskii . 2007 . k-means++: The advantages of careful seeding . In: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms , pp. 1027 - 1035 . Louisiana, USA , 1027 - 1035 . David Arthur and Sergei Vassilvitskii. 2007. k-means++: The advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 1027-1035. Louisiana, USA, 1027-1035."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-2007-11402"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.04.013"},{"key":"e_1_3_2_1_12_1","first-page":"392","volume-title":"Proceedings of the 24rd International Conference on Very Large Data Bases","author":"Edwin","unstructured":"Edwin M. Knorr and Raymond T. Ng. 1998. Algorithms for mining distance-based outliers in large datasets . In Proceedings of the 24rd International Conference on Very Large Data Bases . New York, USA , 392 - 403 . Edwin M. Knorr and Raymond T. Ng. 1998. Algorithms for mining distance-based outliers in large datasets. In Proceedings of the 24rd International Conference on Very Large Data Bases. New York, USA, 392-403."},{"key":"e_1_3_2_1_13_1","first-page":"3","article-title":"A quick attribute reduction algorithm with complexity of max(O(|C||U|), O(|C|2 |U\/C|))","volume":"29","author":"Xu Zhangyan","year":"2003","unstructured":"Zhangyan Xu , Zuopeng Liu , Bingru Yang , Wei Song . 2003 . A quick attribute reduction algorithm with complexity of max(O(|C||U|), O(|C|2 |U\/C|)) . Chinese Journal of Computers 29 , 3 (March 2003), 391-399. Zhangyan Xu, Zuopeng Liu, Bingru Yang, Wei Song. 2003. A quick attribute reduction algorithm with complexity of max(O(|C||U|), O(|C|2 |U\/C|)). Chinese Journal of Computers 29, 3 (March 2003), 391-399.","journal-title":"Chinese Journal of Computers"},{"key":"e_1_3_2_1_14_1","volume-title":"Youqiang Zhang and YouqiangZhang","author":"Jiang Feng","year":"2021","unstructured":"Feng Jiang , Xu Yu , Junwei Du , Dunwei Gong , Youqiang Zhang and YouqiangZhang . 2021 . Ensemble learning based on approximate reducts and bootstrap sampling. Information Sciences 547, (February 2021), 797-813. https:\/\/doi.org\/10.1016\/j.ins.2020.08.069 10.1016\/j.ins.2020.08.069 Feng Jiang, Xu Yu, Junwei Du, Dunwei Gong, Youqiang Zhang and YouqiangZhang. 2021. Ensemble learning based on approximate reducts and bootstrap sampling. Information Sciences 547, (February 2021), 797-813. https:\/\/doi.org\/10.1016\/j.ins.2020.08.069"},{"key":"e_1_3_2_1_15_1","volume-title":"Computer Science, (November","author":"Dolatshah Mohamad","year":"2015","unstructured":"Mohamad Dolatshah , Ali Hadian and Behrouz Minaei-Bidgoli : Ball*-tree: Efficient spatial indexing for constrained nearest-neighbor search in metric spaces . Computer Science, (November 2015 ), arXiv:1511.00628. Mohamad Dolatshah, Ali Hadian and Behrouz Minaei-Bidgoli: Ball*-tree: Efficient spatial indexing for constrained nearest-neighbor search in metric spaces. Computer Science, (November 2015), arXiv:1511.00628."},{"volume-title":"Rough sets: Theoretical aspects of reasoning about data","author":"Zdzislaw Pawlak","key":"e_1_3_2_1_16_1","unstructured":"Pawlak Zdzislaw . 1991. Rough sets: Theoretical aspects of reasoning about data . Kluwer Academic Publishers . Dordrecht, Holland. Pawlak Zdzislaw. 1991. Rough sets: Theoretical aspects of reasoning about data. Kluwer Academic Publishers. Dordrecht, Holland."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488508005121"},{"key":"e_1_3_2_1_18_1","volume-title":"Deyu Tang and Zhen Liu","author":"Zhao Jie","year":"2020","unstructured":"Jie Zhao , Jiaming Liang , Zhenning Dong , Deyu Tang and Zhen Liu . 2020 . Accelerating information entropy-based feature selection using rough set theory with classified nested equivalence classes. Pattern Recognition 107, (November 2020), 107517. https:\/\/doi.org\/10.1016\/j.patcog.2020.107517 10.1016\/j.patcog.2020.107517 Jie Zhao, Jiaming Liang, Zhenning Dong, Deyu Tang and Zhen Liu. 2020. Accelerating information entropy-based feature selection using rough set theory with classified nested equivalence classes. Pattern Recognition 107, (November 2020), 107517. https:\/\/doi.org\/10.1016\/j.patcog.2020.107517"},{"key":"e_1_3_2_1_19_1","first-page":"2","article-title":"Three-way weighted combination-entropies based on three-layer granular structures","volume":"2","author":"Wang Jun","year":"2017","unstructured":"Jun Wang , Lingyu Tang , Xianyong Zhang and Yuyan Luo . 2017 . Three-way weighted combination-entropies based on three-layer granular structures . Applied Mathematics and Nonlinear Sciences 2 , 2 (July 2017), 329-340. https:\/\/doi.org\/10.21042\/AMNS.2017.2.00027 10.21042\/AMNS.2017.2.00027 Jun Wang, Lingyu Tang, Xianyong Zhang and Yuyan Luo. 2017. Three-way weighted combination-entropies based on three-layer granular structures. Applied Mathematics and Nonlinear Sciences 2, 2 (July 2017), 329-340. https:\/\/doi.org\/10.21042\/AMNS.2017.2.00027","journal-title":"Applied Mathematics and Nonlinear Sciences"},{"key":"e_1_3_2_1_20_1","first-page":"1","article-title":"The calculation of knowledge granulation and its application","volume":"22","author":"Miao Duoqian","year":"2002","unstructured":"Duoqian Miao and Shidong Fan . 2002 . The calculation of knowledge granulation and its application . Systems Engineering-Theory & Practice 22 , 1 (January 2002), 48-56. Duoqian Miao and Shidong Fan. 2002. The calculation of knowledge granulation and its application. Systems Engineering-Theory & Practice 22, 1 (January 2002), 48-56.","journal-title":"Systems Engineering-Theory & Practice"},{"key":"e_1_3_2_1_21_1","volume-title":"Zeng Yu and Bin Wang","author":"Jing Yunge","year":"2017","unstructured":"Yunge Jing , Tianrui Li , Hamido Fujita , Zeng Yu and Bin Wang . 2017 . An incremental attribute reduction approach based on knowledge granularity with a multi-granulation view. Information Sciences 411, (October 2017), 23-38. https:\/\/doi.org\/10.1016\/j.ins.2017.05.003 10.1016\/j.ins.2017.05.003 Yunge Jing, Tianrui Li, Hamido Fujita, Zeng Yu and Bin Wang. 2017. An incremental attribute reduction approach based on knowledge granularity with a multi-granulation view. Information Sciences 411, (October 2017), 23-38. https:\/\/doi.org\/10.1016\/j.ins.2017.05.003"},{"key":"e_1_3_2_1_22_1","first-page":"01254","volume-title":"International Journal of Machine Learning and Cybernetics, (January","author":"Liu Guilong","year":"2021","unstructured":"Guilong Liu and Guilong Liu . 2021 . Knowledge granularity reduction for decision tables . International Journal of Machine Learning and Cybernetics, (January 2021). https:\/\/doi.org\/10.1007\/s13042-020- 01254 - 01259 10.1007\/s13042-020-01254-9 Guilong Liu and Guilong Liu. 2021. Knowledge granularity reduction for decision tables. International Journal of Machine Learning and Cybernetics, (January 2021). https:\/\/doi.org\/10.1007\/s13042-020-01254-9"},{"key":"e_1_3_2_1_23_1","volume-title":"UCI machine learning repository","author":"Bache","year":"2013","unstructured":"Bache K and Lichman M . UCI machine learning repository , 2013 , http:\/\/archive.ics.uci. edu\/ml. Bache K and Lichman M. UCI machine learning repository, 2013, http:\/\/archive.ics.uci. edu\/ml."}],"event":{"name":"ICSIM 2022: 2022 The 5th International Conference on Software Engineering and Information Management","acronym":"ICSIM 2022","location":"Yokohama Japan"},"container-title":["2022 The 5th International Conference on Software Engineering and Information Management (ICSIM)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3520084.3520106","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3520084.3520106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:31Z","timestamp":1750183831000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3520084.3520106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,21]]},"references-count":23,"alternative-id":["10.1145\/3520084.3520106","10.1145\/3520084"],"URL":"https:\/\/doi.org\/10.1145\/3520084.3520106","relation":{},"subject":[],"published":{"date-parts":[[2022,1,21]]},"assertion":[{"value":"2022-04-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}