Detecting commuting patterns by clustering subtrajectories
From MaRDI portal
Recommendations
Cites work
- A simple algorithm for determining the envelope of a set of lines
- Better lower bounds on detecting affine and spherical degeneracies
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Comparison of distance measures for planar curves
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- On \(k\)-sets in arrangements of curves and surfaces
- On a class of \(O(n^ 2)\) problems in computational geometry
- On Envelopes of Arrangements of Lines
Cited in
(28)- Computing the Fréchet gap distance
- Adaptive density trajectory cluster based on time and space distance
- Middle curves based on discrete Fréchet distance
- Weighted minimum backward Fréchet distance
- Optimizing airspace closure with respect to politicians' egos
- Median trajectories
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- Similarity of polygonal curves in the presence of outliers
- Mining sub-trajectory cliques to find frequent routes
- Computing the Fréchet distance with a retractable leash
- Detecting Regular Visit Patterns
- Detecting areas visited regularly
- Detecting Commuting Patterns by Clustering Subtrajectories
- Compact flow diagrams for state sequences
- On finding subpaths with high demand
- Tighter connections between Formula-SAT and shaving logs
- Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds
- Detecting regular visit patterns
- scientific article; zbMATH DE number 7662168 (Why is no real title available?)
- Finding long and similar parts of trajectories
- Computing a subtrajectory cluster from c-packed trajectories
- Efficient Fréchet distance queries for segments
- Faster approximate covering of subcurves under the Fréchet distance
- Model-based segmentation and classification of trajectories
- Efficient greedy discrete subtrajectory clustering
- Subtrajectory clustering and coverage maximization in cubic time, or better
- Faster Fréchet distance under transformations
- Faster, deterministic and space efficient subtrajectory clustering
This page was built for publication: Detecting commuting patterns by clustering subtrajectories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3089091)
