{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:47:13Z","timestamp":1754156833402,"version":"3.41.2"},"reference-count":34,"publisher":"Emerald","issue":"5","license":[{"start":{"date-parts":[[2020,10,28]],"date-time":"2020-10-28T00:00:00Z","timestamp":1603843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["DTA"],"published-print":{"date-parts":[[2020,10,28]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title><jats:p>The spatial and non-spatial attributes are the two important characteristics of a spatial point, which belong to the two different attribute domains in many Geographic Information Systems applications. The dual clustering algorithms take into account both spatial and non-spatial attributes, where a cluster has not only high proximity in spatial domain but also high similarity in non-spatial domain. In a geographical dataset, traditional dual spatial clustering algorithms discover homogeneous spatially adjacent clusters suffering from the between-cluster inhomogeneity where those spatial points are described in non-spatial domain. To overcome this limitation, a novel dual-domain clustering algorithm (DDCA) is proposed by considering both spatial proximity and attribute similarity with the presence of inhomogeneity.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title><jats:p>In this algorithm, Delaunay triangulation with edge length constraints is first employed to construct spatial proximity relationships amongst objects. Then, a clustering strategy based on statistical change detection is designed to obtain clusters with similar attributes.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Findings<\/jats:title><jats:p>The effectiveness and practicability of the proposed algorithm are illustrated by experiments on both simulated datasets and real spatial events. It is found that the proposed algorithm can adaptively and accurately detect clusters with spatial proximity and similar non-spatial attributes under the consideration of inhomogeneity.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title><jats:p>Traditional dual spatial clustering algorithms discover homogeneous spatially adjacent clusters suffering from the between-cluster inhomogeneity where those spatial points are described in non-spatial domain. The research here is a contribution to developing a dual spatial clustering method considering both spatial proximity and attribute similarity with the presence of inhomogeneity. The detection of these clusters is useful to understand the local patterns of geographical phenomena, such as land use classification, spatial patterns research and big geo-data analysis.<\/jats:p><\/jats:sec>","DOI":"10.1108\/dta-08-2019-0142","type":"journal-article","created":{"date-parts":[[2020,10,26]],"date-time":"2020-10-26T13:43:36Z","timestamp":1603719816000},"page":"603-623","source":"Crossref","is-referenced-by-count":0,"title":["A novel dual-domain clustering algorithm for inhomogeneous spatial point event"],"prefix":"10.1108","volume":"54","author":[{"given":"Jie","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaoning","family":"Di","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1745-3319","authenticated-orcid":false,"given":"Jiazhu","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leying","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"issue":"1","key":"key2020110202065073600_ref001","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.compenvurbsys.2005.07.004","article-title":"A dual approach to cluster discovery in point event data sets","volume":"31","year":"2007","journal-title":"Computers, Environment and Urban Systems"},{"key":"key2020110202065073600_ref002","first-page":"87","article-title":"3D nearest neighbour search using a clustered hierarchical tree structure","year":"2016","journal-title":"International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences"},{"key":"key2020110202065073600_ref003","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.isprsjprs.2015.12.008","article-title":"Classified and clustered data constellation: an efficient approach of 3D urban data management","volume":"113","year":"2016","journal-title":"ISPRS Journal of Photogrammetry and Remote Sensing"},{"key":"key2020110202065073600_ref004","first-page":"11","article-title":"3D geo-clustering for wireless sensor network in smart city","year":"2019","journal-title":"International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences"},{"key":"key2020110202065073600_ref005","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.isprsjprs.2020.01.022","article-title":"Voronoi classified and clustered data constellation: a new 3D data structure for geomarketing strategies","volume":"162","year":"2020","journal-title":"ISPRS Journal of Photogrammetry and Remote Sensing"},{"key":"key2020110202065073600_ref006","first-page":"1","article-title":"HiSpatialCluster: a novel high\u2010performance software tool for clustering massive spatial points","volume":"2","year":"2018","journal-title":"Transactions in GIS"},{"volume-title":"Introduction to Algorithms","year":"1990","key":"key2020110202065073600_ref007"},{"issue":"4","key":"key2020110202065073600_ref008","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","year":"2011","journal-title":"Computers, Environment and Urban Systems"},{"key":"key2020110202065073600_ref009","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","year":"2002","journal-title":"Computers, Environment and Urban Systems"},{"issue":"6","key":"key2020110202065073600_ref010","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1080\/00045608.2014.958389","article-title":"Spatial clustering overview and comparison: accuracy, sensitivity, and computational expense","volume":"104","year":"2014","journal-title":"Annals of the Association of American Geographers"},{"issue":"2","key":"key2020110202065073600_ref011","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1016\/j.jestch.2015.12.015","article-title":"An improved energy aware distributed unequal clustering protocol for heterogeneous wireless sensor networks","volume":"19","year":"2016","journal-title":"Engineering Science and Technology, an International Journal"},{"key":"key2020110202065073600_ref012","first-page":"862","article-title":"Self-organizing spatial clustering under spatial and attribute constraints","volume":"36","year":"2011","journal-title":"Geomatics and Information Science of Wuhan University"},{"issue":"4","key":"key2020110202065073600_ref013","first-page":"484","article-title":"A dual distance-based spatial clustering method","volume":"37","year":"2008","journal-title":"Acta Geodaetica et Cartographica Sinica"},{"issue":"5","key":"key2020110202065073600_ref014","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1109\/TKDE.2005.75","article-title":"Dual clustering: integrating data clustering over optimization and constraint domains","volume":"17","year":"2005","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"first-page":"1","article-title":"Free-parameters clustering of spatial data with non-uniform density","year":"2004","key":"key2020110202065073600_ref015"},{"key":"key2020110202065073600_ref016","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/j.cageo.2011.12.017","article-title":"A density-based spatial clustering algorithm considering both spatial proximity and attribute similarity","volume":"46","year":"2012","journal-title":"Computers and Geosciences"},{"issue":"5","key":"key2020110202065073600_ref017","first-page":"1","article-title":"An adaptive dual clustering algorithm based on hierarchical structure: a case study of settlement zoning","volume":"21","year":"2016","journal-title":"Transactions in GIS"},{"volume-title":"Geographic Data ining and Knowledge Discovery","year":"2009","key":"key2020110202065073600_ref018"},{"issue":"9","key":"key2020110202065073600_ref019","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","year":"2008","journal-title":"Pattern Recognition"},{"issue":"3","key":"key2020110202065073600_ref020","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/j.patcog.2003.06.005","article-title":"Validity index for crisp and fuzzy clusters","volume":"37","year":"2004","journal-title":"Pattern Recognition"},{"key":"key2020110202065073600_ref021","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.compag.2014.12.011","article-title":"Getis-Ord's hot- and coldspot statistics as a basis for multivariate spatial clustering of orchard tree data","volume":"111","year":"2015","journal-title":"Computers and Electronics in Agriculture"},{"key":"key2020110202065073600_ref022","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.landurbplan.2018.03.008","article-title":"A new approach for urban-rural fringe identification: integrating impervious surface area and spatial continuous wavelet transform","volume":"175","year":"2018","journal-title":"Landscape and Urban Planning"},{"issue":"2","key":"key2020110202065073600_ref023","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1023\/A:1009745219419","article-title":"Density-based clustering in spatial database: the algorithm GDBSCAN and its applications","volume":"2","year":"1998","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"11","key":"key2020110202065073600_ref024","first-page":"1276","article-title":"A hybrid spatial clustering based on graph theory and spatial density","volume":"37","year":"2012","journal-title":"Geomatics and Information Science of Wuhan University"},{"article-title":"Incremental clustering in geography and optimization spaces","volume-title":"Advances in Knowledge Discovery and Data Mining","year":"2007","key":"key2020110202065073600_ref025"},{"key":"key2020110202065073600_ref026","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.landurbplan.2015.04.001","article-title":"Landscape sequences along the urban\u2013rural\u2013natural gradient: a novel geospatial approach for identification and analysis","volume":"140","year":"2015","journal-title":"Landscape and Urban Planning"},{"first-page":"532","article-title":"R-Grove: growing a family of R-trees in the big-data forest","year":"2018","key":"key2020110202065073600_ref027"},{"issue":"11","key":"key2020110202065073600_ref028","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.3390\/rs9111141","article-title":"Spatial recognition of the urban-rural fringe of beijing using DMSP\/OLS Nighttime light data","volume":"9","year":"2017","journal-title":"Remote Sensing"},{"year":"2007","key":"key2020110202065073600_ref029","article-title":"Geo-spatial clustering with non-spatial attributes and geographic non-overlapping constraint: a penalized spatial distance measure"},{"issue":"4","key":"key2020110202065073600_ref030","doi-asserted-by":"crossref","first-page":"122","DOI":"10.3390\/ijgi6040122","article-title":"Building an urban spatial structure from urban land use data: an example using automated recognition of the city centre","volume":"6","year":"2017","journal-title":"ISPRS International Journal of Geo-Information"},{"first-page":"178","volume-title":"A Density ased Algorithm to Detect Cavities and Holes from Planar Points","year":"2017","key":"key2020110202065073600_ref031"},{"issue":"9","key":"key2020110202065073600_fur1","doi-asserted-by":"crossref","first-page":"1718","DOI":"10.1080\/13658816.2019.1608998","article-title":"Two-stage permutation tests for determining homogeneity within a spatial cluster","volume":"33","year":"2019","journal-title":"International Journal of Geographical Information Science"},{"key":"key2020110202065073600_fur2","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.compenvurbsys.2015.03.003","article-title":"Identifying related landmark tags in urban scenes using spatial and semantic clustering","volume":"52","year":"2015","journal-title":"Computers, Environment and Urban Systems"},{"issue":"5-6","key":"key2020110202065073600_fur3","doi-asserted-by":"crossref","first-page":"1480","DOI":"10.1007\/s10618-014-0366-x","article-title":"Detecting localized homogeneous anomalies over spatio-temporal data","volume":"28","year":"2014","journal-title":"Data Mining and Knowledge Discovery"}],"container-title":["Data Technologies and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/DTA-08-2019-0142\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/DTA-08-2019-0142\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:15:17Z","timestamp":1753398917000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/dta\/article\/54\/5\/603-623\/38900"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,28]]},"references-count":34,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,10,28]]}},"alternative-id":["10.1108\/DTA-08-2019-0142"],"URL":"https:\/\/doi.org\/10.1108\/dta-08-2019-0142","relation":{},"ISSN":["2514-9288"],"issn-type":[{"type":"print","value":"2514-9288"}],"subject":[],"published":{"date-parts":[[2020,10,28]]}}}