ACM Home Page
Please provide us with feedback. Feedback
A LRT framework for fast spatial anomaly detection
Full text MovMov (19:55),  PdfPdf (405 KB)
Source
International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Paris, France
SESSION: Research track papers table of contents
Pages 887-896  
Year of Publication: 2009
ISBN:978-1-60558-495-9
Authors
Mingxi Wu  Oracle Corporation, Redwood Shores, USA
Xiuyao Song  Yahoo!, Inc, Sunnyvale, USA
Chris Jermaine  Rice University, Houston, USA
Sanjay Ranka  University of Florida, Gainesville, USA
John Gums  University of Florida, Gainesville, USA
Sponsors
ACM: Association for Computing Machinery
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 56,   Downloads (12 Months): 119,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1557019.1557116
What is a DOI?

ABSTRACT

Given a spatial data set placed on an n x n grid, our goal is to find the rectangular regions within which subsets of the data set exhibit anomalous behavior. We develop algorithms that, given any user-supplied arbitrary likelihood function, conduct a likelihood ratio hypothesis test (LRT) over each rectangular region in the grid, rank all of the rectangles based on the computed LRT statistics, and return the top few most interesting rectangles. To speed this process, we develop methods to prune rectangles without computing their associated LRT statistics.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
]]A. Dempster, N. Laird, and D. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal Royal Stat. Soc., Series B, 39(1):1--38, 1977.
 
4
]]S. Dudoit, J. P. Shaffer, and J. C. Boldrick. Multiple hypothesis testing in microarray experiments. Statistical Science, 18:71--103, 2003.
 
5
]]M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. KDD 1996, pages 226--231, Sept. 1996.
 
6
]]M. Kulldorff. A spatial scan statistic. Comm. in stat.: Theory and Methods, 26(6):1481--1496, 1997.
 
7
]]M. Kulldorff. Spatial scan statistics: model, calculations, and applications. In Scan Statistics and Applications, pages 303---322, 1999.
8
9
 
10
 
11
 
12
]]S. S. Wilks. The large sample distribution of the likelihood ratio for testing composite hypotheses. Annals of Mathematical Statistics, 9:60--62, 1938.

Collaborative Colleagues:
Mingxi Wu: colleagues
Xiuyao Song: colleagues
Chris Jermaine: colleagues
Sanjay Ranka: colleagues
John Gums: colleagues