{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T18:26:46Z","timestamp":1778956006935,"version":"3.51.4"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T00:00:00Z","timestamp":1687478400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T00:00:00Z","timestamp":1687478400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"This study was supported by the earmarked fund","award":["CARS-29"],"award-info":[{"award-number":["CARS-29"]}]},{"name":"Open funds of the Key Laboratory of Viticulture and Enology, Ministry of Agriculture, PR China"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s13042-023-01893-8","type":"journal-article","created":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T20:30:50Z","timestamp":1687552250000},"page":"4251-4283","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A novel stratification clustering algorithm based on a new local density estimation method and an improved local inter-cluster distance measure"],"prefix":"10.1007","volume":"14","author":[{"given":"Jianfang","family":"Qi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haibin","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianying","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2063-7933","authenticated-orcid":false,"given":"Weisong","family":"Mu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,23]]},"reference":[{"key":"1893_CR1","unstructured":"Arthur D, Vassilvitskii S (2007) k-Means plus plus: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, pp 1027\u20131035"},{"issue":"2","key":"1893_CR2","doi-asserted-by":"publisher","first-page":"114149","DOI":"10.1016\/j.eswa.2020.114149","volume":"167","author":"A Ahmad","year":"2020","unstructured":"Ahmad A, Khan SS (2020) initKmix\u2014a novel initial partition generation algorithm for clustering mixed data using k-means-based clustering. Expert Syst Appl 167(2):114149. https:\/\/doi.org\/10.1016\/j.eswa.2020.114149","journal-title":"Expert Syst Appl"},{"issue":"3","key":"1893_CR3","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1108\/00070701111116437","volume":"113","author":"TA Brunner","year":"2011","unstructured":"Brunner TA, Siegrist M (2011) A consumer-oriented segmentation study in the Swiss wine market. Br Food J 113(3):353\u2013373. https:\/\/doi.org\/10.1108\/00070701111116437","journal-title":"Br Food J"},{"issue":"1","key":"1893_CR4","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1108\/apjml-10-2015-0161","volume":"29","author":"J Bruwer","year":"2017","unstructured":"Bruwer J, Roediger B, Herbst F (2017) Domain-specific market segmentation: a wine-related lifestyle (WRL) approach. Asia Pac J Mark Logist 29(1):4\u201326. https:\/\/doi.org\/10.1108\/apjml-10-2015-0161","journal-title":"Asia Pac J Mark Logist"},{"key":"1893_CR5","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.patrec.2022.04.004","volume":"158","author":"M Bibi","year":"2022","unstructured":"Bibi M, Abbasi WA, Aziz W, Khalil S, Uddin M, Iwendi C, Gadekallu TR (2022) A novel unsupervised ensemble framework using concept-based linguistic methods and machine learning for twitter sentiment analysis. Pattern Recogn Lett 158:80\u201386. https:\/\/doi.org\/10.1016\/j.patrec.2022.04.004","journal-title":"Pattern Recogn Lett"},{"issue":"4","key":"1893_CR6","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1108\/bfj-11-2015-0420","volume":"118","author":"M Crespi-Vallbona","year":"2016","unstructured":"Crespi-Vallbona M, Dimitrovski D (2016) Food markets visitors: a typology proposal. Br Food J 118(4):840\u2013857. https:\/\/doi.org\/10.1108\/bfj-11-2015-0420","journal-title":"Br Food J"},{"issue":"11","key":"1893_CR7","doi-asserted-by":"publisher","first-page":"8051","DOI":"10.1007\/s00521-018-3641-8","volume":"31","author":"D Cheng","year":"2019","unstructured":"Cheng D, Zhu Q, Huang J, Wu Q, Yang L (2019) A local cores-based hierarchical clustering algorithm for data sets with complex structures. Neural Comput Appl 31(11):8051\u20138068. https:\/\/doi.org\/10.1007\/s00521-018-3641-8","journal-title":"Neural Comput Appl"},{"issue":"7","key":"1893_CR8","doi-asserted-by":"publisher","first-page":"1591","DOI":"10.1007\/s13042-018-0836-3","volume":"10","author":"D Cheng","year":"2019","unstructured":"Cheng D, Zhu Q, Huang J, Wu Q, Yang L (2019) A hierarchical clustering algorithm based on noise removal. Int J Mach Learn Cybern 10(7):1591\u20131602. https:\/\/doi.org\/10.1007\/s13042-018-0836-3","journal-title":"Int J Mach Learn Cybern"},{"key":"1893_CR9","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2020.3002926","author":"M Capo","year":"2020","unstructured":"Capo M, Perez A, Lozano J (2020) An efficient split-merge re-start for the K-means algorithm. IEEE Trans Knowl Data Eng. https:\/\/doi.org\/10.1109\/tkde.2020.3002926","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1893_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-022-03661-7","author":"L Chen","year":"2022","unstructured":"Chen L, Chen F, Liu Z, Lv M, He T, Zhang S (2022) Parallel gravitational clustering based on grid partitioning for large-scale data. Appl Intell. https:\/\/doi.org\/10.1007\/s10489-022-03661-7","journal-title":"Appl Intell"},{"key":"1893_CR11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10489-022-03661-7","volume":"99","author":"M Du","year":"2016","unstructured":"Du M, Ding S, Jia H (2016) Study on density peaks clustering based on k-nearest neighbors and principal component analysis. Knowl Based Syst 99:135\u2013145. https:\/\/doi.org\/10.1007\/s10489-022-03661-7","journal-title":"Knowl Based Syst"},{"key":"1893_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2021\/5521119","volume":"2021","author":"G Du","year":"2021","unstructured":"Du G, Li X, Zhang L, Liu L, Zhao C (2021) Novel automated K-means++ algorithm for financial data sets. Math Probl Eng 2021:1\u201312. https:\/\/doi.org\/10.1155\/2021\/5521119","journal-title":"Math Probl Eng"},{"key":"1893_CR13","unstructured":"Ester M, Kriegel HP, Sander S, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD\u201996: Proceedings of the second international conference on knowledge discovery and data mining, pp 226\u2013231"},{"key":"1893_CR14","doi-asserted-by":"publisher","first-page":"106990","DOI":"10.1016\/j.asoc.2020.106990","volume":"100","author":"LR Emmendorfer","year":"2021","unstructured":"Emmendorfer LR, Canuto AMDP (2021) A generalized average linkage criterion for hierarchical agglomerative clustering. Appl Soft Comput 100:106990. https:\/\/doi.org\/10.1016\/j.asoc.2020.106990","journal-title":"Appl Soft Comput"},{"issue":"7","key":"1893_CR15","doi-asserted-by":"publisher","first-page":"2095","DOI":"10.1007\/s00521-015-1998-5","volume":"31","author":"J Fan","year":"2019","unstructured":"Fan J (2019) OPE-HCA: an optimal probabilistic estimation approach for hierarchical clustering algorithm. Neural Comput Appl 31(7):2095\u20132105. https:\/\/doi.org\/10.1007\/s00521-015-1998-5","journal-title":"Neural Comput Appl"},{"key":"1893_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/s00180-021-01187-z","author":"\u0130 G\u00fczel","year":"2020","unstructured":"G\u00fczel \u0130, Kaygun A (2020) A new non-Archimedan metric on persistent homology. Comput Stat. https:\/\/doi.org\/10.1007\/s00180-021-01187-z","journal-title":"Comput Stat"},{"issue":"8","key":"1893_CR17","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1007\/s13042-020-01068-9","volume":"11","author":"T Huang","year":"2020","unstructured":"Huang T, Wang S, Zhu W (2020) An adaptive kernelized rank-order distance for clustering non-spherical data with high noise. Int J Mach Learn Cybern 11(8):1735\u20131747. https:\/\/doi.org\/10.1007\/s13042-020-01068-9","journal-title":"Int J Mach Learn Cybern"},{"key":"1893_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-022-01557-z","author":"H Hou","year":"2022","unstructured":"Hou H, Ding S, Xu X (2022) A deep clustering by multi-level feature fusion. Int J Mach Learn Cybern. https:\/\/doi.org\/10.1007\/s13042-022-01557-z","journal-title":"Int J Mach Learn Cybern"},{"issue":"23","key":"1893_CR19","doi-asserted-by":"publisher","first-page":"14583","DOI":"10.1007\/s00500-021-06397-7","volume":"25","author":"M Jahan","year":"2021","unstructured":"Jahan M, Hasan M (2021) A robust fuzzy approach for gene expression data clustering. Soft Comput 25(23):14583\u201314596. https:\/\/doi.org\/10.1007\/s00500-021-06397-7","journal-title":"Soft Comput"},{"issue":"3","key":"1893_CR20","doi-asserted-by":"publisher","first-page":"502","DOI":"10.55730\/1300-0632.3794","volume":"30","author":"E K\u00f6se","year":"2022","unstructured":"K\u00f6se E, Hocao\u011flu AK (2022) Clustering with density based initialization and Bhattacharyya based merging. Turk J Electr Eng Comput Sci 30(3):502\u2013517. https:\/\/doi.org\/10.55730\/1300-0632.3794","journal-title":"Turk J Electr Eng Comput Sci"},{"issue":"13","key":"1893_CR21","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1108\/bfj-09-2021-1001","volume":"124","author":"SA Kaliji","year":"2022","unstructured":"Kaliji SA, Imami D, Canavari M, Gjonbalaj M, Gjokaj E (2022) Fruit-related lifestyles as a segmentation tool for fruit consumers. Br Food J 124(13):126\u2013142. https:\/\/doi.org\/10.1108\/bfj-09-2021-1001","journal-title":"Br Food J"},{"key":"1893_CR22","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.knosys.2017.07.010","volume":"133","author":"Y Liu","year":"2017","unstructured":"Liu Y, Ma Z, Yu F (2017) Adaptive density peak clustering based on K-nearest neighbors with aggregating strategy. Knowl Based Syst 133:208\u2013220. https:\/\/doi.org\/10.1016\/j.knosys.2017.07.010","journal-title":"Knowl Based Syst"},{"issue":"7","key":"1893_CR23","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1108\/bfj-07-2017-0381","volume":"120","author":"CA L\u00f3pez-Rosas","year":"2018","unstructured":"L\u00f3pez-Rosas CA, Espinoza-Ortega A (2018) Understanding the motives of consumers of Mezcal in Mexico. Br Food J 120(7):1643\u20131656. https:\/\/doi.org\/10.1108\/bfj-07-2017-0381","journal-title":"Br Food J"},{"key":"1893_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107924","author":"Y Li","year":"2021","unstructured":"Li Y, Chu X, Tian D, Feng J, Mu W (2021) Customer segmentation using K-means clustering and the adaptive particle swarm optimization algorithm. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2021.107924","journal-title":"Appl Soft Comput"},{"key":"1893_CR25","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.ins.2021.10.029","volume":"584","author":"C Li","year":"2022","unstructured":"Li C, Wang H, Jiang F, Zhang Y, Peng Y (2022) A new clustering mining algorithm for multi-source imbalanced location data. Inf Sci 584:50\u201364. https:\/\/doi.org\/10.1016\/j.ins.2021.10.029","journal-title":"Inf Sci"},{"issue":"3","key":"1893_CR26","first-page":"377","volume":"29","author":"W Mu","year":"2017","unstructured":"Mu W, Zhu H, Tian D, Feng J (2017) Profiling wine consumers by price segment: a case study in Beijing, China. Ital J Food Sci 29(3):377\u2013397","journal-title":"Ital J Food Sci"},{"issue":"3","key":"1893_CR27","doi-asserted-by":"publisher","first-page":"613","DOI":"10.3390\/su11030613","volume":"11","author":"G Maciejewski","year":"2019","unstructured":"Maciejewski G, Mokrysz S, Wr\u00f3blewski \u0141 (2019) Segmentation of coffee consumers using sustainable values: cluster analysis on the polish coffee market. Sustainability 11(3):613. https:\/\/doi.org\/10.3390\/su11030613","journal-title":"Sustainability"},{"key":"1893_CR28","doi-asserted-by":"publisher","first-page":"115913","DOI":"10.1016\/j.eswa.2021.115913","volume":"187","author":"M Naderipour","year":"2022","unstructured":"Naderipour M, Zarandi MHF, Bastani S (2022) A fuzzy cluster-validity index based on the topology structure and node attribute in complex networks. Expert Syst Appl 187:115913. https:\/\/doi.org\/10.1016\/j.eswa.2021.115913","journal-title":"Expert Syst Appl"},{"issue":"2","key":"1893_CR29","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1108\/IJWBR-09-2015-0041","volume":"28","author":"J Paschen","year":"2016","unstructured":"Paschen J, Paschen U, Kietzmann JH (2016) \u00c0 votre sant\u00e9-conceptualizing the AO typology for luxury wine and spirits. Int J Wine Bus Res 28(2):170\u2013186","journal-title":"Int J Wine Bus Res"},{"issue":"7","key":"1893_CR30","doi-asserted-by":"publisher","first-page":"2589","DOI":"10.1007\/s00521-019-04297-4","volume":"32","author":"MV Prabhagar","year":"2020","unstructured":"Prabhagar MV, Punniyamoorthy M (2020) Development of new agglomerative and performance evaluation models for classification. Neural Comput Appl 32(7):2589\u20132600. https:\/\/doi.org\/10.1007\/s00521-019-04297-4","journal-title":"Neural Comput Appl"},{"issue":"3","key":"1893_CR31","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s13042-019-01027-z","volume":"11","author":"R Qaddoura","year":"2020","unstructured":"Qaddoura R, Faris H, Aljarah I (2020) An efficient clustering algorithm based on the k-nearest neighbors with an indexing ratio. Int J Mach Learn Cybern 11(3):675\u2013714. https:\/\/doi.org\/10.1007\/s13042-019-01027-z","journal-title":"Int J Mach Learn Cybern"},{"key":"1893_CR32","doi-asserted-by":"publisher","DOI":"10.1108\/K-01-2022-0049","author":"J Qi","year":"2022","unstructured":"Qi J, Li Y, Jin H, Feng J, Mu W (2022) User value identification based on an improved consumer value segmentation algorithm. Kybernetes. https:\/\/doi.org\/10.1108\/K-01-2022-0049","journal-title":"Kybernetes"},{"issue":"6191","key":"1893_CR33","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1126\/science.1242072","volume":"344","author":"A Rodriguez","year":"2014","unstructured":"Rodriguez A, Laio A (2014) Clustering by fast search and find of density peaks. Science 344(6191):1492\u20131496. https:\/\/doi.org\/10.1126\/science.1242072","journal-title":"Science"},{"key":"1893_CR34","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.eswa.2018.03.052","volume":"105","author":"F Ros","year":"2018","unstructured":"Ros F, Guillaume S (2018) Protras: a probabilistic traversing sampling algorithm. Expert Syst Appl 105:65\u201376. https:\/\/doi.org\/10.1016\/j.eswa.2018.03.052","journal-title":"Expert Syst Appl"},{"key":"1893_CR35","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.eswa.2019.03.031","volume":"128","author":"F Ros","year":"2019","unstructured":"Ros F, Guillaume S (2019) A hierarchical clustering algorithm and an improvement of the single linkage criterion to deal with noise. Expert Syst Appl 128:96\u2013108. https:\/\/doi.org\/10.1016\/j.eswa.2019.03.031","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1893_CR36","doi-asserted-by":"publisher","first-page":"483","DOI":"10.32604\/cmes.2022.017467","volume":"130","author":"J Shi","year":"2022","unstructured":"Shi J, Ye L, Li Z, Zhan D (2022) Unsupervised binary protocol clustering based on maximum sequential patterns. CMES Comput Model Eng Sci 130(1):483\u2013498. https:\/\/doi.org\/10.32604\/cmes.2022.017467","journal-title":"CMES Comput Model Eng Sci"},{"issue":"4","key":"1893_CR37","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1007\/s13042-022-01518-6","volume":"13","author":"B Turkoglu","year":"2022","unstructured":"Turkoglu B, Uymaz SA, Kaya E (2022) Clustering analysis through artificial algae algorithm. Int J Mach Learn Cybern 13(4):1179\u20131196. https:\/\/doi.org\/10.1007\/s13042-022-01518-6","journal-title":"Int J Mach Learn Cybern"},{"issue":"5","key":"1893_CR38","doi-asserted-by":"publisher","first-page":"2412","DOI":"10.1080\/03610918.2019.1697449","volume":"51","author":"P Tellaroli","year":"2022","unstructured":"Tellaroli P (2022) SingleCross-clustering: an algorithm for finding elongated clusters with automatic estimation of outliers and number of clusters. Commun Stat Simul Comput 51(5):2412\u20132428. https:\/\/doi.org\/10.1080\/03610918.2019.1697449","journal-title":"Commun Stat Simul Comput"},{"issue":"1","key":"1893_CR39","doi-asserted-by":"publisher","first-page":"115518","DOI":"10.1016\/j.eswa.2021.115518","volume":"184","author":"IM Ventorimr","year":"2021","unstructured":"Ventorimr IM, Luchi D, Rodrigues AL, Varej\u00e3o FM (2021) BIRCHSCAN: a sampling method for applying DBSCAN to large datasets. Expert Syst Appl 184(1):115518. https:\/\/doi.org\/10.1016\/j.eswa.2021.115518","journal-title":"Expert Syst Appl"},{"issue":"8","key":"1893_CR40","doi-asserted-by":"publisher","first-page":"1971","DOI":"10.1109\/tkde.2016.2535209","volume":"28","author":"G Wang","year":"2016","unstructured":"Wang G, Song Q (2016) Automatic clustering via outward statistical testing on density metrics. IEEE Trans Knowl Data Eng 28(8):1971\u20131985. https:\/\/doi.org\/10.1109\/tkde.2016.2535209","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1893_CR41","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ins.2016.03.011","volume":"354","author":"J Xie","year":"2016","unstructured":"Xie J, Gao H, Xie W, Liu X, Grant PW (2016) Robust clustering by detecting density peaks and assigning points based on fuzzy weighted K-nearest neighbors. Inf Sci 354:19\u201340. https:\/\/doi.org\/10.1016\/j.ins.2016.03.011","journal-title":"Inf Sci"},{"issue":"10","key":"1893_CR42","doi-asserted-by":"publisher","first-page":"2825","DOI":"10.1007\/s13042-021-01369-7","volume":"12","author":"X Yuan","year":"2021","unstructured":"Yuan X, Yu H, Liang J, Xu B (2021) A novel density peaks clustering algorithm based on K nearest neighbors with adaptive merging strategy. Int J Mach Learn Cybern 12(10):2825\u20132841. https:\/\/doi.org\/10.1007\/s13042-021-01369-7","journal-title":"Int J Mach Learn Cybern"},{"key":"1893_CR43","doi-asserted-by":"publisher","DOI":"10.1007\/s10064-022-02724-w","author":"J Yan","year":"2022","unstructured":"Yan J, Chen J, Zhan J, Song S, Zhang Y, Zhao M, Liu Y, Xu W (2022) Automatic identification of rock discontinuity sets using modified agglomerative nesting algorithm. Bull Eng Geol Environ. https:\/\/doi.org\/10.1007\/s10064-022-02724-w","journal-title":"Bull Eng Geol Environ"},{"key":"1893_CR44","doi-asserted-by":"publisher","first-page":"102159","DOI":"10.1016\/j.is.2022.102159","volume":"114","author":"Q Yang","year":"2023","unstructured":"Yang Q, Gao W, Han G, Li Z, Tian M, Zhu S, Deng Y (2023) HCDC: a novel hierarchical clustering algorithm based on density-distance cores for data sets with varying density. Inf Syst 114:102159. https:\/\/doi.org\/10.1016\/j.is.2022.102159","journal-title":"Inf Syst"},{"key":"1893_CR45","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.patrec.2016.05.007","volume":"80","author":"Q Zhu","year":"2016","unstructured":"Zhu Q, Feng J, Huang J (2016) Natural neighbor: A self-adaptive neighborhood method without parameter K. Pattern Recogn Lett 80:30\u201336. https:\/\/doi.org\/10.1016\/j.patrec.2016.05.007","journal-title":"Pattern Recogn Lett"},{"issue":"4","key":"1893_CR46","doi-asserted-by":"publisher","first-page":"4559","DOI":"10.3233\/jifs-191361","volume":"38","author":"S Zhou","year":"2020","unstructured":"Zhou S, Liu F (2020) A novel internal cluster validity index. J Intell Fuzzy Syst 38(4):4559\u20134571. https:\/\/doi.org\/10.3233\/jifs-191361","journal-title":"J Intell Fuzzy Syst"},{"key":"1893_CR47","doi-asserted-by":"publisher","first-page":"113136","DOI":"10.1016\/j.eswa.2019.113136","volume":"145","author":"J Zhou","year":"2020","unstructured":"Zhou J, Zhai L, Pantelous AA (2020) Market segmentation using high-dimensional sparse consumers data. Expert Syst Appl 145:113136. https:\/\/doi.org\/10.1016\/j.eswa.2019.113136","journal-title":"Expert Syst Appl"},{"key":"1893_CR48","doi-asserted-by":"publisher","first-page":"116573","DOI":"10.1016\/j.eswa.2022.116573","volume":"195","author":"Z Zhou","year":"2022","unstructured":"Zhou Z, Si G, Sun H, Qu K, Hou W (2022) A robust clustering algorithm based on the identification of core points and KNN kernel density estimation. Expert Syst Appl 195:116573. https:\/\/doi.org\/10.1016\/j.eswa.2022.116573","journal-title":"Expert Syst Appl"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-023-01893-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-023-01893-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-023-01893-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,13]],"date-time":"2023-10-13T05:24:52Z","timestamp":1697174692000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-023-01893-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,23]]},"references-count":48,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1893"],"URL":"https:\/\/doi.org\/10.1007\/s13042-023-01893-8","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,23]]},"assertion":[{"value":"10 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that we have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}