Back to Search
Start Over
Mining Spatial Prevalent Co-location Patterns Based on Graph Databases.
- Source :
- Journal of Frontiers of Computer Science & Technology; Apr2022, Vol. 16 Issue 4, p806-821, 16p
- Publication Year :
- 2022
-
Abstract
- A spatial prevalent co-location pattern (SPCP) is a subset of spatial features whose instances frequently appear together in geographic space. Memory-based neighbor relationship materialization method to search for pattern's instances is efficient, but instance information is stored repeatedly. Graph database technology can efficiently model data with complex associations. Thus, it is possible to consider using the graph database technology to materialize neighbor relationships (i.e., to construct neighborhood graph), but directly transplanting existing mining methods cannot exert the advantages of graph traversal. To solve the above problem, this paper explores the graph databasebased approach to mine spatial prevalent co-location patterns. Firstly, the graph database is utilized to model the spatial instances and their neighbor relations, i.e., the instances and relations are stored in the graph database to construct the neighborhood graph. Then, a basic algorithm called subgraph (or clique) search is designed based on the graph database, using the way of clique search strategy to generate a pattern's table instance to obtain the participating instances, and avoid the inefficient combination or join operations in the traditional method. Considering the low efficiency of collecting participating instances by generating table instances, a participating instance verification algorithm is designed, including the filtering and verification phases. The filtering phase determines whether the features involved in the center instance's neighborhoods fully contain the features in the pattern, and the verification phase determines whether there is pattern instance containing the central instance. The participating instance verification algorithm determines as many participating instances as possible each time, thereby effectively reducing the search space and the number of clique searches. In addition, the correctness and completeness of the proposed algorithms are proven. Finally, extensive experiments are conducted on real and synthetic datasets to verify the efficiency and effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]
Details
- Language :
- Chinese
- ISSN :
- 16739418
- Volume :
- 16
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- Journal of Frontiers of Computer Science & Technology
- Publication Type :
- Academic Journal
- Accession number :
- 157473084
- Full Text :
- https://doi.org/10.3778/j.issn.1673-9418.2010015