Attraction and Avoidance Detection from Movements

@article{Li2013AttractionAA,
  title={Attraction and Avoidance Detection from Movements},
  author={Zhenhui Jessie Li and Bolin Ding and Fei Wu and Kin Hou Lei and Roland W. Kays and Margaret C. Crofoot},
  journal={Proc. VLDB Endow.},
  year={2013},
  volume={7},
  pages={157-168}
}
With the development of positioning technology, movement data has become widely available nowadays. An important task in movement data analysis is to mine the relationships among moving objects based on their spatiotemporal interactions. Among all relationship types, attraction and avoidance are arguably the most natural ones. However, rather surprisingly, there is no existing method that addresses the problem of mining significant attraction and avoidance relationships in a well-defined and… 

Figures and Tables from this paper

MoveMine 2.0: Mining Object Relationships from Movement Data
TLDR
This work proposes to extend MoveMine to MoveMine 2.0 by adding substantial new methods in mining dynamic relationship patterns, and focuses on two types of pairwise relationship patterns: attraction/avoidance relationship, and following pattern.
Effective Following Patterns Mining Scheme for the Movements of Objects
TLDR
The progress of patterns mining mainly in frequent pattern, periodic pattern and following pattern is reviewed by reviewing and comparing the methods and algorithms in detail, providing a quick understanding of research to the worker and giving effective following patterns mining scheme for the movements of objects.
DIOT: Detecting Implicit Obstacles from Trajectories
TLDR
A densitybased definition for the obstacle is introduced based on a new normalized Dynamic Time Warping distance and the density functions tailored for the sub-trajectories to estimate the density variations and a novel framework DIOT is introduced that utilizes the depth-first search method to detect implicit obstacles.
Research on Patterns Mining Method for Moving Objects
TLDR
This paper provides a general perspective for studies on the issues of patterns mining by reviewing the methods and algo- rithms in detail and comparing the existing results on the same issues, providing a quick understanding of research to the worker.
An online updating multi-threshold method for mobility relationship mining
TLDR
Experiments conducted on MIT Reality Mining project dataset show that the proposed updating method is practical and the proposed multi-threshold model outperforms the state-of-the-art methods proposed by Wang et al.
Mining Massive-Scale Spatiotemporal Trajectories in Parallel: A Survey
TLDR
A comprehensive survey of the state-of-the-art techniques for mining massive-scale spatiotemporal trajectory data based on parallel computing platforms such as Graphics Processing Unit GPU, MapReduce and Field Programmable Gate Array FPGA is presented.
Analysis and fast querying of mobility data
TLDR
This thesis introduces a framework which formally defines what is an avoidance behaviour between moving objects and provides an algorithm which is able to extract previously unknown and interesting patterns from raw mobility data and experimentally proves the effectiveness of the solution with real-world datasets.
Literature Study and Assessment of Trajectory Data Mining Tools
TLDR
This thesis examines how trajectory data mining tasks are defined at an abstract level, what type of information it is possible to extract from trajectory data, what solutions trajectory datamining tools implement for different tasks, how tools uses visualization, and what the limiting aspects of input data are how those limitations are treated.
...
...

References

SHOWING 1-10 OF 33 REFERENCES
On discovery of gathering patterns from trajectories
TLDR
This work proposes a novel concept, called gathering, which is a trajectory pattern modelling various group incidents such as celebrations, parades, protests, traffic jams and so on, and develops a set of well thought out techniques to improve the performance.
Swarm: Mining Relaxed Temporal Moving Object Clusters
TLDR
In ObjectGrowth, two effective pruning strategies are proposed to greatly reduce the search space and a novel closure checking rule is developed to report closed swarms on-the-fly.
Discovery of convoys in trajectory databases
TLDR
This paper formalizes the concept of a convoy query using density-based notions, in order to capture groups of arbitrary extents and shapes and develops three efficient algorithms for convoy discovery that adopt the well-known filter-refinement framework.
On Discovering Moving Clusters in Spatio-temporal Data
TLDR
This work provides a formal definition for moving clusters and describes three algorithms for their automatic discovery, a straight-forward method based on the definition, a more efficient method which avoids redundant checks and an approximate algorithm which trades accuracy for speed by borrowing ideas from the MPEG-2 video encoding.
Dimensionality reduction for long duration and complex spatio-temporal queries
TLDR
This paper proposes a preprocessing strategy which consists of using a random projection to reduce the dimensionality of the transformed space and shows the possibility of breaking the curse of dimensionality in a spatio-temporal setting.
Mining periodic behaviors for moving objects
TLDR
A two-stage algorithm, Periodica, is proposed to solve the problem of mining periodic behaviors for moving objects, and it is proposed that the observed movement is generated from multiple interleaved periodic behaviors associated with certain reference locations.
Ranking queries on uncertain data: a probabilistic threshold approach
TLDR
An efficient exact algorithm, a fast sampling algorithm, and a Poisson approximation based algorithm are presented for answering probabilistic threshold top-k queries on uncertain data, which computes uncertain records taking a probability of at least p to be in the top- k list.
Time Series Motifs Statistical Significance
TLDR
This work leverages work from the bioinformatics community by using a symbolic definition of time series motifs to derive each motif’s p-value, which is then assessed by comparing the actual frequency to the estimated one using statistical hypothesis tests.
Bridging the gap between physical location and online social networks
TLDR
A novel set of location-based features for analyzing the social context of a geographic region, including location entropy, which measures the diversity of unique visitors of a location, are introduced.
Efficient retrieval of similar time sequences under time warping
TLDR
This work proposes a modification of the so called "FastMap", to map sequences into points, with little compromise of "recall" (typically zero), and a fast linear test, to help to discard quickly many of the false alarms that FastMap will typically introduce.
...
...