Mining Top-k Trajectory-Patterns from Anonymized Data
December 04, 2019 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Anuj S. Saxena, Siddharth Dawar, Vikram Goyal, Debajyoti Bera
arXiv ID
1912.01861
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.DB
Citations
3
Venue
arXiv.org
Last Checked
4 months ago
Abstract
The ubiquity of GPS enabled devices result into the generation of an enormous amount of user movement data consisting of a sequence of locations together with activities performed at those locations. Such data, commonly known as {\it activity-trajectory data}, can be analysed to find common user movements and preferred activities, which will have tremendous business value. However, various countries have now introduced data privacy regulations that make it mandatory to anonymize any data before releasing it. This makes it difficult to look for patterns as the existing mining techniques may not be directly applicable over anonymized data. User locations in an activity-trajectory dataset are anonymized to regions of different shapes and sizes making them uncomparable; therefore, it is unclear how to define suitable patterns over those regions. In this paper, we propose a top-k pattern mining technique called TopKMintra that employs a pre-processing step to transform anonymized activity-trajectory into an intermediate representation that address the above problem. Unlike usual sequential data, activity-trajectory data is 2-dimensional that can lead to generation of duplicate patterns. To handle this, TopKMintra restricts arbitrary extensions in the two dimensions by imposing an order over the search space; this also helps in addressing the common problem of updating the threshold in top-k pattern mining algorithms during various stages. We perform extensive experiments on real datasets to demonstrate the efficiency and the effectiveness of TopKMintra. Our results show that even after anonymization, certain patterns may remain in a dataset and those could be mined efficiently.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
π
π
The Cartographer
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted