{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T13:23:42Z","timestamp":1777555422115,"version":"3.51.4"},"reference-count":46,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T00:00:00Z","timestamp":1751846400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T00:00:00Z","timestamp":1751846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Data Science"],"published-print":{"date-parts":[[2025,8]]},"abstract":"<jats:p>\n                    This research introduces an enhanced stratified sampling-density-based spatial clustering of applications with noise (SS-DBSCAN), a scalable and robust density-based clustering algorithm designed to tackle challenges in high-dimensional and complex data analysis. The algorithm integrates advanced parameter optimization techniques to improve clustering accuracy and interpretability. Key innovations include a fast grid search method for optimizing the search of optimal minimum points (MinPts) by keeping the\n                    <jats:inline-formula>\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                        <mml:mi>\u03f5<\/mml:mi>\n                      <\/mml:math>\n                    <\/jats:inline-formula>\n                    parameter obtained constant. Notably, this study emphasizes the often-overlooked MinPts parameter, introducing a dynamic approach that initiates by calculating density metrics within a specified\n                    <jats:inline-formula>\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                        <mml:mi>\u03f5<\/mml:mi>\n                      <\/mml:math>\n                    <\/jats:inline-formula>\n                    distance and adjusting the MinPts range based on the standard deviation of these metrics. This approach identifies optimal MinPts values based on the maximum allowed range. Comprehensive experiments on five real-world datasets demonstrate SS-DBSCAN\u2019s superior performance compared to density-based spatial clustering of applications with noise (DBSCAN), hierarchical DBSCAN, and ordering points to identify the clustering structure\u00a0(OPTICS), evidenced by higher silhouette and Davies\u2013Bouldin index scores. The results highlight SS-DBSCAN\u2019s ability to capture intrinsic clustering structures accurately, providing deeper insights across various research domains. SS-DBSCAN\u2019s scalability and adaptability to diverse data densities make it a valuable tool for analyzing large, complex datasets.\n                  <\/jats:p>","DOI":"10.1177\/24518492251349080","type":"journal-article","created":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T01:53:57Z","timestamp":1751939637000},"update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Enhanced Stratified Sampling-Density-Based Spatial Clustering of Applications With Noise (SS-DBSCAN) for High-Dimensional Data"],"prefix":"10.1177","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2414-5004","authenticated-orcid":false,"given":"Gloriana","family":"Monko","sequence":"first","affiliation":[{"name":"Department of Functional Control Systems, Shibaura Institute of Technology, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3991-4259","authenticated-orcid":false,"given":"Masaomi","family":"Kimura","sequence":"additional","affiliation":[{"name":"School of Engineering, Shibaura Institute of Technology, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2025,7,7]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/wics.101"},{"key":"e_1_3_3_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3457587"},{"key":"e_1_3_3_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/304181.304187"},{"key":"e_1_3_3_5_1","unstructured":"Arya A. Abhishek Arya R. B. E. (2019). Exploratory data analysis of intensive care unit patients using MIMIC-III database. https:\/\/www.minsal.cl\/wp-content\/uploads\/2019\/01\/2019.01.23_PLAN-NACIONAL-DE-CANCER_web.pdf."},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-014-0413-9"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ascom.2024.100851"},{"key":"e_1_3_3_8_1","doi-asserted-by":"crossref","unstructured":"Gan J. Tao Y. (2015). DBSCAN revisited: Mis-claim un-fixability and approximation. In Proceedings of the 2015 ACM SIGMOD international conference on management of data (pp. 519\u2013530). https:\/\/doi.org\/10.1145\/2723372.2737792","DOI":"10.1145\/2723372.2737792"},{"key":"e_1_3_3_9_1","article-title":"Elbow method vs silhouette co-efficient in determining the number of clusters","author":"Habib A. B.","year":"2021","unstructured":"Habib A. B. (2021). Elbow method vs silhouette co-efficient in determining the number of clusters. BRAC University Journal of Humanities and Social Sciences (BUJHSS) and Bangladesh Journal of Academy of Sciences, https:\/\/doi.org\/10.13140\/RG.2.2.27982.79688","journal-title":"BRAC University Journal of Humanities and Social Sciences (BUJHSS) and Bangladesh Journal of Academy of Sciences"},{"key":"e_1_3_3_10_1","first-page":"14690","article-title":"Language models as hierarchy encoders","volume":"37","author":"He Y.","year":"2024","unstructured":"He Y., Yuan Z., Chen J., Horrocks I. (2024). Language models as hierarchy encoders. Advances in Neural Information Processing Systems, 37, 14690\u2013147111. https:\/\/doi.org\/10.5281\/zenodo.10511042.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_3_11_1","doi-asserted-by":"crossref","unstructured":"Hui A. Gao B. J. (2021). When is nearest neighbor meaningful: Sequential data. In Proceedings of the 30th ACM international conference on information & knowledge management (pp. 3103\u20133106). https:\/\/doi.org\/10.1145\/3459637.3482219","DOI":"10.1145\/3459637.3482219"},{"key":"e_1_3_3_12_1","doi-asserted-by":"crossref","unstructured":"Iavindrasana J. Cohen G. Depeursinge A. M\u00fcller H. Meyer R. Geissbuhler A. (2009). Clinical data mining: A review. In Yearbook of medical informatics (pp. 121\u2013133). Georg Thieme Verlag KG. https:\/\/doi.org\/10.1055\/s-0038-1638651","DOI":"10.1055\/s-0038-1638651"},{"key":"e_1_3_3_13_1","unstructured":"Jayanthi S. M. Embar V. Raghunathan K. (2021). Evaluating pretrained transformer models for entity linking in task-oriented dialog. http:\/\/arxiv.org\/abs\/2112.08327"},{"key":"e_1_3_3_14_1","doi-asserted-by":"crossref","unstructured":"Kanagala H. K. Jaya Rama Krishnaiah V. V. (2016). A comparative study of K-means DBSCAN and OPTICS. In 2016 International conference on computer communication informatics ICCCI 2016 (pp. 1\u20136). IEEE.\u00a0https:\/\/doi.org\/10.1109\/ICCCI.2016.7479923","DOI":"10.1109\/ICCCI.2016.7479923"},{"key":"e_1_3_3_15_1","doi-asserted-by":"publisher","DOI":"10.5120\/15890-5059"},{"key":"e_1_3_3_16_1","doi-asserted-by":"crossref","unstructured":"Khan M. M. R. Siddique M. A. B. Arif R. B. Oishe M. R. (2018). ADBSCAN: Adaptive density-based spatial clustering of applications with noise for identifying clusters with varying densities. In 4th International conference on electrical engineering and information & communication technology iCEEiCT 2018 (pp. 107\u2013111). IEEE.\u00a0https:\/\/doi.org\/10.1109\/CEEICT.2018.8628138","DOI":"10.1109\/CEEICT.2018.8628138"},{"key":"e_1_3_3_17_1","unstructured":"Korea R. Zahran A. (2022). UNLPSat TextGraphs-16 natural language premise selection task: Unsupervised natural language premise selection in mathematical text using sentence-MPNet.\u00a0https:\/\/hdl.handle.net\/10468\/13837"},{"key":"e_1_3_3_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2931334"},{"key":"e_1_3_3_19_1","doi-asserted-by":"crossref","unstructured":"Liu Y. Li Z. Xiong H. Gao X. Wu J. (2010). Understanding of internal clustering validation measures. In Proceeding \u2013 IEEE international conference on data mining ICDM (pp. 911\u2013916). IEEE.\u00a0https:\/\/doi.org\/10.1109\/ICDM.2010.35","DOI":"10.1109\/ICDM.2010.35"},{"key":"e_1_3_3_20_1","unstructured":"Martin Ester X. X. Kriegel H.-P. Sander J. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. In KDD-96 proceedings (pp. 226\u2013231).\u00a0AAAI Press. https:\/\/dl.acm.org\/doi\/10.5555\/3001460.3001507"},{"key":"e_1_3_3_21_1","unstructured":"McInnes L. Healy J. Melville J. (2018). UMAP: Uniform manifold approximation and projection for dimension reduction. arXiv preprint vol. 1802.03426. https:\/\/doi.org\/10.48550\/arXiv.1802.03426"},{"key":"e_1_3_3_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.forsciint.2020.110194"},{"key":"e_1_3_3_23_1","doi-asserted-by":"crossref","unstructured":"Mollura M. Mantoan G. Romano S. Lehman L. W. Mark R. G. Barbieri R. (2020). The role of waveform monitoring in sepsis identification within the first hour of intensive care unit stay. In 2020 11th conference of the European study group on cardiovascular oscillations computation and modelling in physiology: New challenges and opportunities ESGCO 2020 (pp. 1\u20139). IEEE.\u00a0https:\/\/doi.org\/10.1109\/ESGCO49734.2020.9158013","DOI":"10.1109\/ESGCO49734.2020.9158013"},{"key":"e_1_3_3_24_1","first-page":"43","article-title":"Optimized DBSCAN parameter selection: Stratified sampling for epsilon and GridSearch for minimum samples","author":"Monko G. J.","year":"2023","unstructured":"Monko G. J., Kimura M. (2023). Optimized DBSCAN parameter selection: Stratified sampling for epsilon and GridSearch for minimum samples. Computer Science & Information Technology (CS & IT), 43\u201361. https:\/\/doi.org\/10.5121\/csit.2023.132004","journal-title":"Computer Science & Information Technology (CS & IT)"},{"key":"e_1_3_3_25_1","doi-asserted-by":"crossref","unstructured":"Monko G. J. Kimura M. (2023). SS-DBSCAN: Epsilon estimation with stratified sampling for density-based spatial clustering of applications with noise. In Proceeding 2023 international conference on automation control and electronics engineering CACEE 2023 (pp. 72\u201376). IEEE. https:\/\/doi.org\/10.1109\/CACEE61121.2023.00023","DOI":"10.1109\/CACEE61121.2023.00023"},{"key":"e_1_3_3_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1470-2045(19)30149-4"},{"key":"e_1_3_3_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2009.05.008"},{"key":"e_1_3_3_28_1","doi-asserted-by":"crossref","unstructured":"Pareek J. Jacob J. (2020). Data compression and visualization using PCA and T-SNE. In Advances in information communication technology and computing\u00a0(pp. 327\u2013337). Springer Nature Singapore Pte Ltd. https:\/\/doi.org\/10.1007\/978-981-15-5421-6_34","DOI":"10.1007\/978-981-15-5421-6_34"},{"key":"e_1_3_3_29_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0056883"},{"key":"e_1_3_3_30_1","doi-asserted-by":"publisher","DOI":"10.5120\/739-1038"},{"key":"e_1_3_3_31_1","doi-asserted-by":"crossref","unstructured":"Reimers N. Gurevych I. (2019). Sentence-BERT: Sentence embeddings using siamese BERT-networks. In EMNLP-IJCNLP 2019\u20142019 conference on empirical methods in natural language processing 9th international joint conference on natural language (pp. 3982\u20133992).\u00a0Cornell University.\u00a0https:\/\/doi.org\/10.18653\/v1\/d19-1410","DOI":"10.18653\/v1\/D19-1410"},{"key":"e_1_3_3_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.12.015"},{"key":"e_1_3_3_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"e_1_3_3_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/CIC.2002.1166854"},{"key":"e_1_3_3_35_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009745219419"},{"key":"e_1_3_3_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3068335"},{"key":"e_1_3_3_37_1","doi-asserted-by":"crossref","unstructured":"Shah G. H. (2012). An improved DBSCAN a density based clustering algorithm with parameter selection for high dimensional data sets. In 3rd Nirma university international conference on engineering NUiCONE 2012 (pp. 1\u20136). IEEE. https:\/\/doi.org\/10.1109\/NUICONE.2012.6493211","DOI":"10.1109\/NUICONE.2012.6493211"},{"key":"e_1_3_3_38_1","unstructured":"Shah R. Silwal S. (2019). Using dimensionality reduction to optimize t-SNE. http:\/\/arxiv.org\/abs\/1912.01098"},{"key":"e_1_3_3_39_1","doi-asserted-by":"publisher","DOI":"10.3390\/app14041352"},{"issue":"7","key":"e_1_3_3_40_1","first-page":"44","article-title":"The clustering validity with silhouette and sum of squared errors","volume":"3","author":"Thinsungnoen T.","year":"2015","unstructured":"Thinsungnoen T., Kaoungku N., Durongdumronchai P., Kerdprasop K., Kerdprasop N. (2015). The clustering validity with silhouette and sum of squared errors. Learning, 3(7), 44\u201351. https:\/\/doi.org\/10.12792\/iciae2015.012","journal-title":"Learning"},{"key":"e_1_3_3_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scs.2018.11.031"},{"key":"e_1_3_3_42_1","doi-asserted-by":"crossref","unstructured":"Wang S. McDermott M. B. A. Chauhan G. Ghassemi M. Hughes M. C. Naumann T. (2020). MIMIC-Extract. In ACM CHIL 2020\u2014proceedings of the 2020 ACM conference on health inference and learning (pp. 222\u2013235). Association for Computing Machinery.\u00a0https:\/\/doi.org\/10.1145\/3368555.3384469","DOI":"10.1145\/3368555.3384469"},{"key":"e_1_3_3_43_1","doi-asserted-by":"crossref","unstructured":"Winslett M. (Ed.). (2009). Scientific and statistical database management: Proceedings of the 21st International Conference SSDBM 2009 New Orleans LA USA June 2\u20134 2009 (Lecture Notes in Computer Science Vol. 5566). Springer. https:\/\/link.springer.com\/book\/10.1007\/978-3-642-02279-1","DOI":"10.1007\/978-3-642-02279-1"},{"issue":"3","key":"e_1_3_3_44_1","first-page":"1099","article-title":"Davies Bouldin index algorithm for optimizing clustering case studies mapping school facilities","volume":"10","author":"Wijaya Y. A.","year":"2021","unstructured":"Wijaya Y. A., Kurniady D. A., Setyanto E., Tarihoran W. S., Rusmana D., Rahim R. (2021). Davies Bouldin index algorithm for optimizing clustering case studies mapping school facilities. TEM Journal \u2013 Technology, Education, Management, Informatics, 10(3), 1099\u20131103.\u00a0https:\/\/doi.org\/10.18421\/TEM103-13","journal-title":"TEM Journal \u2013 Technology, Education, Management, Informatics"},{"key":"e_1_3_3_45_1","doi-asserted-by":"publisher","DOI":"10.1186\/s40779-021-00338-z"},{"key":"e_1_3_3_46_1","doi-asserted-by":"publisher","DOI":"10.4103\/0366-6999.178019"},{"key":"e_1_3_3_47_1","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11161"}],"container-title":["Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/24518492251349080","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/24518492251349080","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/24518492251349080","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T18:10:12Z","timestamp":1777399812000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/24518492251349080"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,7]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["10.1177\/24518492251349080"],"URL":"https:\/\/doi.org\/10.1177\/24518492251349080","relation":{},"ISSN":["2451-8484","2451-8492"],"issn-type":[{"value":"2451-8484","type":"print"},{"value":"2451-8492","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,7]]},"article-number":"24518492251349080"}}