{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T19:14:41Z","timestamp":1784661281792,"version":"3.55.0"},"reference-count":41,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Pattern Recognition"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1016\/j.patcog.2018.02.015","type":"journal-article","created":{"date-parts":[[2018,2,17]],"date-time":"2018-02-17T23:12:37Z","timestamp":1518909157000},"page":"402-413","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":122,"special_numbering":"C","title":["I-k-means\u2212+: An iterative clustering algorithm based on an enhanced version of the k-means"],"prefix":"10.1016","volume":"79","author":[{"given":"Hassan","family":"Ismkhan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.patcog.2018.02.015_bib0001","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.knosys.2013.05.003","article-title":"A sample-based hierarchical adaptive k-means clustering method for large-scale video retrieval","volume":"49","author":"Liao","year":"2013","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.patcog.2018.02.015_sbref0002","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1016\/j.asoc.2016.01.040","article-title":"Rough possibilistic type-2 fuzzy C-means clustering for MR brain image segmentation","volume":"46","author":"Sarkar","year":"2016","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"10.1016\/j.patcog.2018.02.015_bib0003","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/j.patcog.2007.06.006","article-title":"Accurate integration of multi-view range images using k-means clustering","volume":"41","author":"Zhou","year":"2008","journal-title":"Pattern Recognit."},{"issue":"5","key":"10.1016\/j.patcog.2018.02.015_bib0004","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1016\/S0031-3203(01)00105-4","article-title":"Extraction of major object features using VQ clustering for content-based image retrieval","volume":"35","author":"Yoo","year":"2002","journal-title":"Pattern Recognit."},{"issue":"3","key":"10.1016\/j.patcog.2018.02.015_bib0005","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1007\/s10618-008-0123-0","article-title":"Harmony k-means algorithm for document clustering","volume":"18","author":"Mahdavi","year":"2009","journal-title":"Data Min. Knowl. Discov."},{"key":"10.1016\/j.patcog.2018.02.015_bib0006","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1016\/j.asoc.2015.05.017","article-title":"Paraphrase Extraction using fuzzy hierarchical clustering","volume":"34","author":"Chitra","year":"2015","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"10.1016\/j.patcog.2018.02.015_bib0007","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1016\/j.asoc.2011.11.008","article-title":"eXploratory k-means: a new simple and efficient algorithm for gene clustering","volume":"12","author":"Lam","year":"2012","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.patcog.2018.02.015_bib0008","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.asoc.2015.06.015","article-title":"Cancer classification using a novel gene selection approach by means of shuffling based on data clustering with optimization","volume":"35","author":"Elyasigomari","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.patcog.2018.02.015_bib0009","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/j.asoc.2015.11.044","article-title":"DUCF: distributed load balancing unequal clustering in wireless sensor networks using fuzzy approach","volume":"40","author":"Baranidharan","year":"2016","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"10.1016\/j.patcog.2018.02.015_bib0010","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1016\/j.engappai.2012.01.003","article-title":"A new blockmodeling based hierarchical clustering algorithm for web social networks","volume":"25","author":"Qiao","year":"2012","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"10","key":"10.1016\/j.patcog.2018.02.015_bib0011","doi-asserted-by":"crossref","first-page":"870","DOI":"10.1016\/j.patrec.2009.04.001","article-title":"An online document clustering technique for short web contents","volume":"30","author":"Carullo","year":"2009","journal-title":"Pattern Recognit. Lett."},{"issue":"18","key":"10.1016\/j.patcog.2018.02.015_bib0012","doi-asserted-by":"crossref","first-page":"3816","DOI":"10.1016\/j.ins.2011.04.052","article-title":"A spectral analysis approach to document summarization: clustering and ranking sentences simultaneously","volume":"181","author":"Cai","year":"2011","journal-title":"Inf. Sci."},{"key":"10.1016\/j.patcog.2018.02.015_bib0013","series-title":"Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, Portland, Oregon","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","author":"Ester","year":"1996"},{"key":"10.1016\/j.patcog.2018.02.015_bib0014","series-title":"Proceedings of the ACM SIGMOD Conference","article-title":"CURE: An efficient clustering algorithm for large data sets","author":"Guha","year":"1998"},{"issue":"8","key":"10.1016\/j.patcog.2018.02.015_bib0015","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/2.781637","article-title":"Chameleon: hierarchical clustering using dynamic modeling","volume":"32","author":"Karypis","year":"1999","journal-title":"Computer"},{"key":"10.1016\/j.patcog.2018.02.015_bib0016","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/j.patcog.2016.12.027","article-title":"k-MS: a novel clustering algorithm based on morphological reconstruction","volume":"66","author":"Rodrigues","year":"2017","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2018.02.015_bib0017","series-title":"Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, California","article-title":"Some methods for classification and analysis of multivariate observations","author":"MacQueen","year":"1967"},{"issue":"1","key":"10.1016\/j.patcog.2018.02.015_bib0018","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-007-0114-2","article-title":"Top 10 algorithms in data mining","volume":"14","author":"Wu","year":"2008","journal-title":"Knowl. Inf. Syst."},{"issue":"1\u20133","key":"10.1016\/j.patcog.2018.02.015_bib0019","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1023\/B:MACH.0000033113.59016.96","article-title":"Clustering large graphs via the singular value decomposition","volume":"56","author":"Drineas","year":"2004","journal-title":"Mach. Learn."},{"issue":"8","key":"10.1016\/j.patcog.2018.02.015_bib0020","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","article-title":"Data clustering: 50 years beyond k-means","volume":"31","author":"Jain","year":"2010","journal-title":"Pattern Recognit. Lett."},{"key":"10.1016\/j.patcog.2018.02.015_bib0021","series-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, Louisiana","article-title":"k-means++: the advantages of careful seeding","author":"Arthur","year":"2007"},{"key":"10.1016\/j.patcog.2018.02.015_bib0022","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 Recognit. Lett."},{"key":"10.1016\/j.patcog.2018.02.015_bib0023","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1016\/j.patrec.2007.01.001","article-title":"A method for initialising the k-means clustering algorithm using kd-trees","volume":"28","author":"Redmond","year":"2007","journal-title":"Pattern Recognit. Lett."},{"key":"10.1016\/j.patcog.2018.02.015_bib0024","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.eswa.2012.07.021","article-title":"A comparative study of efficient initialization methods for the k-means clustering algorithm","volume":"40","author":"Celebi","year":"2013","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.patcog.2018.02.015_bib0025","unstructured":"School of Computing, University of Eastern Finland. (2016) [Online] \"https:\/\/2.zoppoz.workers.dev:443\/https\/cs.joensuu.fi\/sipu\/datasets\/."},{"issue":"2\u20133","key":"10.1016\/j.patcog.2018.02.015_bib0026","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","article-title":"Clustering to minimize the maximum intercluster distance","volume":"38","author":"Gonzalez","year":"1985","journal-title":"Theor. Comput. Sci."},{"issue":"10","key":"10.1016\/j.patcog.2018.02.015_bib0027","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/97.329844","article-title":"A new initialization technique for generalized Lloyd iteration","volume":"1","author":"Katsavounidis","year":"1994","journal-title":"IEEE Signal Process. Lett."},{"key":"10.1016\/j.patcog.2018.02.015_bib0028","series-title":"Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence","article-title":"A deterministic method for initializing k-means clustering","author":"Su","year":"2004"},{"issue":"2","key":"10.1016\/j.patcog.2018.02.015_bib0029","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 Recognit."},{"issue":"10","key":"10.1016\/j.patcog.2018.02.015_bib0030","doi-asserted-by":"crossref","first-page":"3192","DOI":"10.1016\/j.patcog.2008.04.004","article-title":"Modified global k-means algorithm for minimum sum-of-squares clustering problems","volume":"41","author":"Bagirov","year":"2008","journal-title":"Pattern Recognit."},{"issue":"5","key":"10.1016\/j.patcog.2018.02.015_bib0031","doi-asserted-by":"crossref","first-page":"1954","DOI":"10.1016\/j.patcog.2009.11.021","article-title":"Fast global k-means clustering using cluster membership and inequality","volume":"43","author":"Lai","year":"2010","journal-title":"Pattern Recognit."},{"issue":"4","key":"10.1016\/j.patcog.2018.02.015_bib0032","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1016\/j.patcog.2010.10.018","article-title":"Fast modified global k-means algorithm for incremental cluster construction","volume":"44","author":"Bagirov","year":"2011","journal-title":"Pattern Recognit."},{"issue":"7","key":"10.1016\/j.patcog.2018.02.015_bib0033","doi-asserted-by":"crossref","first-page":"2505","DOI":"10.1016\/j.patcog.2014.01.015","article-title":"The MinMax k-means clustering algorithm","volume":"47","author":"Tzortzis","year":"2014","journal-title":"Pattern Recognit."},{"issue":"2","key":"10.1016\/j.patcog.2018.02.015_bib0034","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1109\/TIT.2014.2375327","article-title":"Randomized dimensionality reduction for k-means clustering","volume":"61","author":"Boutsidis","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.patcog.2018.02.015_bib0035","series-title":"Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms","article-title":"Turning Big data into tiny data: constant-size coresets for k-means, PCA and projective clustering","author":"Feldman","year":"2013"},{"key":"10.1016\/j.patcog.2018.02.015_bib0036","series-title":"Proceedings of the Twentieth International Conference on International Conference on Machine Learning","article-title":"Using the triangle inequality to accelerate k-means","author":"Elkan","year":"2003"},{"key":"10.1016\/j.patcog.2018.02.015_bib0037","series-title":"Proceedings of SIAM International Conference on Data mining (SDM)","article-title":"Making k-means even faster","author":"Hamerly","year":"2010"},{"key":"10.1016\/j.patcog.2018.02.015_bib0038","series-title":"Proceedings of 2009 SIAM International Conference on Data Mining, Sparks, Nevada, USA","article-title":"GAD: general activity detection for fast clustering on large data","author":"Jin","year":"2009"},{"key":"10.1016\/j.patcog.2018.02.015_bib0039","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1002\/sam.10097","article-title":"A general framework for efficient clustering of large datasets based on activity detection","volume":"4","author":"Jin","year":"2011","journal-title":"Stat. Anal. Data Min."},{"issue":"12","key":"10.1016\/j.patcog.2018.02.015_bib0040","doi-asserted-by":"crossref","first-page":"3677","DOI":"10.1016\/j.patcog.2008.06.005","article-title":"Improvement of the k-means clustering filtering algorithm","volume":"41","author":"Lai","year":"2008","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2018.02.015_sbref0038b","author":"Ismkhan","year":"2017","journal-title":"An initialization method for the k-means using the concept of useful nearest centers"}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0031320318300694?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0031320318300694?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,11,15]],"date-time":"2020-11-15T17:15:39Z","timestamp":1605460539000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320318300694"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":41,"alternative-id":["S0031320318300694"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.patcog.2018.02.015","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[2018,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"I-k-means\u2212+: An iterative clustering algorithm based on an enhanced version of the k-means","name":"articletitle","label":"Article Title"},{"value":"Pattern Recognition","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.patcog.2018.02.015","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}