Detecting graph-based spatial outliers
- 26 August 2001
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 371-376
- https://doi.org/10.1145/502512.502567
Abstract
Identification of outliers can lead to the discovery of unexpected, interesting, and useful knowledge. Existing methods are designed for detecting spatial outliers in multidimensional geometric data sets, where a distance metric is available. In this paper, we focus on detecting spatial outliers in graph structured data sets. We define statistical tests, analyze the statistical foundation underlying our approach, design several fast algorithms to detect spatial outliers, and provide a cost model for outlier detection procedures. In addition, we provide experimental results from the application of our algorithms on a Minneapolis-St.Paul(Twin Cities) traffic dataset to show their effectiveness and usefulness.Keywords
This publication has 7 references indexed in Scilit:
- Efficient algorithms for mining outliers from large data setsPublished by Association for Computing Machinery (ACM) ,2000
- OPTICSPublished by Association for Computing Machinery (ACM) ,1999
- OPTICS-OF: Identifying Local OutliersPublished by Springer Nature ,1999
- CCAM: a connectivity-clustered access method for networks and network computationsIEEE Transactions on Knowledge and Data Engineering, 1997
- Computing depth contours of bivariate point cloudsComputational Statistics & Data Analysis, 1996
- A class of data structures for associative searchingPublished by Association for Computing Machinery (ACM) ,1984
- Identification of OutliersPublished by Springer Nature ,1980