The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Trajectory Outlier Detection: A Partition-and-Detect Framework
Abstract
Outlier detection has been a popular data mining task. However, there is a lack of serious study on outlier detection for trajectory data. Even worse, an existing trajectory outlier detection algorithm has limited capability to detect outlying sub-trajectories. In this paper, we propose a novel partition-and-detect framework for trajectory outlier detection, which partitions a trajectory into a set of line segments, and then, detects outlying line segments for trajectory outliers. The primary advantage of this framework is to detect outlying sub-trajectories from a trajectory database. Based on this partition-and-detect framework, we develop a trajectory outlier detection algorithm TRAOD. Our algorithm consists of two phases: partitioning and detection. For the first phase, we propose a two-level trajectory partitioning strategy that ensures both high quality and high efficiency. For the second phase, we present a hybrid of the distance-based and density-based approaches. Experimental results demonstrate that TRAOD correctly detects outlying sub-trajectories from real trajectory data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
LOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335388 · Cited by 5,207
LOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335388 · Cited by 4,149
Barnett, V., Lewis, T., & Abeles, F. (1979) · Physics Today · doi:10.1063/1.2995737 · Cited by 2,824
Efficient algorithms for mining outliers from large data sets
Ramaswamy, S., Rastogi, R., & Shim, K. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335437 · Cited by 1,860
Atkinson, A., Barnett, V., & Lewis, T. (1995) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2983451 · Cited by 1,682
Algorithms for Mining Distance-Based Outliers in Large Datasets
Knorr, E. M., & Ng, R. T. (1998) · Cited by 1,544
Distance-based outliers: algorithms and applications
Knorr, E. M., Ng, R. T., & Tucakov, V. (2000) · The VLDB Journal The International Journal on Very Large Data Bases · doi:10.1007/s007780050006 · Cited by 1,195
Efficient algorithms for mining outliers from large data sets
Ramaswamy, S., Rastogi, R., & Shim, K. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335437 · Cited by 1,171
Outlier detection for high dimensional data
Aggarwal, C. C., & Yu, P. S. (2001) · Proceedings of the 2001 ACM SIGMOD international conference on Management of data · doi:10.1145/375663.375668 · Cited by 1,029
LOCI: fast outlier detection using the local correlation integral
Papadimitriou, S., Kitagawa, H., Gibbons, P. B., & Faloutsos, C. (2004) · Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405) · doi:10.1109/icde.2003.1260802 · Cited by 846
Finding Intensional Knowledge of Distance-Based Outliers
Knorr, E. M., & Ng, R. T. (1999) · Cited by 423
Advances in Minimum Description Length: Theory and Applications
Grünwald, P., Myung, I. J., & Pitt, M. A. (2005) · Data Archiving and Networked Services (DANS) · Cited by 408
Mining top-n local outliers in large databases
Jin, W., Tung, A. K. H., & Han, J. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502554 · Cited by 328
Self-citationAdvances in Minimum Description Length: Theory and Applications
(2005) · The MIT Press eBooks · doi:10.7551/mitpress/1114.001.0001 · Cited by 300
Bremer, R. (1995) · Technometrics · doi:10.1080/00401706.1995.10485900 · Cited by 202
ROAM: Rule- and Motif-Based Anomaly Detection in Massive Moving Object Data Sets
Li, X., Han, J., Kim, S., & González, H. (2007) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972771.25 · Cited by 161
Self-citation
Cited by
Outlier Detection for Temporal Data: A Survey
Gupta, M., Gao, J., Aggarwal, C. C., & Han, J. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.184 · Cited by 1,001
Self-citationSpatio-Temporal Data Mining: A Survey of Problems and Methods
Atluri, G., Karpatne, A., & Kumar, V. (2019) · ACM Computing Surveys · doi:10.1145/3161602 · Cited by 461
Geospatial Big Data: Challenges and Opportunities
Lee, J.-G., & Kang, M. (2015) · Big Data Research · doi:10.1016/j.bdr.2015.01.003 · Cited by 453
Self-citationA Survey of Traffic Prediction: from Spatio-Temporal Data to Intelligent Transportation
Yuan, H., & Li, G. (2021) · Data Science and Engineering · doi:10.1007/s41019-020-00151-z · Cited by 389
Discovering spatio-temporal causal interactions in traffic data streams
Liu, W., Zheng, Y., Chawla, S., Yuan, J., & Xing, X. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020571 · Cited by 350
Metadata
- Authors
- Lee, J.-G., Han, J., & Li, X.
- Venue
- 2008 IEEE 24th International Conference on Data Engineering
- Publisher
- IEEE
- Published
- 2008-04
- Pages
- 140-149
- ISSN
- 1084-4627 (ISSN-L)
- OpenAlex
- W2046466133
- Cited by
- 443
- References
- 17
- FWCI
- 23.20
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.