ACM Home Page
Please provide us with feedback. Feedback
Efficient anomaly monitoring over moving object trajectory streams
Full text MovMov (11:53),  PdfPdf (685 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 159-168  
Year of Publication: 2009
ISBN:978-1-60558-495-9
Authors
Yingyi Bu  The Chinese University of Hong Kong, Hong Kong, Hong Kong
Lei Chen  Hong Kong University of Science and Technology, Hong Kong, Hong Kong
Ada Wai-Chee Fu  The Chinese University of Hong Kong, Hong Kong, Hong Kong
Dawei Liu  The Chinese University of Hong Kong, Hong Kong, Hong Kong
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): 55,   Downloads (12 Months): 130,   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.1557043
What is a DOI?

ABSTRACT

Lately there exist increasing demands for online abnormality monitoring over trajectory streams, which are obtained from moving object tracking devices. This problem is challenging due to the requirement of high speed data processing within limited space cost. In this paper, we present a novel framework for monitoring anomalies over continuous trajectory streams. First, we illustrate the importance of distance-based anomaly monitoring over moving object trajectories. Then, we utilize the local continuity characteristics of trajectories to build local clusters upon trajectory streams and monitor anomalies via efficient pruning strategies. Finally, we propose a piecewise metric index structure to reschedule the joining order of local clusters to further reduce the time cost. Our extensive experiments demonstrate the effectiveness and efficiency of our methods.


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
4
 
5
A. Bulut and A.K. Singh. SWAT: Hierarchical stream summarization in large networks. In ICDE, 2003.
6
 
7
 
8
9
 
10
11
12
 
13
 
14
15
16
 
17
18
 
19
 
20
 
21
22
23
 
24
25
26
27
28
29
 
30
31
 
32
33

Collaborative Colleagues:
Yingyi Bu: colleagues
Lei Chen: colleagues
Ada Wai-Chee Fu: colleagues
Dawei Liu: colleagues