{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:51:25Z","timestamp":1740160285866,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T00:00:00Z","timestamp":1600646400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T00:00:00Z","timestamp":1600646400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s13042-020-01193-5","type":"journal-article","created":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T04:00:47Z","timestamp":1600660847000},"page":"635-649","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["DISCERN: diversity-based selection of centroids for k-estimation and rapid non-stochastic clustering"],"prefix":"10.1007","volume":"12","author":[{"given":"Ali","family":"Hassani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir","family":"Iranmanesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahdi","family":"Eftekhari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9403-2550","authenticated-orcid":false,"given":"Abbas","family":"Salemi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,21]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Caron M, Bojanowski P, Joulin A, Douze M (2018) Deep clustering for unsupervised learning of visual features. In: Proceedings of the European conference on computer vision (ECCV), Munich, Germany, September 2018. Springer, Cham, pp 132\u2013149","key":"1193_CR1","DOI":"10.1007\/978-3-030-01264-9_9"},{"unstructured":"Zhang H, Basu S, Davidson I (2019) Deep constrained clustering-algorithms and advances. ArXiv preprint arXiv:190110061","key":"1193_CR2"},{"doi-asserted-by":"crossref","unstructured":"Gansbeke WV, Vandenhende S, Georgoulis S, Proesmans M, Gool LV (2020) Learning to classify images without labels. 2005.12320","key":"1193_CR3","DOI":"10.1007\/978-3-030-58607-2_16"},{"unstructured":"Caron M, Misra I, Mairal J, Goyal P, Bojanowski P, Joulin A (2020) Unsupervised learning of visual features by contrasting cluster assignments. 2006.09882","key":"1193_CR4"},{"issue":"4","key":"1193_CR5","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/MIS.2012.85","volume":"29","author":"D Kim","year":"2012","unstructured":"Kim D, Lee B, Lee HJ, Lee SP, Moon Y, Jeong MK (2012) A graph kernel approach for detecting core patents and patent groups. IEEE Intell Syst 29(4):44\u201351","journal-title":"IEEE Intell Syst"},{"issue":"2","key":"1193_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s13042-014-0260-2","volume":"6","author":"Y Fang","year":"2015","unstructured":"Fang Y, Gui-fa T (2015) Visual music score detection with unsupervised feature learning method based on K-means. Int J Mach Learn Cybern 6(2):277\u2013287","journal-title":"Int J Mach Learn Cybern"},{"unstructured":"Arthur D, Vassilvitskii S (2007) K-means++: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms (SODA), Society for Industrial and Applied Mathematics, New Orleans, LA, USA, January 2007, pp 1027\u20131035","key":"1193_CR7"},{"key":"1193_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-981-13-1708-8_14","volume-title":"Progress in advanced computing and intelligent engineering","author":"F Gulnashin","year":"2019","unstructured":"Gulnashin F, Sharma I, Sharma H (2019) A new deterministic method of initializing spherical K-means for document clustering. In: Progress in advanced computing and intelligent engineering. Springer, Singapore, pp 149\u2013155"},{"doi-asserted-by":"crossref","unstructured":"Jain A, Sharma I (2018) Clustering of text streams via facility location and spherical K-means. In: 2018 second international conference on electronics, Communication and Aerospace Technology (ICECA), Coimbatore, India, March 2018. IEEE, pp 1209\u20131213","key":"1193_CR9","DOI":"10.1109\/ICECA.2018.8474757"},{"issue":"1","key":"1193_CR10","first-page":"100","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan JA, Wong MA (1979) Algorithm as 136: a K-means clustering algorithm. J R Stat Soc Ser C (Applied Statistics) 28(1):100\u2013108","journal-title":"J R Stat Soc Ser C (Applied Statistics)"},{"issue":"2","key":"1193_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s13042-012-0079-7","volume":"4","author":"TH Sarma","year":"2013","unstructured":"Sarma TH, Viswanath P, Reddy BE (2013) A hybrid approach to speed-up the K-means clustering method. Int J Mach Learn Cybern 4(2):107\u2013117","journal-title":"Int J Mach Learn Cybern"},{"issue":"10","key":"1193_CR12","doi-asserted-by":"publisher","first-page":"2767","DOI":"10.1007\/s13042-018-0901-y","volume":"10","author":"P Wang","year":"2019","unstructured":"Wang P, Shi H, Yang X, Mi J (2019) Three-way K-means: integrating K-means and three-way decision. Int J Mach Learn Cybern 10(10):2767\u20132777","journal-title":"Int J Mach Learn Cybern"},{"issue":"6","key":"1193_CR13","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1007\/s13042-016-0617-9","volume":"9","author":"L Chen","year":"2018","unstructured":"Chen L, Xu Z, Wang H, Liu S (2018) An ordered clustering algorithm based on K-means and the promethee method. Int J Mach Learn Cybern 9(6):917\u2013926","journal-title":"Int J Mach Learn Cybern"},{"key":"1193_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-15740-1_124","author":"Z Cai","year":"2019","unstructured":"Cai Z, Zhou C, Li X (2019) Application research of employment recommendation based on improved K-means++ algorithm in colleges and universities. Appl Intell Syst Multimodal Inf Anal. https:\/\/doi.org\/10.1007\/978-3-030-15740-1_124","journal-title":"Appl Intell Syst Multimodal Inf Anal"},{"issue":"7","key":"1193_CR15","doi-asserted-by":"publisher","first-page":"e12859","DOI":"10.1111\/jfpe.12859","volume":"41","author":"S Solak","year":"2018","unstructured":"Solak S, Altinisik U (2018) A new method for classifying nuts using image processing and K-means++ clustering. J Food Process Eng 41(7):e12859","journal-title":"J Food Process Eng"},{"unstructured":"Maggioni M, Murphy JM (2019) Learning by unsupervised nonlinear diffusion. J Mach Learn Res 20(160):1\u201356. http:\/\/jmlr.org\/papers\/v20\/18-873.html","key":"1193_CR16"},{"doi-asserted-by":"crossref","unstructured":"Little A, Byrd A (2015) A multiscale spectral method for learning number of clusters. In: 2015 IEEE 14th international conference on machine learning and applications (ICMLA), Miami, FL, USA, December 2015. pp 457\u2013460","key":"1193_CR17","DOI":"10.1109\/ICMLA.2015.119"},{"unstructured":"Pelleg D, Moore AW (2000) X-means: extending K-means with efficient estimation of the number of clusters. In: Proceedings of the seventeenth international conference on machine learning (ICML), Stanford, CA, USA, June\u2013July 2000. Morgan Kaufmann Publishers Inc., pp 727\u2013734","key":"1193_CR18"},{"unstructured":"Thomaz CE (2006) Fei face database. https:\/\/fei.edu.br\/~cet\/facedatabase.html. Accessed 1 Aug 2019","key":"1193_CR19"},{"key":"1193_CR20","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1109\/34.598228","volume":"19","author":"PN Belhumeur","year":"1997","unstructured":"Belhumeur PN, Hespanha JP, Kriegman DJ (1997) Eigenfaces vs. fisherfaces: recognition using class specific linear projection. IEEE Trans Pattern Anal Mach Intell 19:711\u2013720","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"unstructured":"Weyrauch B, Heisele B, Huang J, Blanz V (2004) Component-based face recognition with 3d morphable models. In: 2004 conference on computer vision and pattern recognition workshop (CVPR), Washington, DC, USA, June\u2013July 2004. IEEE","key":"1193_CR21"},{"unstructured":"Nefian AV (1999) Georgia tech face database. http:\/\/www.anefian.com\/research\/face_reco.htm. Accessed 1 Aug 2019","key":"1193_CR22"},{"unstructured":"Samaria FS, Harter AC (1994) Parameterisation of a stochastic model for human face identification. In: Proceedings of 1994 IEEE workshop on applications of computer vision (ACV), Sarasota, FL, USA, December 1994. IEEE, pp 138\u2013142, https:\/\/git-disl.github.io\/GTDLBench\/datasets\/att_face_dataset\/","key":"1193_CR23"},{"unstructured":"Computational Visions Group (1999) Faces 1999. http:\/\/www.vision.caltech.edu\/html-files\/archive.html. Accessed 1 Aug 2019","key":"1193_CR24"},{"unstructured":"Fastai (2019) Imagenette: ImageNet Subset. https:\/\/github.com\/fastai\/imagenette. Accessed 1 May 2020","key":"1193_CR25"},{"unstructured":"Blishen B, Carroll W, Moore C (2001) Prestige: Prestige of Canadian Occupations","key":"1193_CR26"},{"doi-asserted-by":"crossref","unstructured":"Han EH, Boley D, Gini M, Gross R, Hastings K, Karypis G, Kumar V, Mobasher B, Moore J (1998) Webace: a web agent for document categorization and exploration. In: Proceedings of the second international conference on autonomous agents. ACM, pp 408\u2013415","key":"1193_CR27","DOI":"10.1145\/280765.280872"},{"doi-asserted-by":"crossref","unstructured":"Greene D, Cunningham P (2006) Practical solutions to the problem of diagonal dominance in kernel document clustering. In: Proceedings of the 23rd international conference on Machine learning (ICML), Pittsburgh, PA, USA, June 2006. ACM, pp 377\u2013384","key":"1193_CR28","DOI":"10.1145\/1143844.1143892"},{"issue":"1","key":"1193_CR29","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert L, Arabie P (1985) Comparing partitions. J Classif 2(1):193\u2013218","journal-title":"J Classif"},{"doi-asserted-by":"crossref","unstructured":"Schroff F, Kalenichenko D, Philbin J (2015) Facenet: A unified embedding for face recognition and clustering. In: Proceedings of the IEEE conference on computer vision and pattern recognition (CVPR), Boston, MA, USA, June 2015. IEEE, pp 815\u2013823","key":"1193_CR30","DOI":"10.1109\/CVPR.2015.7298682"},{"unstructured":"Taniai H (2018) keras-facenet. https:\/\/github.com\/nyoki-mtl\/keras-facenet. Accessed 1 Aug 2019","key":"1193_CR31"},{"doi-asserted-by":"crossref","unstructured":"Guo Y, Zhang L, Hu Y, He X, Gao J (2016) Ms-celeb-1m: a dataset and benchmark for large-scale face recognition. In: European conference on computer vision (ECCV), Amsterdam, The Netherlands, October 2016. Springer, Cham, pp 87\u2013102","key":"1193_CR32","DOI":"10.1007\/978-3-319-46487-9_6"},{"doi-asserted-by":"crossref","unstructured":"He K, Zhang X, Ren S, Sun J (2016) Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition (CVPR), Las Vegas, NV, USA, June\u2013July 2016. IEEE, pp 770\u2013778","key":"1193_CR33","DOI":"10.1109\/CVPR.2016.90"},{"unstructured":"Paszke A, Gross S, Massa F, Lerer A, Bradbury J,Chanan G, Killeen T, Lin Z, Gimelshein N, Antiga L, Desmaison A, Kopf A, Yang E, DeVito Z, Raison M, Tejani A, Chilamkurthy S, Steiner B, Fang L, Bai J, Chintala S (2019) PyTorch: An imperative style, high-performance deep learning library. In: Advances in neural information processing systems (NIPS) 32, Vancouver, Canada, December 2019. Curran Associates, Inc., pp 8024\u20138035","key":"1193_CR34"},{"unstructured":"Abadi M, Agarwal A, Barham P, Brevdo E, Chen Z, Citro C, Corrado GS, Davis A, Dean J, Devin M, Ghemawat S, Goodfellow I, Harp A, Irving G, Isard M, Jia Y, Jozefowicz R, Kaiser L, Kudlur M, Levenberg J, Man\u00e9 D, Monga R, Moore S, Murray D, Olah C, Schuster M, Shlens J, Steiner B, Sutskever I, Talwar K, Tucker P, Vanhoucke V, Vasudevan V, Vi\u00e9gas F, Vinyals O, Warden P, Wattenberg M, Wicke M, Yu Y, Zheng X (2015) TensorFlow: large-scale machine learning on heterogeneous systems. https:\/\/www.tensorflow.org\/, software available from tensorflow.org. Accessed 1 Aug 2019","key":"1193_CR35"},{"issue":"2","key":"1193_CR36","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MCSE.2011.37","volume":"13","author":"S Van Der Walt","year":"2011","unstructured":"Van Der Walt S, Colbert SC, Varoquaux G (2011) The numpy array: a structure for efficient numerical computation. Comput Sci Eng 13(2):22","journal-title":"Comput Sci Eng"},{"issue":"Oct","key":"1193_CR37","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa F, Varoquaux G, Gramfort A, Michel V, Thirion B, Grisel O, Blondel M, Prettenhofer P, Weiss R, Dubourg V et al (2011) Scikit-learn: machine learning in python. J Mach Learn Res 12(Oct):2825\u20132830","journal-title":"J Mach Learn Res"},{"issue":"36","key":"1193_CR38","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.21105\/joss.01230","volume":"4","author":"A Novikov","year":"2019","unstructured":"Novikov A (2019) Pyclustering: data mining library. J Open Sour Softw 4(36):1230","journal-title":"J Open Sour Softw"},{"issue":"3","key":"1193_CR39","first-page":"255","volume":"17","author":"J Alcal\u00e1-Fdez","year":"2011","unstructured":"Alcal\u00e1-Fdez J, Fern\u00e1ndez A, Luengo J, Derrac J, Garc\u00eda S, S\u00e1nchez L, Herrera F (2011) Keel data-mining software tool: data set repository, integration of algorithms and experimental analysis framework. J Multiple Valued Logic Soft Comput 17(3):255\u2013287","journal-title":"J Multiple Valued Logic Soft Comput"},{"key":"1193_CR40","first-page":"226","volume":"96","author":"M Ester","year":"1996","unstructured":"Ester M, Kriegel HP, Sander J, Xu X et al (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. Kdd 96:226\u2013231","journal-title":"Kdd"},{"key":"1193_CR41","first-page":"49","volume":"28","author":"M Ankerst","year":"1999","unstructured":"Ankerst M, Breunig MM, Kriegel HP, Sander J (1999) Optics: ordering points to identify the clustering structure. ACM Sigmod record. ACM 28:49\u201360","journal-title":"ACM"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-020-01193-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-020-01193-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-020-01193-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T01:17:19Z","timestamp":1632187039000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-020-01193-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,21]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["1193"],"URL":"https:\/\/doi.org\/10.1007\/s13042-020-01193-5","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"type":"print","value":"1868-8071"},{"type":"electronic","value":"1868-808X"}],"subject":[],"published":{"date-parts":[[2020,9,21]]},"assertion":[{"value":"9 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}