{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T04:40:00Z","timestamp":1740112800372,"version":"3.37.3"},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["110-2221-E-005-077"],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004946","name":"National Chung Hsing University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004946","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1016\/j.ins.2022.07.166","type":"journal-article","created":{"date-parts":[[2022,7,31]],"date-time":"2022-07-31T00:20:15Z","timestamp":1659226815000},"page":"204-214","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["r-Reference points based k-means algorithm"],"prefix":"10.1016","volume":"610","author":[{"given":"Ching-Lin","family":"Wang","sequence":"first","affiliation":[]},{"given":"Yung-Kuan","family":"Chan","sequence":"additional","affiliation":[]},{"given":"Shao-Wei","family":"Chu","sequence":"additional","affiliation":[]},{"given":"Shyr-Shen","family":"Yu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2022.07.166_b0005","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/j.ins.2021.10.048","article-title":"Adaptive explicit kernel Minkowski weighted K-means","volume":"584","author":"Aradnia","year":"2022","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2022.07.166_b0010","series-title":"In 19th SODA","first-page":"1027","article-title":"k-means++: the advantages of careful seeding","author":"Arthur","year":"2007"},{"issue":"1\u20133","key":"10.1016\/j.ins.2022.07.166_b0015","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0166-218X(01)00243-8","article-title":"Complexity of finding dense subgraphs","volume":"121","author":"Asahiro","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.ins.2022.07.166_b0020","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.ins.2019.05.035","article-title":"A survey on fake news and rumour detection techniques","volume":"497","author":"Bondielli","year":"2019","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2022.07.166_b0025","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.ins.2018.01.001","article-title":"A disease diagnosis and treatment recommendation system based on big data mining and cloud computing","volume":"435","author":"Chen","year":"2018","journal-title":"Inf. Sci."},{"issue":"4","key":"10.1016\/j.ins.2022.07.166_b0030","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1016\/j.ins.2010.10.008","article-title":"A time-efficient pattern reduction algorithm for k-means clustering","volume":"181","author":"Chiang","year":"2011","journal-title":"Inf. Sci."},{"issue":"14","key":"10.1016\/j.ins.2022.07.166_b0035","doi-asserted-by":"crossref","first-page":"1701","DOI":"10.1016\/j.patrec.2011.07.011","article-title":"A new algorithm for initial cluster centers in k-means algorithm","volume":"32","author":"Erisoglu","year":"2011","journal-title":"Pattern Recogn. Lett."},{"year":"1992","series-title":"Vector Quantization and Signal Compression","author":"Gersho","key":"10.1016\/j.ins.2022.07.166_b0040"},{"issue":"7","key":"10.1016\/j.ins.2022.07.166_b0045","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1109\/TPAMI.2002.1017616","article-title":"An efficient k-means clustering algorithm: analysis and implementation","volume":"24","author":"Kanungo","year":"2002","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"issue":"11","key":"10.1016\/j.ins.2022.07.166_b0050","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1016\/j.patcog.2009.02.014","article-title":"A fast k-means clustering algorithm using cluster center displacement","volume":"42","author":"Lai","year":"2009","journal-title":"Pattern Recognition"},{"key":"10.1016\/j.ins.2022.07.166_b0055","series-title":"MIT Lincoln Laboratory Project Report IDDE-1","first-page":"1999","article-title":"Guide to creating stealthy attacks for the, DARPA Off-line intrusion detection evaluation","author":"Lippmann","year":"1999"},{"issue":"2","key":"10.1016\/j.ins.2022.07.166_b0060","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/S0031-3203(02)00060-2","article-title":"The global K-means clustering algorithm","volume":"36","author":"Likas","year":"2003","journal-title":"Pattern Recogn."},{"key":"10.1016\/j.ins.2022.07.166_b0065","first-page":"360","article-title":"Network traffic classification using k-means clustering","author":"Munz","year":"2007","journal-title":"Second Internat. MultiSymp. Comput. Comput. Sci."},{"issue":"3","key":"10.1016\/j.ins.2022.07.166_b0070","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","article-title":"Data clustering: a review","volume":"31","author":"Murty","year":"1999","journal-title":"ACM Comput. Surv."},{"issue":"12","key":"10.1016\/j.ins.2022.07.166_b0075","first-page":"1","article-title":"A survey of clustering techniques","volume":"7","author":"Rai","year":"2010","journal-title":"Internat. J. Comput. Appl."},{"year":"2003","series-title":"Pattern Recognition","author":"Theodoridis","key":"10.1016\/j.ins.2022.07.166_b0080"},{"key":"10.1016\/j.ins.2022.07.166_b0085","series-title":"Proceedings of the 14th Annual Southeast Regional Conference, ACM, Birmingham, Alabama","first-page":"95","article-title":"A modification to the half-interval search (binary search) method","author":"Jr","year":"1976"},{"key":"10.1016\/j.ins.2022.07.166_b0090","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1016\/j.asoc.2017.08.032","article-title":"Two improved k-means algorithms","volume":"68","author":"Yu","year":"2018","journal-title":"Appl. Soft Comput."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025522008611?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025522008611?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T17:26:47Z","timestamp":1674149207000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025522008611"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":18,"alternative-id":["S0020025522008611"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2022.07.166","relation":{},"ISSN":["0020-0255"],"issn-type":[{"type":"print","value":"0020-0255"}],"subject":[],"published":{"date-parts":[[2022,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"r-Reference points based k-means algorithm","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2022.07.166","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}