SearcharxivSearch

arXiv · 1912.01861

Mining Top-k Trajectory-Patterns from Anonymized Data

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anuj S. Saxena, Siddharth Dawar, Vikram Goyal, Debajyoti Bera. 2019-12-04. Mining Top-k Trajectory-Patterns from Anonymized Data. https://arxiv.org/abs/1912.01861

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS