{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:16Z","timestamp":1740122416669,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,24]],"date-time":"2022-12-24T00:00:00Z","timestamp":1671840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,24]],"date-time":"2022-12-24T00:00:00Z","timestamp":1671840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100006606","name":"Natural Science Foundation of Tianjin","doi-asserted-by":"crossref","award":["18JCYBJC19300"],"award-info":[{"award-number":["18JCYBJC19300"]}],"id":[{"id":"10.13039\/501100006606","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61873188","32171902"],"award-info":[{"award-number":["61873188","32171902"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s10586-022-03917-4","type":"journal-article","created":{"date-parts":[[2022,12,24]],"date-time":"2022-12-24T13:02:27Z","timestamp":1671886947000},"page":"137-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SRG: a clustering algorithm based on scale division and region growing"],"prefix":"10.1007","volume":"27","author":[{"given":"Yunwei","family":"Jia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keke","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xia","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenxiang","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,24]]},"reference":[{"key":"3917_CR1","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1016\/j.neucom.2017.09.023","volume":"275","author":"XL Li","year":"2017","unstructured":"Li, X.L., Han, Q., Qiu, B.Z.: A clustering algorithm using skewness-based boundary detection. Neurocomputing 275, 618\u2013626 (2017). https:\/\/doi.org\/10.1016\/j.neucom.2017.09.023","journal-title":"Neurocomputing"},{"key":"3917_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.patrec.2018.01.015","volume":"104","author":"SA Mondal","year":"2018","unstructured":"Mondal, S.A.: An improved approximation algorithm for hierarchical clustering. Pattern Recogn. Lett. 104, 23\u201328 (2018). https:\/\/doi.org\/10.1016\/j.patrec.2018.01.015","journal-title":"Pattern Recogn. Lett."},{"key":"3917_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.neucom.2018.01.006","volume":"284","author":"HZ Chen","year":"2018","unstructured":"Chen, H.Z., Wang, W.W., Feng, X.C., He, R.Q.: Discriminative and coherent subspace clustering. Neurocomputing 284, 177\u2013186 (2018). https:\/\/doi.org\/10.1016\/j.neucom.2018.01.006","journal-title":"Neurocomputing"},{"issue":"4","key":"3917_CR4","doi-asserted-by":"publisher","first-page":"649","DOI":"10.13195\/j.kzyjc.2017.0150","volume":"33","author":"HL Li","year":"2018","unstructured":"Li, H.L., Wang, C., Deng, X.Y.: Multivariate time series clustering based on affinity propagation of component attributes. Control Decis. 33(4), 649\u2013656 (2018). https:\/\/doi.org\/10.13195\/j.kzyjc.2017.0150","journal-title":"Control Decis."},{"issue":"11","key":"3917_CR5","doi-asserted-by":"publisher","first-page":"1962","DOI":"10.16383\/j.aas.2017.c160443","volume":"43","author":"XL Li","year":"2017","unstructured":"Li, X.L., Cao, X.F., Qiu, B.Z.: Clustering boundary pattern discovery for high dimensional space base on matrix model. Acta Autom. Sin. 43(11), 1962\u20131972 (2017). https:\/\/doi.org\/10.16383\/j.aas.2017.c160443","journal-title":"Acta Autom. Sin."},{"issue":"8","key":"3917_CR6","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.13195\/j.kzyjc.2017.0485","volume":"33","author":"Q Zhang","year":"2018","unstructured":"Zhang, Q., Fang, Z.G., Cai, J.J., Liu, S.F.: Generalized interval grey entropy-weight clustering model based on multiple heterogeneous uncertainty cases study. Control Decis. 33(8), 1481\u20131488 (2018). https:\/\/doi.org\/10.13195\/j.kzyjc.2017.0485","journal-title":"Control Decis."},{"unstructured":"Macqueen, J.: Some methods for classification and analysis of multivariate observations. In: Procee-dings of 5th Berkeley Symposium on Mathematical Statistics and Probability, pp. 281\u2013297. University of California Press, Berkeley (1967)","key":"3917_CR7"},{"issue":"2\u20133","key":"3917_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0098-3004(84)90020-7","volume":"10","author":"JC Bezdek","year":"1984","unstructured":"Bezdek, J.C., Ehrlich, R., Full, W.: FCM: The fuzzy c-means clustering algorithm. Comput. Geosci. 10(2\u20133), 191\u2013203 (1984). https:\/\/doi.org\/10.1016\/0098-3004(84)90020-7","journal-title":"Comput. Geosci."},{"unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.W.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96), pp. 226\u2013231. AAAI Press, Portland (1996)","key":"3917_CR9"},{"unstructured":"10.Wang, W.H., Yang, J.J., Muntz, R.: STING: A statistical information grid approach to spatial data mi-ning. In: VLDB'97, Proceedings of 23rd International Conference on Very Large Data Bases, pp. 186\u2013195. Morgan Kaufmann, Athens (1997)","key":"3917_CR10"},{"issue":"2","key":"3917_CR11","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/276304.276314","volume":"27","author":"R Agrawal","year":"1998","unstructured":"Agrawal, R., Gehrke, J.E., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dim-ensional data for data mining applications. Data Min. Knowl. Disc. 27(2), 94\u2013105 (1998). https:\/\/doi.org\/10.1145\/276304.276314","journal-title":"Data Min. Knowl. Disc."},{"key":"3917_CR12","doi-asserted-by":"publisher","first-page":"105763","DOI":"10.1016\/j.asoc.2019.105763","volume":"84","author":"HL Xie","year":"2019","unstructured":"Xie, H.L., Zhang, L., Lim, C.P., Yu, Y.H., Liu, H., Walters, J.: Improving K-means clustering with en-hanced Firefly Algorithms. Appl. Soft Comput. 84, 105763 (2019). https:\/\/doi.org\/10.1016\/j.asoc.2019.105763","journal-title":"Appl. Soft Comput."},{"issue":"9","key":"3917_CR13","doi-asserted-by":"publisher","first-page":"10541","DOI":"10.1007\/s10489-021-02934-x","volume":"52","author":"A Kaur","year":"2022","unstructured":"Kaur, A., Kumar, Y.: Neighborhood search based improved bat algorithm for data clustering. Appl. Intell. 52(9), 10541\u201310575 (2022). https:\/\/doi.org\/10.1007\/s10489-021-02934-x","journal-title":"Appl. Intell."},{"issue":"19","key":"3917_CR14","doi-asserted-by":"publisher","first-page":"2390","DOI":"10.3390\/math9192390","volume":"9","author":"PH Huang","year":"2021","unstructured":"Huang, P.H., Yao, P., Hao, Z.D., Peng, H.H., Guo, L.K.: Improved constrained K-Means algorithm f-or clustering with domain knowledge. Mathematics 9(19), 2390 (2021). https:\/\/doi.org\/10.3390\/math9192390","journal-title":"Mathematics"},{"issue":"10","key":"3917_CR15","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1007\/s00521-016-2786-6","volume":"28","author":"ZH Wu","year":"2018","unstructured":"Wu, Z.H., Wu, Z.C., Zhang, J.: An improved FCM algorithm with adaptive weights based on SA-PSO. Neural Comput. Appl. 28(10), 3113\u20133118 (2018). https:\/\/doi.org\/10.1007\/s00521-016-2786-6","journal-title":"Neural Comput. Appl."},{"issue":"8","key":"3917_CR16","doi-asserted-by":"publisher","first-page":"9521","DOI":"10.1007\/s10489-021-02801-9","volume":"52","author":"JH Hu","year":"2022","unstructured":"Hu, J.H., Yin, H.L., Wei, G.L., Song, Y.: An improved FCM clustering algorithm with adaptive weig-hts based on PSO-TVAC algorithm. Appl. Intell. 52(8), 9521\u20139536 (2022). https:\/\/doi.org\/10.1007\/s10489-021-02801-9","journal-title":"Appl. Intell."},{"issue":"6","key":"3917_CR17","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1109\/TKDE.2017.2787640","volume":"30","author":"A Bryant","year":"2018","unstructured":"Bryant, A., Cios, K.: RNN-DBSCAN: A density-based clustering algorithm using reverse nearest ne-ighbor density estimates. IEEE Trans. Knowl. Data Eng. 30(6), 1109\u20131121 (2018). https:\/\/doi.org\/10.1109\/TKDE.2017.2787640","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3917_CR18","doi-asserted-by":"publisher","first-page":"115763","DOI":"10.1016\/j.eswa.2021.115763","volume":"186","author":"LH Hu","year":"2021","unstructured":"Hu, L.H., Liu, H.K., Zhang, J.F., Liu, A.Q.: KR-DBSCAN: A density-based clustering algorithm bas-ed on reverse nearest neighbor and influence space. Expert Syst. Appl. 186, 115763 (2021). https:\/\/doi.org\/10.1016\/j.eswa.2021.115763","journal-title":"Expert Syst. Appl."},{"issue":"5","key":"3917_CR19","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1002\/spe.3060","volume":"52","author":"J He","year":"2021","unstructured":"He, J., Zhou, J., Wang, H.Y., Cai, L.: DACA: distributed adaptive grid decision graph based clusteri-ng algorithm. Softw. Pract. Exp. 52(5), 1199\u20131215 (2021). https:\/\/doi.org\/10.1002\/spe.3060","journal-title":"Softw. Pract. Exp."},{"key":"3917_CR20","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.neucom.2022.01.089","volume":"481","author":"MC Cheng","year":"2022","unstructured":"Cheng, M.C., Ma, T.F., Ma, L., Yuan, L., Yan, Q.J.: Adaptive grid-based forest-like clustering algorit-hm. Neurocomputing 481, 168\u2013181 (2022). https:\/\/doi.org\/10.1016\/j.neucom.2022.01.089","journal-title":"Neurocomputing"},{"key":"3917_CR21","doi-asserted-by":"publisher","first-page":"116143","DOI":"10.1016\/j.eswa.2021.116143","volume":"191","author":"L Ma","year":"2022","unstructured":"Ma, L., Zhang, Y., Leiva, V., Liu, S.Z., Ma, T.F.: A new clustering algorithm based on a radar scanni-ng strategy with applications to machine learning data. Expert Syst. Appl. 191, 116143 (2022). https:\/\/doi.org\/10.1016\/j.eswa.2021.116143","journal-title":"Expert Syst. Appl."},{"key":"3917_CR22","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3142806","author":"B Yang","year":"2022","unstructured":"Yang, B., Zhang, X.T., Nie, F.P., Chen, B.D., Wang, F., Nan, Z.X., Zheng, N.N.: ECCA: efficient co-rrentropy-based clustering algorithm with orthogonal concept factorization. IEEE Trans. Neural Netw. Learn. Syst. (2022). https:\/\/doi.org\/10.1109\/TNNLS.2022.3142806","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"3917_CR23","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.1109\/ACCESS.2017.2780109","volume":"6","author":"J Wang","year":"2017","unstructured":"Wang, J., Zhu, C., Zhou, Y., Zhu, X.Q., Wang, Y.L., Zhang, W.M.: From partition-based clustering to density-based clustering: fast find clusters with diverse shapes and densities in spatial databases. IEEE Access 6, 1718\u20131729 (2017). https:\/\/doi.org\/10.1109\/ACCESS.2017.2780109","journal-title":"IEEE Access"},{"issue":"2","key":"3917_CR24","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.: BIRCH. ACM. SIGMOD Rec. 25(2), 103\u2013114 (1996). https:\/\/doi.org\/10.1145\/235968.233324","journal-title":"SIGMOD Rec."},{"issue":"5","key":"3917_CR25","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/S0306-4379(00)00022-3","volume":"25","author":"S Guha","year":"2000","unstructured":"Guha, S., Rastogi, R., Shim, K.: ROCK: a robust clustering algorithm for categorical attributes. Inf. Syst. 25(5), 345\u2013366 (2000). https:\/\/doi.org\/10.1016\/S0306-4379(00)00022-3","journal-title":"Inf. Syst."},{"issue":"8","key":"3917_CR26","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G Karypis","year":"1999","unstructured":"Karypis, G., Han, E.H., Kumar, V.: Chameleon: hierarchical clustering using dynamic modeling. Computer 32(8), 68\u201375 (1999). https:\/\/doi.org\/10.1109\/2.781637","journal-title":"Computer"},{"issue":"1","key":"3917_CR27","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0306-4379(01)00008-4","volume":"26","author":"S Guha","year":"2001","unstructured":"Guha, S., Rastogi, R., Shim, K.: CURE: an efficient clustering algorithm for large databases. Inf. Syst. 26(1), 35\u201358 (2001). https:\/\/doi.org\/10.1016\/S0306-4379(01)00008-4","journal-title":"Inf. Syst."},{"key":"3917_CR28","doi-asserted-by":"publisher","first-page":"108305","DOI":"10.1016\/j.patcog.2021.108305","volume":"122","author":"AU Rehman","year":"2021","unstructured":"Rehman, A.U., Belhaouari, S.B.: Divide well to merge better: a novel clustering algorithm. Pattern Recogn. 122, 108305 (2021). https:\/\/doi.org\/10.1016\/j.patcog.2021.108305","journal-title":"Pattern Recogn."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-022-03917-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-022-03917-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-022-03917-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,24]],"date-time":"2024-02-24T16:09:34Z","timestamp":1708790974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-022-03917-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,24]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["3917"],"URL":"https:\/\/doi.org\/10.1007\/s10586-022-03917-4","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2022,12,24]]},"assertion":[{"value":"24 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}