Name
Abstract | ||
|---|---|---|
In this paper, we study the problem of mining for frequent trajectories, which is crucial in many application scenarios, such as vehicle traffic management, hand-off in cellular networks, supply chain management. We approach this problem as that of mining for frequent sequential patterns. Our approach consists of a partitioning strategy for incoming streams of trajectories in order to reduce the trajectory size and represent trajectories as strings. We mine frequent trajectories using a sliding windows approach combined with a counting algorithm that allows us to promptly update the frequency of patterns. In order to make counting really efficient, we represent frequent trajectories by prime numbers, whereby the Chinese reminder theorem can then be used to expedite the computation. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-319-08407-7_4 | Lecture Notes in Artificial Intelligence |
Field | DocType | Volume |
Data mining,Prime number,Data patterns,Computer science,Supply chain management,Cellular network,Trajectory,Computation | Conference | 8399 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.35 |
References | Authors | |
30 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elio Masciari | 1 | 332 | 46.45 |
| Shi Gao | 2 | 112 | 7.72 |
| Carlo Zaniolo | 3 | 4305 | 1447.58 |