Distance-based k-nearest neighbors outlier detection method in large-scale traffic data
- 1 July 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15461874,p. 507-510
Abstract
This paper presents a k-nearest neighbors (kNN) method to detect outliers in large-scale traffic data collected daily in every modern city. Outliers include hardware and data errors as well as abnormal traffic behaviors. The proposed kNN method detects outliers by exploiting the relationship among neighborhoods in data points. The farther a data point is beyond its neighbors, the more possible the data is an outlier. Traffic data here was recorded in a video format, and converted to spatial-temporal (ST) traffic signals by statistics. The ST signals are then transformed to a two-dimensional (2D) (x, y) -coordinate plane by Principal Component Analysis (PCA) for dimension reduction. The distance-based kNN method is evaluated by unsupervised and semi-supervised approaches. The semi-supervised approach reaches 96.19% accuracy.Keywords
This publication has 10 references indexed in Scilit:
- Outlier detection in traffic data based on the Dirichlet process mixture modelIET Intelligent Transport Systems, 2015
- Patterned Fabric Inspection and Visualization by the Method of Image DecompositionIEEE Transactions on Automation Science and Engineering, 2014
- Large Scale KNN-Graph Approximation2012
- Parallel Construction of Approximate kNN Graph2012
- Traffic-Sign Recognition Systems2011
- A comparison of outlier detection algorithms for ITS dataExpert Systems with Applications, 2010
- Anomaly detectionACM Computing Surveys, 2009
- Angle-based outlier detection in high-dimensional data2008
- Outlier detection using k-nearest neighbour graph2004
- Empirical Approaches to Outlier Detection in Intelligent Transportation Systems DataTransportation Research Record: Journal of the Transportation Research Board, 2003