Nothing Special   »   [go: up one dir, main page]

Gudmundsson et al., 2022 - Google Patents

Cubic upper and lower bounds for subtrajectory clustering under the continuous Fréchet distance∗

Gudmundsson et al., 2022

View PDF
Document ID
15668849999641787350
Author
Gudmundsson J
Wong S
Publication year
Publication venue
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

External Links

Snippet

Detecting commuting patterns or migration patterns in movement data is an important problem in computational movement analysis. Given a trajectory, or set of trajectories, this corresponds to clustering similar subtrajectories. We study subtrajectory clustering under the …
Continue reading at epubs.siam.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30312—Storage and indexing structures; Management thereof
    • G06F17/30321—Indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30386—Retrieval requests
    • G06F17/30424—Query processing
    • G06F17/30533—Other types of queries
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30961—Trees

Similar Documents

Publication Publication Date Title
Sommer Shortest-path queries in static networks
Wang et al. Fast large-scale trajectory clustering
Song et al. PRESS: A novel framework of trajectory compression in road networks
Yu Spatial co-location pattern mining for location-based services in road networks
Grimmett et al. Directed percolation and random walk
Klein et al. A fully dynamic approximation scheme for shortest paths in planar graphs
CN104809242A (en) Distributed-structure-based big data clustering method and device
Xie et al. Finding alternative shortest paths in spatial networks
Sainju et al. Parallel grid-based colocation mining algorithms on GPUs for big spatial event data
Orakzai et al. k/2-hop: fast mining of convoy patterns with effective pruning
Gudmundsson et al. Cubic upper and lower bounds for subtrajectory clustering under the continuous Fréchet distance∗
Wu et al. Incremental processing of continual range queries over moving objects
Bermingham et al. A general methodology for n-dimensional trajectory clustering
Feldman et al. The single pixel GPS: learning big data signals from tiny coresets
Bui et al. The Computational Complexity of Hierarchical Clustering Algorithms for Community Detection: A Review.
Wei et al. On Efficient Shortest Path Computation on Terrain Surface: A Direction-Oriented Approach
Benkert et al. Finding popular places
Dan et al. Double Hierarchical Labeling Shortest Distance Querying in Time-dependent Road Networks
Shao et al. Voronoi-based range-kNN search with map grid in a mobile environment
CN103021257A (en) Method and apparatus for generating electronic map
Yu et al. Map‐Matching on Low Sampling Rate Trajectories through Frequent Pattern Mining
Muntés-Mulero et al. Graph partitioning strategies for efficient bfs in shared-nothing parallel systems
Pagh et al. Scalable computation of acyclic joins
Wang et al. Grid‐Based Whole Trajectory Clustering in Road Networks Environment
Bonchi et al. Core Decomposition of Massive, Information-Rich Graphs.