Abstract | ||
---|---|---|
Previous approaches to solve the trajectory outlier detection problem exclusively examine single outliers. However, anomalies in trajectory data may often occur in groups. This paper introduces a new problem, group trajectory outlier detection (GTOD) and proposes a novel algorithm, named, CD\\(k\\text {NN}\\)-GTOD (Closed DBSCAN kNearest Neighbors for Group Trajectory Outlier Detection). The process starts by determining micro clusters using the DBSCAN algorithm. Next, a pruning strategy using \\(k\\text {NN}\\) is performed for each micro cluster. Finally, an efficient pattern mining algorithm is applied to the resulting subsets of group of trajectory candidates to determine the group of trajectory outliers. We performed a comparative study using real trajectory databases to evaluate the proposed approach. The results have shown the efficiency and effectiveness of CD\\(k\\text {NN}\\)-GTOD. |
Year | DOI | Venue |
---|---|---|
2020 | 10.1007/978-3-030-54623-6_6 | ADBIS |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Youcef Djenouri | 1 | 300 | 32.51 |
Kjetil Nørvåg | 2 | 1311 | 79.26 |
Heri Ramampiaro | 3 | 154 | 20.46 |
Jerry Chun-Wei Li | 4 | 0 | 0.34 |