{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T14:04:27Z","timestamp":1774533867010,"version":"3.50.1"},"reference-count":18,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T00:00:00Z","timestamp":1585526400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key R&D Program of China","award":["2017YFC0822604-2"],"award-info":[{"award-number":["2017YFC0822604-2"]}]},{"name":"National Key R&D Program of China","award":["2017GABJC09"],"award-info":[{"award-number":["2017GABJC09"]}]},{"name":"National Key R&D Program of China","award":["2018060"],"award-info":[{"award-number":["2018060"]}]},{"DOI":"10.13039\/501100010868","name":"Ministry of Public Security of the People's Republic of China","doi-asserted-by":"publisher","award":["2017YFC0822604-2"],"award-info":[{"award-number":["2017YFC0822604-2"]}],"id":[{"id":"10.13039\/501100010868","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010868","name":"Ministry of Public Security of the People's Republic of China","doi-asserted-by":"publisher","award":["2017GABJC09"],"award-info":[{"award-number":["2017GABJC09"]}],"id":[{"id":"10.13039\/501100010868","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010868","name":"Ministry of Public Security of the People's Republic of China","doi-asserted-by":"publisher","award":["2018060"],"award-info":[{"award-number":["2018060"]}],"id":[{"id":"10.13039\/501100010868","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009019","name":"Shenzhen University","doi-asserted-by":"publisher","award":["2017YFC0822604-2"],"award-info":[{"award-number":["2017YFC0822604-2"]}],"id":[{"id":"10.13039\/501100009019","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009019","name":"Shenzhen University","doi-asserted-by":"publisher","award":["2017GABJC09"],"award-info":[{"award-number":["2017GABJC09"]}],"id":[{"id":"10.13039\/501100009019","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009019","name":"Shenzhen University","doi-asserted-by":"publisher","award":["2018060"],"award-info":[{"award-number":["2018060"]}],"id":[{"id":"10.13039\/501100009019","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2020,3,30]]},"abstract":"<jats:p>The <jats:italic>k<\/jats:italic>-means algorithm is sensitive to the outliers. In this paper, we propose a robust two-stage <jats:italic>k<\/jats:italic>-means clustering algorithm based on the observation point mechanism, which can accurately discover the cluster centers without the disturbance of outliers. In the first stage, a small subset of the original data set is selected based on a set of nondegenerate observation points. The subset is a good representation of the original data set because it only contains all those points that have a higher density of the original data set and does not include the outliers. In the second stage, we use the <jats:italic>k<\/jats:italic>-means clustering algorithm to cluster the selected subset and find the proper cluster centers as the true cluster centers of the original data set. Based on these cluster centers, the rest data points of the original data set are assigned to the clusters whose centers are the closest to the data points. The theoretical analysis and experimental results show that the proposed clustering algorithm has the lower computational complexity and better robustness in comparison with <jats:italic>k<\/jats:italic>-means clustering algorithm, thus demonstrating the feasibility and effectiveness of our proposed clustering algorithm.<\/jats:p>","DOI":"10.1155\/2020\/3650926","type":"journal-article","created":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T23:31:27Z","timestamp":1585611087000},"page":"1-11","source":"Crossref","is-referenced-by-count":14,"title":["A Robust <i>k<\/i>-Means Clustering Algorithm Based on Observation Point Mechanism"],"prefix":"10.1155","volume":"2020","author":[{"given":"Xiaoliang","family":"Zhang","sequence":"first","affiliation":[{"name":"College of Computer Science & Software Engineering, Shenzhen University, Shenzhen 518060, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3415-0686","authenticated-orcid":true,"given":"Yulin","family":"He","sequence":"additional","affiliation":[{"name":"College of Computer Science & Software Engineering, Shenzhen University, Shenzhen 518060, China"},{"name":"National Engineering Laboratory for Big Data System Computing Technology, Shenzhen University, Shenzhen 518060, China"},{"name":"Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ), Shenzhen University, Shenzhen 518060, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Jin","sequence":"additional","affiliation":[{"name":"Department of Trace Inspection Technology, Criminal Investigation Police University of China, Shenyang 110854, China"},{"name":"Key Laboratory of Trace Inspection and Identification Technology of The Ministry of Public Security, Shenyang 110854, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Honglian","family":"Qin","sequence":"additional","affiliation":[{"name":"College of Computer Science & Software Engineering, Shenzhen University, Shenzhen 518060, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhammad","family":"Azhar","sequence":"additional","affiliation":[{"name":"College of Computer Science & Software Engineering, Shenzhen University, Shenzhen 518060, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joshua Zhexue","family":"Huang","sequence":"additional","affiliation":[{"name":"College of Computer Science & Software Engineering, Shenzhen University, Shenzhen 518060, China"},{"name":"National Engineering Laboratory for Big Data System Computing Technology, Shenzhen University, Shenzhen 518060, China"},{"name":"Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ), Shenzhen University, Shenzhen 518060, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"2","first-page":"768","volume":"21","year":"1965","journal-title":"Biometrics"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/tit.1982.1056489"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1101\/gr.9.11.1093"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/2733381"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.11.005"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-019-0205-4"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1023\/a:1009769707641"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2002.1033770"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.01.039"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44681-8_46"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/3068335"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-019-0091-y"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.07.034"},{"issue":"8","key":"19","first-page":"1669","volume":"45","year":"2014","journal-title":"IEEE Transactions on Cybernetics"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2903410"},{"key":"22","year":"2013"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.2991\/ijcis.10.1.82"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/tii.2019.2912723"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/3650926.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/3650926.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/3650926.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T23:31:31Z","timestamp":1585611091000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2020\/3650926\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,30]]},"references-count":18,"alternative-id":["3650926","3650926"],"URL":"https:\/\/doi.org\/10.1155\/2020\/3650926","relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,30]]}}}