共查询到20条相似文献，搜索用时 15 毫秒
1.
An Iterative Detection and Removal Method for Detecting Spatial Clusters of Different Densities 
下载免费PDF全文
下载免费PDF全文 A fundamental element of exploratory spatial data analysis is the discovery of clusters in a spatial point dataset. When clusters with distinctly different local densities exist, the determination of suitable density level is still an unsolved problem. On that account, an iterative detection and removal method is proposed in this study. In each step of the novel method, there are two stages. In the detection stage, density level is statistically modeled as a significance level controlled by the number and support domain of the points in the dataset, and then a hypothesis test is used to detect the high‐density points. In the removal stage, the Delaunay triangulation network is used to construct clusters and support domains for the identified high‐density points, and then the high‐density points and their support domains are removed from the dataset. The detection and removal operation are iteratively implemented until no high‐density points can be detected. Experiments and comparisons show that the proposed method, on the one hand, outperforms four state‐of‐the‐art methods for detecting clusters of complex shapes and diverse densities, and on the other hand, no user‐specified parameters are required. In addition, the support domains of clusters are very useful for spatial analysis. 相似文献
2.
For an effective interpretation of spatio‐temporal patterns of crime clusters/hotspots, we explore the possibility of three‐dimensional mapping of crime events in a space‐time cube with the aid of space‐time variants of kernel density estimation and scan statistics. Using the crime occurrence dataset of snatch‐and‐run offences in Kyoto City from 2003 to 2004, we confirm that the proposed methodology enables simultaneous visualisation of the geographical extent and duration of crime clusters, by which stable and transient space‐time crime clusters can be intuitively differentiated. Also, the combined use of the two statistical techniques revealed temporal inter‐cluster associations showing that transient clusters alternatively appeared in a pair of hotspot regions, suggesting a new type of “displacement” phenomenon of crime. Highlighting the complementary aspects of the two space‐time statistical approaches, we conclude that combining these approaches in a space‐time cube display is particularly valuable for a spatio‐temporal exploratory data analysis of clusters to extract new knowledge of crime epidemiology from a data set of space‐time crime events. 相似文献
3.
Yan Shi Min Deng Jianya Gong Chang‐Tien Lu Xuexi Yang Huimin Liu 《Transactions in GIS》2019,23(2):312-333
Spatio‐temporal clustering is a highly active research topic and a challenging issue in spatio‐temporal data mining. Many spatio‐temporal clustering methods have been designed for geo‐referenced time series. Under some special circumstances, such as monitoring traffic flow on roads, existing methods cannot handle the temporally dynamic and spatially heterogeneous correlations among road segments when detecting clusters. Therefore, this article develops a spatio‐temporal flow‐based approach to detect clusters in traffic networks. First, a spatio‐temporal flow process is modeled by combining network topology relations with real‐time traffic status. On this basis, spatio‐temporal neighborhoods are captured by considering traffic time‐series similarity in spatio‐temporal flows. Spatio‐temporal clusters are further formed by successive connection of spatio‐temporal neighbors. Experiments on traffic time series of central London's road network on both weekdays and weekends are performed to demonstrate the effectiveness and practicality of the proposed method. 相似文献
4.
An adaptive dual clustering algorithm based on hierarchical structure: A case study of settlement zoning 下载免费PDF全文
下载免费PDF全文 Traditional dual clustering algorithms cannot adaptively perform clustering well without sufficient prior knowledge of the dataset. This article aims at accommodating both spatial and non‐spatial attributes in detecting clusters without the need to set parameters by default or prior knowledge. A novel adaptive dual clustering algorithm (ADC+) is proposed to obtain satisfactory clustering results considering the spatial proximity and attribute similarity with the presence of noise and barriers. In this algorithm, Delaunay triangulation is utilized to adaptively obtain spatial proximity and spatial homogenous patterns based on particle swarm optimization (PSO). Then, a hierarchical clustering method is employed to obtain clusters with similar attributes. The hierarchical clustering method adopts a discriminating coefficient to adaptively control the depth of the hierarchical architecture. The clustering results are further refined using an optimization approach. The advantages and practicability of the ADC+ algorithm are illustrated by experiments on both simulated datasets and real‐world applications. It is found that the proposed ADC+ algorithm can adaptively and accurately detect clusters with arbitrary shapes, similar attributes and densities under the consideration of barriers. 相似文献
5.
Integrated compression of vehicle spatio‐temporal trajectories under the road stroke network constraint 下载免费PDF全文
下载免费PDF全文 With fast growth of all kinds of trajectory datasets, how to effectively manage the trajectory data of moving objects has received a lot of attention. This study proposes a spatio‐temporal data integrated compression method of vehicle trajectories based on stroke paths coding compression under the road stroke network constraint. The road stroke network is first constructed according to the principle of continuous coherence in Gestalt psychology, and then two types of Huffman tree—a road strokes Huffman tree and a stroke paths Huffman tree—are built, based respectively on the importance function of road strokes and vehicle visiting frequency of stroke paths. After the vehicle trajectories are map matched to the spatial paths in the road network, the Huffman codes of the road strokes and stroke paths are used to compress the trajectory spatial paths. An opening window algorithm is used to simplify the trajectory temporal data depicted on a time–distance polyline by setting the maximum allowable speed difference as the threshold. Through analysis of the relative spatio‐temporal relationship between the preceding and latter feature tracking points, the spatio‐temporal data of the feature tracking points are all converted to binary codes together, accordingly achieving integrated compression of trajectory spatio‐temporal data. A series of comparative experiments between the proposed method and representative state‐of‐the‐art methods are carried out on a real massive taxi trajectory dataset from five aspects, and the experimental results indicate that our method has the highest compression ratio. Meanwhile, this method also has favorable performance in other aspects: compression and decompression time overhead, storage space overhead, and historical dataset training time overhead. 相似文献
6.
Mobility and spatial interaction data have become increasingly available due to the wide adoption of location‐aware technologies. Examples of mobility data include human daily activities, vehicle trajectories, and animal movements, among others. In this article we focus on a special type of mobility data, i.e. origin‐destination pairs, and present a new approach to the discovery and understanding of spatio‐temporal patterns in the movements. Specifically, to extract information from complex connections among a large number of point locations, the approach involves two steps: (1) spatial clustering of massive GPS points to recognize potentially meaningful places; and (2) extraction and mapping of the flow measures of clusters to understand the spatial distribution and temporal trends of movements. We present a case study with a large dataset of taxi trajectories in Shenzhen, China to demonstrate and evaluate the methodology. The contribution of the research is two‐fold. First, it presents a new methodology for detecting location patterns and spatial structures embedded in origin‐destination movements. Second, the approach is scalable to large data sets and can summarize massive data to facilitate pattern extraction and understanding. 相似文献
7.
Often, we are faced with questions regarding past events and the answers are hidden in the historical text archives. The growing developments in geographic information retrieval and temporal information retrieval techniques have given new ways to explore digital text archives for spatio‐temporal data. The question is how to retrieve the answers from the text documents. This work contributes to a better understanding of spatio‐temporal information extraction from text documents. Natural language processing techniques were used to develop an information extraction approach using the GATE language processing software. The developed framework uses gazetteer matching, spatio‐temporal relationship extraction and pattern‐based rules to recognize and annotate elements in historical text documents. The extracted spatio‐temporal data is used as input for GIS studies on the time–geography context of the German–Herero resistance war of 1904 in Namibia. Related issues when analyzing the historical data in current GIS are discussed. Particularly problematic are movement data in small scale with poor temporal density and trajectories that are short or connect very distant locations. 相似文献
8.
《International Journal of Digital Earth》2013,6(2):138-157
The discovery of spatio-temporal clusters in complex spatio-temporal data-sets has been a challenging issue in the domain of spatio-temporal data mining and knowledge discovery. In this paper, a novel spatio-temporal clustering method based on spatio-temporal shared nearest neighbors (STSNN) is proposed to detect spatio-temporal clusters of different sizes, shapes, and densities in spatio-temporal databases with a large amount of noise. The concepts of windowed distance and shared nearest neighbor are utilized to define a novel spatio-temporal density for a spatio-temporal entity with definite mathematical meanings. Then, the density-based clustering strategy is employed to uncover spatio-temporal clusters. The spatio-temporal clustering algorithm developed in this paper is easily implemented and less sensitive to density variation among spatio-temporal entities. Experiments are undertaken on several simulated data-sets to demonstrate the effectiveness and advantage of the STSNN algorithm. Also, the real-world applications on two seismic databases show that the STSNN algorithm has the ability to uncover foreshocks and aftershocks effectively. 相似文献
9.
In the age of Big Data, the widespread use of location‐awareness technologies has made it possible to collect spatio‐temporal interaction data for analyzing flow patterns in both physical space and cyberspace. This research attempts to explore and interpret patterns embedded in the network of phone‐call interaction and the network of phone‐users’ movements, by considering the geographical context of mobile phone cells. We adopt an agglomerative clustering algorithm based on a Newman‐Girvan modularity metric and propose an alternative modularity function incorporating a gravity model to discover the clustering structures of spatial‐interaction communities using a mobile phone dataset from one week in a city in China. The results verify the distance decay effect and spatial continuity that control the process of partitioning phone‐call interaction, which indicates that people tend to communicate within a spatial‐proximity community. Furthermore, we discover that a high correlation exists between phone‐users’ movements in physical space and phone‐call interaction in cyberspace. Our approach presents a combined qualitative‐quantitative framework to identify clusters and interaction patterns, and explains how geographical context influences communities of callers and receivers. The findings of this empirical study are valuable for urban structure studies as well as for the detection of communities in spatial networks. 相似文献
10.
11.
融合时空邻近与专题属性相似的时空聚类是挖掘地理现象时空演化规律的重要手段。现有方法需要的聚类参数许多难以获取,影响了聚类方法的可操作性与聚类结果的可靠性。提出一种基于重排检验的时空聚类方法。首先,通过重排检验发现时空数据集中的均质子区域;进而,采用均方误差准则合并均质子区域内的时空实体生成时空簇,并通过簇内重排检验自动识别聚类合并的终止条件;最后,借助时空拓扑关系在保证结果精度的前提下发展一种快速重排检验的方法,提高了聚类方法的运行效率。通过实验和比较发现,该方法一方面可以发现不同形状、大小的时空簇,聚类质量优于经典的ST-DBSCAN方法;另一方面聚类过程中人为设置参数的主观性显著降低,提高了聚类方法的可操作性。 相似文献
12.
空间聚类是探索性空间数据分析的有力手段,不仅可以直接用于发现地理现象的分布格局与分布特征,亦可以为其他空间数据分析任务提供重要的预处理步骤。空间聚类有望成为大数据认知的突破口。空间聚类研究虽然已经引起了广泛关注,但是依然面临两大最根本的困境:"无中生有"和"无从理解"。"无中生有"指的是:绝大多数方法,即使针对不包含聚类结构的数据集,仍然会发现聚类;"无从理解"指的是:即使同一种聚类方法,采用不同的聚类参数就会获得千变万化的聚类结果,而这些结果的含义不明确。造成上述困境的根本原因在于:尺度没有在聚类模型中被当作重要参数而恰当地体现。为此,笔者受到人类视觉多尺度认知原理的启发,根据多尺度表达的"自然法则",建立了一套尺度驱动的空间聚类理论。首先将尺度定量化建模为聚类模型的参数,然后将空间聚类的尺度依赖性建模为一种假设检验问题,最后通过控制尺度参数以自动获得统计显著的多尺度聚类结果。在该理论指导下,可以构建适用不同应用需求的多尺度空间聚类模型,一方面降低了空间聚类过程中的主观性,另一方面有利于对空间聚类模式进行全面而深入的分析。 相似文献
13.
Seung-Hyun Jeong Norman W. Paton Alvaro A. A. Fernandes Tony Griffiths 《Transactions in GIS》2005,9(2):129-156
Many applications capture, or make use of, spatial data that changes over time. This requirement for effective and efficient spatio‐temporal data management has given rise to a range of research activities relating to spatio‐temporal data management. Such work has sought to understand, for example, the requirements of different categories of application, and the modelling facilities that are most effective for these applications. However, at present, there are few systems with fully integrated support for spatio‐temporal data, and thus developers must often construct custom solutions for their applications. Developers of both bespoke solutions and of generic spatio‐temporal platforms will often need to support the fusion of large spatio‐temporal data sets. Supporting such requests in a database setting involves the use of join operations with both spatial and temporal conditions – spatio‐temporal joins. However, there has been little work to date on spatio‐temporal join algorithms or their evaluation. This paper presents an evaluation of several approaches to the implementation of spatio‐temporal joins that build upon widely available indexing techniques. The evaluation explores how several algorithms perform for databases with different spatial and temporal characteristics, with a view to helping developers of generic infrastructures or custom solutions in the selection and development of appropriate spatio‐temporal join strategies. 相似文献
14.
As tools for collecting data continue to evolve and improve, the information available for research is expanding rapidly. Increasingly, this information is of a spatio‐temporal nature, which enables tracking of phenomena through both space and time. Despite the increasing availability of spatio‐temporal data, however, the methods for processing and analyzing these data are lacking. Existing geocoding techniques are no exception. Geocoding enables the geographic location of people and events to be known and tracked. However, geocoded information is highly generalized and subject to various interpolation errors. In addition, geocoding for spatio‐temporal data is especially challenging because of the inherent dynamism of associated data. This article presents a methodology for geocoding spatio‐temporal data in ArcGIS that utilizes several additional supporting procedures to enhance spatial accuracy, including the use of supplementary land use information, aerial photographs and local knowledge. This hybrid methodology allows for the tracking of phenomenon through space and over time. It is also able to account for reporting inconsistencies, which is a common feature of spatio‐temporal data. The utility of this methodology is demonstrated using an application to spatio‐temporal address records for a highly mobile group of convicted felons in Hamilton County, Ohio. 相似文献
15.
Geo‐SOM is a useful geovisualization technique for revealing patterns in spatial data, but is ineffective in supporting interactive exploration of patterns hidden in different Geo‐SOM sizes. Based on the divide and group principle in geovisualization, the article proposes a new methodology that combines Geo‐SOM and hierarchical clustering to tackle this problem. Geo‐SOM was used to “divide” the dataset into several homogeneous subsets; hierarchical clustering was then used to “group” neighboring homogeneous subsets for pattern exploration in different levels of granularity, thus permitting exploration of patterns at multiple scales. An artificial dataset was used for validating the method's effectiveness. As a case study, the rush hour motorcycle flow data in Taipei City, Taiwan were analyzed. Compared with the best result generated solely by Geo‐SOM, the proposed method performed better in capturing the homogeneous zones in the artificial dataset. For the case study, the proposed method discovered six clusters with unique data and spatial patterns at different levels of granularity, while the original Geo‐SOM only identified two. Among the four hierarchical clustering methods, Ward's clustering performed the best in pattern discovery. The results demonstrated the effectiveness of the approach in visually and interactively exploring data and spatial patterns in geospatial data. 相似文献
16.
A Space‐Time Raster GIS Data Model for Spatiotemporal Analysis of Vegetation Responses to a Freeze Event 下载免费PDF全文
下载免费PDF全文 Many past space‐time GIS data models viewed the world mainly from a spatial perspective. They attached a time stamp to each state of an entity or the entire area of study. This approach is less efficient for certain spatio‐temporal analyses that focus on how locations change over time, which require researchers to view each location from a temporal perspective. In this article, we present a data model to organize multi‐temporal remote sensing datasets and track their changes at the individual pixel level. This data model can also integrate raster datasets from heterogeneous sources under a unified framework. The proposed data model consists of several object classes under a hierarchical structure. Each object class is associated with specific properties and behaviors to facilitate efficient spatio‐temporal analyses. We apply this data model to a case study of analyzing the impact of the 2007 freeze in Knoxville, Tennessee. The characteristics of different vegetation clusters before, during, and after the 2007 freeze event are compared. Our findings indicate that the majority of the study area is impacted by this freeze event, and different vegetation types show different response patterns to this freeze. 相似文献
17.
Spatio‐temporal prediction and forecasting of land surface temperature (LST) are relevant. However, several factors limit their usage, such as missing pixels, line drops, and cloud cover in satellite images. Being measured close to the Earth's surface, LST is mainly influenced by the land use/land cover (LULC) distribution of the terrain. This article presents a spatio‐temporal interpolation method which semantically models LULC information for the analysis of LST. The proposed spatio‐temporal semantic kriging (ST‐SemK) approach is presented in two variants: non‐separable ST‐SemK (ST‐SemKNSep) and separable ST‐SemK (ST‐SemKSep). Empirical studies have been carried out with derived Landsat 7 ETM+ satellite images of LST for two spatial regions: Kolkata, India and Dallas, Texas, U.S. It has been observed that semantically enhanced spatio‐temporal modeling by ST‐SemK yields more accurate prediction results than spatio‐temporal ordinary kriging and other existing methods. 相似文献
18.
Mining Association Rules in Spatio-Temporal Data: An Analysis of Urban Socioeconomic and Land Cover Change 总被引：8，自引：0，他引：8
This research demonstrates the application of association rule mining to spatio‐temporal data. Association rule mining seeks to discover associations among transactions encoded in a database. An association rule takes the form A→B where A (the antecedent) and B (the consequent) are sets of predicates. A spatio‐temporal association rule occurs when there is a spatio‐temporal relationship in the antecedent or consequent of the rule. As a case study, association rule mining is used to explore the spatial and temporal relationships among a set of variables that characterize socioeconomic and land cover change in the Denver, Colorado, USA region from 1970–1990. Geographic Information Systems (GIS)‐based data pre‐processing is used to integrate diverse data sets, extract spatio‐temporal relationships, classify numeric data into ordinal categories, and encode spatio‐temporal relationship data in tabular format for use by conventional (non‐spatio‐temporal) association rule mining software. Multiple level association rule mining is supported by the development of a hierarchical classification scheme (concept hierarchy) for each variable. Further research in spatio‐temporal association rule mining should address issues of data integration, data classification, the representation and calculation of spatial relationships, and strategies for finding ‘interesting’ rules. 相似文献
19.
ADCN: An anisotropic density‐based clustering algorithm for discovering spatial point patterns with noise 下载免费PDF全文
下载免费PDF全文 Density‐based clustering algorithms such as DBSCAN have been widely used for spatial knowledge discovery as they offer several key advantages compared with other clustering algorithms. They can discover clusters with arbitrary shapes, are robust to noise, and do not require prior knowledge (or estimation) of the number of clusters. The idea of using a scan circle centered at each point with a search radius Eps to find at least MinPts points as a criterion for deriving local density is easily understandable and sufficient for exploring isotropic spatial point patterns. However, there are many cases that cannot be adequately captured this way, particularly if they involve linear features or shapes with a continuously changing density, such as a spiral. In such cases, DBSCAN tends to either create an increasing number of small clusters or add noise points into large clusters. Therefore, in this article, we propose a novel anisotropic density‐based clustering algorithm (ADCN). To motivate our work, we introduce synthetic and real‐world cases that cannot be handled sufficiently by DBSCAN (or OPTICS). We then present our clustering algorithm and test it with a wide range of cases. We demonstrate that our algorithm can perform equally as well as DBSCAN in cases that do not benefit explicitly from an anisotropic perspective, and that it outperforms DBSCAN in cases that do. Finally, we show that our approach has the same time complexity as DBSCAN and OPTICS, namely O(n log n) when using a spatial index and O(n2) otherwise. We provide an implementation and test the runtime over multiple cases. 相似文献
20.
Existing methods of spatial data clustering have focused on point data, whose similarity can be easily defined. Due to the complex shapes and alignments of polygons, the similarity between non‐overlapping polygons is important to cluster polygons. This study attempts to present an efficient method to discover clustering patterns of polygons by incorporating spatial cognition principles and multilevel graph partition. Based on spatial cognition on spatial similarity of polygons, four new similarity criteria (i.e. the distance, connectivity, size and shape) are developed to measure the similarity between polygons, and used to visually distinguish those polygons belonging to the same clusters from those to different clusters. The clustering method with multilevel graph‐partition first coarsens the graph of polygons at multiple levels, using the four defined similarities to find clusters with maximum similarity among polygons in the same clusters, then refines the obtained clusters by keeping minimum similarity between different clusters. The presented method is a general algorithm for discovering clustering patterns of polygons and can satisfy various demands by changing the weights of distance, connectivity, size and shape in spatial similarity. The presented method is tested by clustering residential areas and buildings, and the results demonstrate its usefulness and universality. 相似文献