skip to main content
10.1145/1066677.1066790acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article

LS3: a <u>L</u>inear <u>S</u>emantic <u>S</u>can <u>S</u>tatistic technique for detecting anomalous windows

Published:13 March 2005Publication History

ABSTRACT

Often, it is required to identify anomalous windows along a linear path that reflect unusual rate of occurrence of a specific event of interest. Such examples include: determination of places with high number of occurrences of road accidents along a highway, leaks in natural gas transmission pipelines, pedestrian fatalities on roads, etc. In this paper, we propose a <u>L</u>inear <u>S</u>emantic <u>S</u>can <u>S</u>tatistic (LS3) approach to identify such anomalous windows along a linear path. We assume that a linear path is comprised of one-dimensional spatial locations called markers, where each marker is associated with a set of structural and behavioral attributes. We divide the linear path into linear semantic segments such that each semantic segment contains markers associated with similar structural attributes. Our goal is to identify the windows within a semantic segment whose behavioral attributes are anomalous in some sense. We accomplish this by applying the scan statistic to the behavioral attributes of the markers. We have implemented our approach by considering the real datasets of certain highways in New Jersey, USA. Our results validate that LS3 is effective in identifying high traffic accident windows.

References

  1. Ankerst M., Bruenig M. M., Kriegel H-P., Sander J. OPTICS: Ordering Points to identify the clustering structure, ACM SIGMOD '99. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Barnett V., Lewis. R. Outliers in statistical data. John Wiley and Sons, 1994Google ScholarGoogle Scholar
  3. Ester M., Kriegel H. -P., Sander J., and Xu X., A density-based algorithm for discovering clusters in large spatial databases. KDD'96.Google ScholarGoogle Scholar
  4. Federal Highway Administration, Safety Effectiveness of Intersection, Left- and Right-Turn Lanes, FHWA-RD-02-089, July 2002.Google ScholarGoogle Scholar
  5. Glaz. j, Naus. J, Wallenstein. S, Scan Statistics, Springer Verlag Series in Statistics.Google ScholarGoogle Scholar
  6. Kulldorff. M., A Spatial Scan Statistic, Communications of Statistics -- Theory Meth., 26(6) 1481--1496 (1997)Google ScholarGoogle ScholarCross RefCross Ref
  7. Kaufman L. and Rousseeuw P. J. Finding Groups in Data: an Introduction to Cluster Analysis. John Wiley & Sons, 1990.Google ScholarGoogle Scholar
  8. McGreevey and Lettiere Cut Ribbon on $55 Million Rt 1&130 Interchange Improvement Project, July 02, 2003.Google ScholarGoogle Scholar
  9. Naus J. The distribution of the size of the maximum cluster of points on the line. Journal of the American Statistical Association 60, 532--538, 1965a.Google ScholarGoogle ScholarCross RefCross Ref
  10. New Jersey accident data for state routes: http://www.state.ni.us/transportation/refdata/accident/Google ScholarGoogle Scholar
  11. Njdot, Top 100 Intersection Crash Locations in NJ 98-99Google ScholarGoogle Scholar
  12. S. Shekhar, C. T. Lu, P. Zhang, Detecting Graph-based Spatial Outliers: Algorithms and Applications, SIGKDD, 2001 Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 2001 State Data for Fatalities Relating to Roadway, Pedestrian and Large Trucks, http://www.nhtsa.dot.gov/people/Crash/crashstatistics/Google ScholarGoogle Scholar

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
    SAC '05: Proceedings of the 2005 ACM symposium on Applied computing
    March 2005
    1814 pages
    ISBN:1581139640
    DOI:10.1145/1066677

    Copyright © 2005 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: 13 March 2005

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • Article

    Acceptance Rates

    Overall Acceptance Rate1,650of6,669submissions,25%

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader