Andere Kunden interessierten sich auch für
![Discovering Clusters of Arbitrary Shapes and Densities in Data Streams]( "Discovering Clusters of Arbitrary Shapes and Densities in Data Streams")
Discovering Clusters of Arbitrary Shapes and Densities in Data Streams32,99 €![A Clustering-Based Approach for Discovering Places in Trajectories]( "A Clustering-Based Approach for Discovering Places in Trajectories")
A Clustering-Based Approach for Discovering Places in Trajectories32,99 €![Solving the Capacitated Facility Location Problem]( "Solving the Capacitated Facility Location Problem")
Solving the Capacitated Facility Location Problem51,99 €![Development of an index structure for spatial data]( "Development of an index structure for spatial data")
Development of an index structure for spatial data36,99 €![Voice Quality Detection Based On Temporal And Spatial Features]( "Voice Quality Detection Based On Temporal And Spatial Features")
Voice Quality Detection Based On Temporal And Spatial Features26,99 €![Spatial Data Infrastructures Model for Developing Countries]( "Spatial Data Infrastructures Model for Developing Countries")
Spatial Data Infrastructures Model for Developing Countries32,99 €![A Spatial Invarient Model for Local Attributes of Fingerprint Ridges]( "A Spatial Invarient Model for Local Attributes of Fingerprint Ridges")
A Spatial Invarient Model for Local Attributes of Fingerprint Ridges40,99 €
Spatial co-location patterns represent the subsets of events (features) whose instances are frequently located together in a geographic space. It resembles the association rules mining in many aspects. However, they are applied in completely different applications. The co-location patterns discovery presents challenges since the instances of spatial events are embedded in a continuous space and share a variety of spatial relationships. In this book, we provide a study based on some previous approaches, the concepts that were used, and some of their limitations. We propose a methodology which overcomes the shortcomings of some other approaches. This methodology is based on a spatial access method (KD-Tree) with its basic operations and the apriori generation algorithm. The results of conducted experimentation show the correctness and completeness of our approach. The results also illustrate the effect of input data on the performance. An interface which displays the results graphically is provided.