skip to main content
10.1145/502512.502567acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
Article

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

Published:26 August 2001Publication History

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.

References

  1. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.V. Barnett and T. Lewis. Outliers in Statistical Data. John Wiley, New York, 3rd edition, 1994.Google ScholarGoogle Scholar
  3. 3.M. Breunig, H. Kriegel, R. T. Ng, and J. Sander. Optics-of: Identifying local outliers. In Proe. of PKDD '99, Prague, Czech Republic, Lecture Notes in Computer Science (LNAI 1704), pp. 262-270, Springer Verlag, 1999. Google ScholarGoogle Scholar
  4. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.D. Hawkins. Identification of Outliers. Chapman and Hail, 1980.Google ScholarGoogle ScholarCross RefCross Ref
  6. 6.R. Johnson. Applied Multivariate Statistical Analysis. Prentice Hall, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 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.Google ScholarGoogle Scholar
  8. 8.E. Knorr and R. Ng. Algorithms for mining distance-based outliers in large datasets. In Proc. 24th VLDB Conference, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.A. Orenstein and T. Merrett. A Class of Data Structures for Associative Searching. In Proc. Syrup. on Principles of Database Systens, pages 181-190, 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.F. Preparata and M. Shamos. Computatinal Geometry: An Introduction. Springer Verlag, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.I. Ruts and P. Rousseeuw. Computing depth contours of bivariate point clouds. In Computational Statistics and Data Analysis, 23:153-168, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 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.cse.buffalo.edu/tech-reports/, 1999.Google ScholarGoogle Scholar

Index Terms

  1. Detecting graph-based spatial outliers: algorithms and applications (a summary of results)

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
            August 2001
            493 pages
            ISBN:158113391X
            DOI:10.1145/502512

            Copyright © 2001 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 26 August 2001

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            KDD '01 Paper Acceptance Rate31of237submissions,13%Overall Acceptance Rate1,133of8,635submissions,13%

            Upcoming Conference

            KDD '24

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader