{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T05:40:05Z","timestamp":1751521205489,"version":"3.41.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T00:00:00Z","timestamp":1751500800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T00:00:00Z","timestamp":1751500800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Institute of Technology Calicut, India","award":["ID FRG\/2022\/CSED\/02"],"award-info":[{"award-number":["ID FRG\/2022\/CSED\/02"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-07502-5","type":"journal-article","created":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T05:20:05Z","timestamp":1751520005000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SCACSBD: a scalable clustering approach for complex-shaped big data"],"prefix":"10.1007","volume":"81","author":[{"given":"Agnijit","family":"Basu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binu Jose","family":"Ambrose","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raju","family":"Hazari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pranesh","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,3]]},"reference":[{"issue":"2","key":"7502_CR1","first-page":"2272","volume":"5","author":"K Kameshwaran","year":"2014","unstructured":"Kameshwaran K, Malarvizhi K (2014) Survey on clustering techniques in data mining. Int J Comput Sci Inform Technol 5(2):2272\u20132276","journal-title":"Int J Comput Sci Inform Technol"},{"issue":"6","key":"7502_CR2","doi-asserted-by":"publisher","first-page":"583","DOI":"10.3233\/IDA-2007-11602","volume":"11","author":"MG Omran","year":"2007","unstructured":"Omran MG, Engelbrecht AP, Salman A (2007) An overview of clustering methods. Intell Data Anal 11(6):583\u2013605","journal-title":"Intell Data Anal"},{"key":"7502_CR3","doi-asserted-by":"publisher","first-page":"80015","DOI":"10.1109\/ACCESS.2021.3084057","volume":"9","author":"MA Mahdi","year":"2021","unstructured":"Mahdi MA, Hosny KM, Elhenawy I (2021) Scalable clustering algorithms for big data: A review. IEEE Access 9:80015\u201380027","journal-title":"IEEE Access"},{"key":"7502_CR4","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/A:1009783824328","volume":"1","author":"T Zhang","year":"1997","unstructured":"Zhang T, Ramakrishnan R, Livny M (1997) Birch: A new data clustering algorithm and its applications. Data Min Knowl Discov 1:141\u2013182","journal-title":"Data Min Knowl Discov"},{"issue":"2","key":"7502_CR5","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/235968.233324","volume":"25","author":"T Zhang","year":"1996","unstructured":"Zhang T, Ramakrishnan R, Livny M (1996) Birch: an efficient data clustering method for very large databases. ACM Sigmod Record 25(2):103\u2013114","journal-title":"ACM Sigmod Record"},{"issue":"1","key":"7502_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2733381","volume":"10","author":"RJ Campello","year":"2015","unstructured":"Campello RJ, Moulavi D, Zimek A, Sander J (2015) Hierarchical density estimates for data clustering, visualization, and outlier detection. ACM Trans Knowl Discov Data (TKDD) 10(1):1\u201351","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"issue":"1","key":"7502_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1186\/s40537-024-01053-x","volume":"12","author":"S Sieranoja","year":"2025","unstructured":"Sieranoja S, Fr\u00e4nti P (2025) Fast agglomerative clustering using approximate traveling salesman solutions. J Big Data 12(1):21","journal-title":"J Big Data"},{"issue":"6","key":"7502_CR8","first-page":"7309","volume":"5","author":"SK Uppada","year":"2014","unstructured":"Uppada SK (2014) Centroid based clustering algorithms-a clarion study. Int J Comput Sci Inform Technol 5(6):7309\u20137313","journal-title":"Int J Comput Sci Inform Technol"},{"key":"7502_CR9","doi-asserted-by":"publisher","first-page":"80716","DOI":"10.1109\/ACCESS.2020.2988796","volume":"8","author":"KP Sinaga","year":"2020","unstructured":"Sinaga KP, Yang M-S (2020) Unsupervised k-means clustering algorithm. IEEE Access 8:80716\u201380727","journal-title":"IEEE Access"},{"key":"7502_CR10","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10732-006-7284-z","volume":"12","author":"W Sheng","year":"2006","unstructured":"Sheng W, Liu X (2006) A genetic k-medoids clustering algorithm. J Heuristics 12:447\u2013466","journal-title":"J Heuristics"},{"issue":"1","key":"7502_CR11","first-page":"42","volume":"1","author":"NK Kaur","year":"2014","unstructured":"Kaur NK, Kaur U, Singh D (2014) K-medoid clustering algorithm\u2014a review. Int J Comput Appl Technol 1(1):42\u201345","journal-title":"Int J Comput Appl Technol"},{"key":"7502_CR12","doi-asserted-by":"publisher","first-page":"1104","DOI":"10.1016\/j.phpro.2012.03.206","volume":"25","author":"Y Li","year":"2012","unstructured":"Li Y, Wu H (2012) A clustering method based on k-means algorithm. Phys Proc 25:1104\u20131109","journal-title":"Phys Proc"},{"key":"7502_CR13","doi-asserted-by":"crossref","unstructured":"Vergani AA, Binaghi E (2018) A soft Davies\u2013Bouldin separation measure. In: 2018 IEEE International conference on fuzzy systems (FUZZ-IEEE), pp 1\u20138","DOI":"10.1109\/FUZZ-IEEE.2018.8491581"},{"key":"7502_CR14","doi-asserted-by":"crossref","unstructured":"Dutt A, Ismail MA, Herawan T, Targio IA (2024) Partition-based clustering algorithms applied to mixed data for educational data mining: a survey from 1971 to 2024. IEEE Access","DOI":"10.1109\/ACCESS.2024.3496929"},{"key":"7502_CR15","doi-asserted-by":"crossref","unstructured":"Ling LS, Weiling CT (2025) Enhancing segmentation: a comparative study of clustering methods. IEEE Access","DOI":"10.1109\/ACCESS.2025.3550339"},{"key":"7502_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2021.101804","volume":"101","author":"E Schubert","year":"2021","unstructured":"Schubert E, Rousseeuw PJ (2021) Fast and eager k-medoids clustering: O(k) runtime improvement of the PAM, CLARA, and CLARANS algorithms. Inform Syst 101:101804","journal-title":"Inform Syst"},{"key":"7502_CR17","doi-asserted-by":"crossref","unstructured":"Sharma A, Singh SK, Badwal E, Kumar S, Gupta BB, Arya V, Chui KT, Santaniello D (2023) Fuzzy based clustering of consumers\u2019 big data in industrial applications. In: 2023 IEEE International conference on consumer electronics (ICCE), pp 1\u20133","DOI":"10.1109\/ICCE56470.2023.10043451"},{"key":"7502_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11704-019-9059-3","volume":"15","author":"P Bhattacharjee","year":"2021","unstructured":"Bhattacharjee P, Mitra P (2021) A survey of density based clustering algorithms. Front Comput Sci 15:1\u201327","journal-title":"Front Comput Sci"},{"issue":"1","key":"7502_CR19","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.datak.2006.01.013","volume":"60","author":"D Birant","year":"2007","unstructured":"Birant D, Kut A (2007) ST-DBSCAN: an algorithm for clustering spatial\u2013temporal data. Data Knowl Eng 60(1):208\u2013221","journal-title":"Data Knowl Eng"},{"key":"7502_CR20","unstructured":"Xing Z, Zhao W (2023) Clustering structure identification with ordering graph"},{"key":"7502_CR21","unstructured":"Xing Z, Zhao W (2023) Block-diagonal structure learning for subspace clustering. Available at SSRN 5127314"},{"key":"7502_CR22","doi-asserted-by":"crossref","unstructured":"Xing Z, Zhao W (2024) Block-diagonal guided DBSCAN clustering. IEEE Trans Knowl Data Eng","DOI":"10.1109\/TKDE.2024.3401075"},{"key":"7502_CR23","doi-asserted-by":"crossref","unstructured":"Qiu T, Li C, Li Y (2018) D-NND: a hierarchical density clustering method via nearest neighbor descent. In: 2018 24th International conference on pattern recognition (ICPR), pp 1414\u20131419","DOI":"10.1109\/ICPR.2018.8545142"},{"key":"7502_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00500-025-10405-5","volume":"29","author":"U Kazemi","year":"2025","unstructured":"Kazemi U, Soleimani S (2025) A new approach data processing: density based spatial clustering of applications with noise (DBSCAN) clustering using game theory. Soft Comput 29:1\u201316","journal-title":"Soft Comput"},{"key":"7502_CR25","unstructured":"Jiang H, Jang J, Kpotufe S (2018) Quickshift++: Provably good initializations for sample-based mean shift. In: International conference on machine learning, pp 2294\u20132303"},{"key":"7502_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110657","volume":"146","author":"M Han","year":"2023","unstructured":"Han M, Lee J-S (2023) Graph-based density peak merging for identifying multi-peak clusters. Appl Soft Comput 146:110657","journal-title":"Appl Soft Comput"},{"key":"7502_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.122229","volume":"238","author":"Z Wei","year":"2024","unstructured":"Wei Z, Gao Y, Zhang X, Li X, Han Z (2024) Adaptive marine traffic behaviour pattern recognition based on multidimensional dynamic time warping and DBSCAN algorithm. Exp Syst Appl 238:122229","journal-title":"Exp Syst Appl"},{"key":"7502_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110742","volume":"147","author":"T Kim","year":"2023","unstructured":"Kim T, Lee J-S (2023) Band: Bagging noise detectors with application to semiconductor wafer denoising. Appl Soft Comput 147:110742","journal-title":"Appl Soft Comput"},{"key":"7502_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.patrec.2017.01.016","volume":"89","author":"Q Tong","year":"2017","unstructured":"Tong Q, Li X, Yuan B (2017) A highly scalable clustering scheme using boundary information. Pattern Recognit Lett 89:1\u20137","journal-title":"Pattern Recognit Lett"},{"key":"7502_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113690","volume":"161","author":"AA Abin","year":"2020","unstructured":"Abin AA, Vu V-V (2020) A density-based approach for querying informative constraints for clustering. Exp Syst Appl 161:113690","journal-title":"Exp Syst Appl"},{"key":"7502_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.124782","volume":"255","author":"SM Waqas","year":"2024","unstructured":"Waqas SM, Khan S, Talpur K, Khan RA (2024) Density peaks clustering based on gaussian fuzzy neighborhood with noise parameter. Exp Syst Appl 255:124782","journal-title":"Exp Syst Appl"},{"key":"7502_CR32","doi-asserted-by":"crossref","unstructured":"Dai B-R, Lin I-C (2012) Efficient map\/reduce-based DBSCAN algorithm with optimized data partition. In: 2012 IEEE Fifth international conference on cloud computing, pp 59\u201366","DOI":"10.1109\/CLOUD.2012.42"},{"key":"7502_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2021.102751","volume":"102","author":"C-EB Ncir","year":"2021","unstructured":"Ncir C-EB, Hamza A, Bouaguel W (2021) Parallel and scalable DUNN index for the validation of big data clusters. Parallel Comput 102:102751","journal-title":"Parallel Comput"},{"key":"7502_CR34","doi-asserted-by":"crossref","unstructured":"Luo G, Luo X, Gooch TF, Tian L, Qin K (2016) A parallel dbscan algorithm based on spark. In: 2016 IEEE International conferences on big data and cloud computing (BDCloud), social computing and networking (SocialCom), sustainable computing and communications (SustainCom)(BDCloud-SocialCom-SustainCom), pp 548\u2013553","DOI":"10.1109\/BDCloud-SocialCom-SustainCom.2016.85"},{"issue":"3","key":"7502_CR35","doi-asserted-by":"publisher","first-page":"209","DOI":"10.2478\/jaiscr-2020-0014","volume":"10","author":"A Starczewski","year":"2020","unstructured":"Starczewski A, Goetzen P, Er MJ (2020) A new method for automatic determining of the DBSCAN parameters. J Artif Intell Soft Comput Res 10(3):209\u2013221","journal-title":"J Artif Intell Soft Comput Res"},{"key":"7502_CR36","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.jpdc.2022.06.005","volume":"168","author":"G Wu","year":"2022","unstructured":"Wu G, Cao L, Tian H, Wang W (2022) HY-DBSCAN: A hybrid parallel DBSCAN clustering algorithm scalable on distributed-memory computers. J Parallel Distrib Comput 168:57\u201369","journal-title":"J Parallel Distrib Comput"},{"key":"7502_CR37","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1016\/j.ins.2022.06.027","volume":"607","author":"T Ouyang","year":"2022","unstructured":"Ouyang T, Shen X (2022) Online structural clustering based on DBSCAN extension with granular descriptors. Inform Sci 607:688\u2013704","journal-title":"Inform Sci"},{"key":"7502_CR38","doi-asserted-by":"crossref","unstructured":"Mahmud MS, Huang JZ, Ruby R, Ngueilbaye A, Wu K (2023) Approximate clustering ensemble method for big data. IEEE Trans Big Data","DOI":"10.1109\/TBDATA.2023.3255003"},{"key":"7502_CR39","doi-asserted-by":"publisher","first-page":"6214","DOI":"10.1007\/s11227-020-03524-3","volume":"77","author":"N Gholizadeh","year":"2021","unstructured":"Gholizadeh N, Saadatfar H, Hanafi N (2021) K-DBSCAN: An improved DBSCAN algorithm for big data. J Supercomput 77:6214\u20136235","journal-title":"J Supercomput"},{"key":"7502_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117501","volume":"203","author":"N Hanafi","year":"2022","unstructured":"Hanafi N, Saadatfar H (2022) A fast DBSCAN algorithm for big data based on efficient density calculation. Exp Syst Appl 203:117501","journal-title":"Exp Syst Appl"},{"key":"7502_CR41","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN\u201995-international conference on neural networks, vol 4, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"7502_CR42","doi-asserted-by":"crossref","unstructured":"Wadhwa A, Thakur MK (2018) Modified dbscan using particle swarm optimization for spatial hotspot identification. In: 2018 Eleventh international conference on contemporary computing (IC3), pp 1\u20133","DOI":"10.1109\/IC3.2018.8530558"},{"key":"7502_CR43","doi-asserted-by":"crossref","unstructured":"Sagiroglu S, Sinanc D (2013) Big data: a review. In: 2013 International conference on collaboration technologies and systems (CTS), pp 42\u201347","DOI":"10.1109\/CTS.2013.6567202"},{"issue":"7453","key":"7502_CR44","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1038\/498255a","volume":"498","author":"V Marx","year":"2013","unstructured":"Marx V (2013) The big challenges of big data. Nature 498(7453):255\u2013260","journal-title":"Nature"},{"key":"7502_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2025.102408","volume":"156","author":"G Keerthana","year":"2025","unstructured":"Keerthana G et al (2025) A survey on big data classification. Data Knowl Eng 156:102408","journal-title":"Data Knowl Eng"},{"key":"7502_CR46","doi-asserted-by":"crossref","unstructured":"Januzaj E, Kriegel H-P, Pfeifle M (2004) Scalable density-based distributed clustering. In: Knowledge discovery in databases: PKDD 2004: 8th European conference on principles and practice of knowledge discovery in databases, Pisa, Italy. Proceedings 8, pp 231\u2013244, Springer: Berlin","DOI":"10.1007\/978-3-540-30116-5_23"},{"key":"7502_CR47","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.neucom.2015.05.109","volume":"171","author":"Y Lv","year":"2016","unstructured":"Lv Y, Ma T, Tang M, Cao J, Tian Y, Al-Dhelaan A, Al-Rodhaan M (2016) An efficient and scalable density-based clustering algorithm for datasets with complex structures. Neurocomputing 171:9\u201322","journal-title":"Neurocomputing"},{"key":"7502_CR48","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.future.2024.03.042","volume":"157","author":"E Cesario","year":"2024","unstructured":"Cesario E, Lindia P, Vinci A (2024) A scalable multi-density clustering approach to detect city hotspots in a smart city. Future Gener Comput Syst 157:226\u2013236","journal-title":"Future Gener Comput Syst"},{"key":"7502_CR49","doi-asserted-by":"crossref","unstructured":"Zeng G, Peng H, Li A, Wu J, Liu C, Yu PS (2024) Scalable semi-supervised clustering via structural entropy with different constraints. IEEE Trans Knowl Data Eng","DOI":"10.1137\/1.9781611978032.24"},{"key":"7502_CR50","doi-asserted-by":"crossref","unstructured":"Chouikhi H, Charrad M, Ghazzali N (2015) A comparison study of clustering validity indices. In: 2015 Global summit on computer & information technology (GSCIT), pp 1\u20134","DOI":"10.1109\/GSCIT.2015.7353330"},{"key":"7502_CR51","doi-asserted-by":"publisher","DOI":"10.1017\/9781108564175","volume-title":"Data mining and machine learning: fundamental concepts and algorithms","author":"MJ Zaki","year":"2020","unstructured":"Zaki MJ, Meira W Jr, Meira W (2020) Data mining and machine learning: fundamental concepts and algorithms. Cambridge University Press, Cambridge"},{"key":"7502_CR52","unstructured":"Markelle Kelly KN, Rachel L: The UCI machine learning repository datasets"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07502-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07502-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07502-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T05:20:25Z","timestamp":1751520025000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07502-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,3]]},"references-count":52,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2025,7]]}},"alternative-id":["7502"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07502-5","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,3]]},"assertion":[{"value":"24 May 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author declares that there is no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"1104"}}