{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T19:01:48Z","timestamp":1774638108894,"version":"3.50.1"},"reference-count":53,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2017,8,30]],"date-time":"2017-08-30T00:00:00Z","timestamp":1504051200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"The Ministry of Science and Technology of China","award":["2014BAL05B07"],"award-info":[{"award-number":["2014BAL05B07"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJGI"],"abstract":"<jats:p>An adaptive spatial clustering (ASC) algorithm is proposed in this present study, which employs sweep-circle techniques and a dynamic threshold setting based on the Gestalt theory to detect spatial clusters. The proposed algorithm can automatically discover clusters in one pass, rather than through the modification of the initial model (for example, a minimal spanning tree, Delaunay triangulation, or Voronoi diagram). It can quickly identify arbitrarily-shaped clusters while adapting efficiently to non-homogeneous density characteristics of spatial data, without the need for prior knowledge or parameters. The proposed algorithm is also ideal for use in data streaming technology with dynamic characteristics flowing in the form of spatial clustering in large data sets.<\/jats:p>","DOI":"10.3390\/ijgi6090272","type":"journal-article","created":{"date-parts":[[2017,8,30]],"date-time":"2017-08-30T10:40:00Z","timestamp":1504089600000},"page":"272","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An Adaptive Sweep-Circle Spatial Clustering Algorithm Based on Gestalt"],"prefix":"10.3390","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5619-6610","authenticated-orcid":false,"given":"Qingming","family":"Zhan","sequence":"first","affiliation":[{"name":"School of Urban Design, Wuhan University, 129 Luoyu Road, Wuhan 430079, China"},{"name":"Collaborative Innovation Center of Geospatial Technology, 129 Luoyu Road, Wuhan 430079, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuguang","family":"Deng","sequence":"additional","affiliation":[{"name":"School of Urban Design, Wuhan University, 129 Luoyu Road, Wuhan 430079, China"},{"name":"Collaborative Innovation Center of Geospatial Technology, 129 Luoyu Road, Wuhan 430079, China"},{"name":"Department of Civil and Surveying Engineering, Guilin University of Technology at Nanning, 15 Anji Road, Nanning 532100, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihua","family":"Zheng","sequence":"additional","affiliation":[{"name":"Land and Resources Information Center of Guangxi Province, 2 Zhongxin Road, Nanning 530028, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2017,8,30]]},"reference":[{"key":"ref_1","unstructured":"Han, J., Kamber, M., and Pei, J. (2012). Data Mining, Morgan Kaufmann. [3rd ed.]."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/j.asoc.2017.04.031","article-title":"A novel cluster center fast determination clustering algorithm","volume":"57","author":"Chen","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/j.compenvurbsys.2011.02.003","article-title":"An adaptive spatial clustering algorithm based on Delaunay triangulation","volume":"35","author":"Deng","year":"2011","journal-title":"Comput. Environ. Urban Syst."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.cageo.2013.03.002","article-title":"Adaptive spatial clustering in the presence of obstacles and facilitators","volume":"56","author":"Liu","year":"2013","journal-title":"Comput. Geosci."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"2785","DOI":"10.1016\/j.eswa.2014.09.054","article-title":"Efficient agglomerative hierarchical clustering","volume":"42","author":"Bouguettaya","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"ref_6","unstructured":"MacQueen, J. (July, January 21). Some Methods for Classification and Analysis of Multivariate Observations. Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, CA, USA."},{"key":"ref_7","unstructured":"Ng, R.T., and Han, J. (1994, January 12\u201315). Efficient and effective clustering methods for spatial data mining. Proceedings of the 20th International Conference on Very Large Data Bases, Santiago de Chile, Chile."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0306-4379(01)00008-4","article-title":"Cure: An efficient clustering algorithm for large databases","volume":"26","author":"Guha","year":"1998","journal-title":"Inf. Syst."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Zhang, T. (1999, January 4\u20136). Birch: An efficient data clustering method for very large databases. Proceedings of the 1996 ACM SIGMOD international conference on Management of data, Montreal, QC, Canada.","DOI":"10.1145\/233269.233324"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/2.781637","article-title":"Chameleon: Hierarchical clustering using dynamic modeling","volume":"32","author":"Karypis","year":"1999","journal-title":"Computer"},{"key":"ref_11","unstructured":"Ester, M., Kriegel, H.-P., Sander, J., and Xu, X. (1996, January 2\u20134). A density-based algorithm for discovering clusters in large spatial databases with noise. Proceedings of the 2nd International Conference on Knowledge Discovery and Date Mining, Portland, OR, USA."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Ankerst, M., Breunig, M.M., Kriegel, H.-P., and Sander, J. (June, January 31). Optics: Ordering points to identify the clustering structure. Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data, Philadelphia, PA, USA.","DOI":"10.1145\/304182.304187"},{"key":"ref_13","unstructured":"Hinneburg, A., and Keim, D.A. (1998, January 27\u201331). An Efficient Approach to Clustering in Large Multimedia Databases with Noise. Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining, New York, NY, USA."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/T-C.1971.223083","article-title":"Graph-theoretical methods for detecting and describing gestalt clusters","volume":"C-20","author":"Zahn","year":"1971","journal-title":"IEEE Trans. Comput."},{"key":"ref_15","unstructured":"Estivill-Castro, V., and Lee, I. (2000, January 23\u201325). Autoclust: Automatic clustering via boundary extraction for mining massive point-data sets. Proceedings of the 5th International Conference on Geocomputation, London, UK."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Kang, I.-S., Kim, T.-W., and Li, K.-J. (1997, January 10\u201314). A spatial data mining method by delaunay triangulation. Proceedings of the 5th ACM International Workshop on Advances in Geographic Information Systems, Las Vegas, NV, USA.","DOI":"10.1145\/267825.267836"},{"key":"ref_17","unstructured":"Wang, W., Yang, J., and Muntz, R.R. (1997, January 25\u201329). Sting: A statistical information grid approach to spatial data mining. Proceedings of the 23rd International Conference on Very Large Data Bases, Athens, Greece."},{"key":"ref_18","unstructured":"Sheikholeslami, G., Chatterjee, S., and Zhang, A. (1998, January 24\u201327). Wavecluster: A multi-resolution clustering approach for very large spatial databases. Proceedings of the 24rd International Conference on Very Large Data Bases, New York, NY, USA."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the em algorithm","volume":"39","author":"Dempster","year":"1977","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0004-3702(89)90046-5","article-title":"Models of incremental concept formation","volume":"40","author":"Gennari","year":"1989","journal-title":"Artif. Intell."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF00337288","article-title":"Self-organized formation of topologically correct feature maps","volume":"43","author":"Kohonen","year":"1982","journal-title":"Biol. Cybern."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Schikuta, E. (1996, January 25\u201329). Grid-clustering: An efficient hierarchical clustering method for very large data sets. Proceedings of the 13th International Conference on Pattern Recognition, Vienna, Austria.","DOI":"10.1109\/ICPR.1996.546732"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1080\/13658810500399654","article-title":"A new approach to the nearest-neighbour method to discover cluster features in overlaid spatial point processes","volume":"20","author":"Pei","year":"2006","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0164-1212(03)00216-4","article-title":"Acodf: A novel data clustering approach for data mining in large databases","volume":"73","author":"Tsai","year":"2004","journal-title":"J. Syst. Softw."},{"key":"ref_25","unstructured":"Estivill-Castro, V., and Lee, I. (2000, January 10\u201312). Amoeba: Hierarchical clustering based on spatial proximity using delaunaty diagram. Proceedings of the 9th International Symposium on Spatial Data Handling, Beijing, China."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0198-9715(01)00044-8","article-title":"Argument free clustering for large spatial point-data sets via boundary extraction from delaunay diagram","volume":"26","author":"Lee","year":"2002","journal-title":"Comput. Environ. Urban Syst."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/S0957-4174(02)00185-9","article-title":"Empirical comparison of fast partitioning-based clustering algorithms for large data sets","volume":"24","author":"Wei","year":"2003","journal-title":"Expert Syst. Appl."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Li, D., Yang, X., Cui, W., Gong, J., and Wu, H. (2008, January 28\u201330). A novel spatial clustering algorithm based on Delaunay triangulation. Proceedings of the International Conference on Earth Observation Data Processing and Analysis (ICEODPA), Wuhan, China.","DOI":"10.1117\/12.813354"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1261","DOI":"10.1016\/j.patrec.2008.01.028","article-title":"Effective clustering and boundary detection algorithm based on delaunay triangulation","volume":"29","author":"Liu","year":"2008","journal-title":"Pattern Recognit. Lett."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"2757","DOI":"10.1016\/j.patcog.2008.01.021","article-title":"Automatic clustering and boundary detection algorithm based on adaptive influence function","volume":"41","author":"Nosovskiy","year":"2008","journal-title":"Pattern Recognit."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s40745-015-0040-1","article-title":"A comprehensive survey of clustering algorithms","volume":"2","author":"Xu","year":"2015","journal-title":"Ann. Data Sci."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.patrec.2014.09.017","article-title":"A grid-growing clustering algorithm for geo-spatial data","volume":"53","author":"Zhao","year":"2015","journal-title":"Pattern Recognit. Lett."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Spiliopoulou, M., Schmidt-Thieme, L., and Janning, R. (2014). Clustering large datasets using data stream clustering techniques. Data Analysis, Machine Learning and Knowledge Discovery, Springer International Publishing.","DOI":"10.1007\/978-3-319-01595-8"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Preparata, F.P., and Ian, S.M. (1985). Computational geometry: An Introduction, Springer-Verlag New York.","DOI":"10.1007\/978-1-4612-1098-6_1"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"1027","DOI":"10.1016\/j.cad.2004.10.004","article-title":"An efficient sweep-line delaunay triangulation algorithm","volume":"37","year":"2005","journal-title":"Comput.-Aided Des."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"722","DOI":"10.5951\/MT.59.8.0722","article-title":"A mathematician\u2019s progress","volume":"59","author":"Alfred","year":"1966","journal-title":"Math. Teach."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Shamos, M.I., and Hoey, D. (1976, January 25\u201327). Geometric intersection problems. Proceedings of the 17th Annual Symposium on Foundations of Computer Science, Houston, TX, USA.","DOI":"10.1109\/SFCS.1976.16"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","article-title":"Algorithms for reporting and counting geometric intersections","volume":"C-28","author":"Bentley","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01840357","article-title":"A sweepline algorithm for voronoi diagrams","volume":"2","author":"Fortune","year":"1987","journal-title":"Algorithmica"},{"key":"ref_40","unstructured":"Zhou, P. (2011). Computational geometry algorithm design and analysis. Computational Geometry Algorithm Design and Analysis, Tsinghua University Press. [4th ed.]."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/j.advengsoft.2008.06.003","article-title":"A sweep-line algorithm for spatial clustering","volume":"40","year":"2009","journal-title":"Adv. Eng. Softw."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.advengsoft.2011.09.003","article-title":"A faster circle-sweep delaunay triangulation algorithm","volume":"43","author":"Biniaz","year":"2012","journal-title":"Adv. Eng. Softw."},{"key":"ref_43","unstructured":"Adam, B., Kauffmann, P., Schmitt, D., and Spehner, J.-C. (1997, January 11\u201314). An increasing-circle sweep-algorithm to construct the Delaunay diagram in the plane. Proceedings of the 9th Canadian Conference on Computational Geometry (CCCG), Kingston, ON, Canada."},{"key":"ref_44","unstructured":"Guha, S., Mishra, N., Motwani, R., and O\u2019Callaghan, L. (2000, January 12\u201314). Clustering data streams. Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, USA."},{"key":"ref_45","unstructured":"O\u2019Callaghan, L., Mishra, N., Meyerson, A., Guha, S., and Motwani, R. (March, January 26). Streaming-data algorithms for high-quality clustering. Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1007\/BF02948829","article-title":"Squeezer: An efficient algorithm for clustering categorical data","volume":"17","author":"Zengyou","year":"2002","journal-title":"J. Comput. Sci. Technol."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TKDE.2003.1198387","article-title":"Clustering data streams: Theory and practice","volume":"15","author":"Guha","year":"2003","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/s12559-015-9342-z","article-title":"An adaptive density data stream clustering algorithm","volume":"8","author":"Ding","year":"2016","journal-title":"Cogn. Comput."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1016\/j.neucom.2016.09.054","article-title":"Supervised adaptive incremental clustering for data stream of chunks","volume":"219","author":"Zheng","year":"2016","journal-title":"Neurocomputing"},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"234","DOI":"10.2307\/143141","article-title":"A computer movie simulating urban growth in the detroit region","volume":"46","author":"Tobler","year":"1970","journal-title":"Econ. Geogr."},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Ellis, W.D. (1938). A Source Book of Gestalt Psychology, Kegan Paul, Trench, Trubner & Company.","DOI":"10.1037\/11496-000"},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/j.csda.2006.02.008","article-title":"Extending fuzzy and probabilistic clustering to very large data sets","volume":"51","author":"Hathaway","year":"2006","journal-title":"Comput. Stat. Data Anal."},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Cho, K., Jo, S., Jang, H., Kim, S.M., and Song, J. (2006, January 4\u20138). Dcf: An efficient data stream clustering framework for streaming applications. Proceedings of the 17th International Conference on Database and Expert Systems Applications, Krak\u00f3w, Poland.","DOI":"10.1007\/11827405_12"}],"container-title":["ISPRS International Journal of Geo-Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2220-9964\/6\/9\/272\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:43:43Z","timestamp":1760208223000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2220-9964\/6\/9\/272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,30]]},"references-count":53,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2017,9]]}},"alternative-id":["ijgi6090272"],"URL":"https:\/\/doi.org\/10.3390\/ijgi6090272","relation":{"has-preprint":[{"id-type":"doi","id":"10.20944\/preprints201708.0040.v2","asserted-by":"object"},{"id-type":"doi","id":"10.20944\/preprints201708.0040.v1","asserted-by":"object"}]},"ISSN":["2220-9964"],"issn-type":[{"value":"2220-9964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,30]]}}}