Detecting graph-based spatial outliers: Algorithms and applications(a summary of results)

Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2001, Pages 371-376

  Shekhar, Shashi ^a   Lu, Chang Tien ^a   Zhang, Pusheng ^a  

^a University of Minnesota   (United States)

Author keywords

Outlier Detection; Spatial Data Mining; Spatial Graphs

Indexed keywords

ALGORITHMS; GRAPH THEORY; PARAMETER ESTIMATION; PROBLEM SOLVING; STATISTICAL METHODS;

SPATIAL OUTLINERS;

DATA MINING;

EID: 0035788943     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. M. Ankerst, M.-Breunig, H. Kriegel, and J. Sander. Optics: Ordering points to identify the clustering structure. In Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data, Philadephia, Pennsylvania, USA, pages 49-60, 1999.
2. V. Barnett and T. Lewis. Outliers in Statistical Data. John Wiley, New York, 3rd edition, 1994.
3. M. Breunig, H. Kriegel, R. T. Ng, and J. Sander. Optics-of: Identifying local outliers. In Proc. of PKDD '99, Prague, Czech Republic, Lecture Notes in Computer Science (LNAI 1704), pp. 262-270, Springer Verlag, 1999.
4. O. Gunther. The Design of the Cell Tree: An Object-Oriented Index Structure for Geometric Databases. In Proc. 5th Intl. Conference on Data Engineering, Feb. 1989.
5. D. Hawkins. Identification of Outliers. Chapman and Hall, 1980.
6. R. Johnson. Applied Multivariate Statistical Analysis. Prentice Hall, 1992.
7. E. Knorr and R. Ng. A unified notion of outliers: Properties and computation. In Proc. of the International Conference on Knowledge Discovery and Data Mining, pages 219-222, 1997.
8. E. Knorr and R. Ng. Algorithms for mining distance-based outliers in large datasets. In Proc. 24th VLDB Conference, 1998.
9. A. Orenstein and T. Merrett. A Class of Data Structures for Associative Searching. In Proc. Symp. on Principles of Database Systens, pages 181-190, 1984.
10. F. Preparata and M. Shamos. Computatinal Geometry: An Introduction. Springer Verlag, 1988.
11. S. Ramaswamy, R. Rastongi, and K. Shim. Efficient algorithms for mining outliers from large data sets. In Proceedings of ACM SIGMOD International Conference on Management of Data, Dallas, Texas, 2000.
12. I. Ruts and P. Rousseeuw. Computing depth contours of bivariate point clouds. In Computational Statistics and Data Analysis, 23:153-168, 1996.
13. S. Shekhar and D.-R. Liu. CCAM: A connectivity-Clustered Access Method for Aggregate Queries on Transportation Networks-A Summary of Results. IEEE Trans. on Knowledge and Data Eng., 9(1), January 1997.
14. D. Yu, G. Sheikholeslami, and A. Zhang. Findout: Finding outliers in very large datasets. In Department of Computer Science and Engineering State University of New York at Buffalo Buffalo, Technical report 99-03, http://www.ese.buffalo.edu/teeh-reports/, 1999.