ACM Home Page
Please provide us with feedback. Feedback
Mining relationships among interval-based events for classification
Full text PdfPdf (354 KB)
Source
International Conference on Management of Data archive
Proceedings of the 2008 ACM SIGMOD international conference on Management of data table of contents
Vancouver, Canada
SESSION: Research Session 9: Strings and Time table of contents
Pages 393-404  
Year of Publication: 2008
ISBN:978-1-60558-102-6
Authors
Dhaval Patel  National University of Singapore, Singapore, Singapore
Wynne Hsu  National University of Singapore, Singapore, Singapore
Mong Li Lee  National University of Singapore, Singapore, Singapore
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 21,   Downloads (12 Months): 235,   Citation Count: 1
Additional Information:

abstract   references   cited by   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/1376616.1376658
What is a DOI?

ABSTRACT

Existing temporal pattern mining assumes that events do not have any duration. However, events in many real world applications have durations, and the relationships among these events are often complex. These relationships are modeled using a hierarchical representation that extends Allen's interval algebra. However, this representation is lossy as the exact relationships among the events cannot be fully recovered. In this paper, we augment the hierarchical representation with additional information to achieve a lossless representation. An efficient algorithm called IEMiner is designed to discover frequent temporal patterns from interval-based events. The algorithm employs two optimization techniques to reduce the search space and remove non-promising candidates. From the discovered temporal patterns, we build an interval-based classifier called IEClassifier to differentiate closely related classes. Experiments on both synthetic and real world datasets indicate the efficiency and scalability of the proposed approach, as well as the improved accuracy of IEClassifier.


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
C. Antunes and A. L. Oliveira. Generalization of pattern-growth methods for sequential pattern mining with gap constraints. Machine Learning and Data Mining in Pattern Recognition, 2003.
 
4
H. Cheng, X. Yan, J. Han, and C.-W. Hsu. Discriminative frequent pattern analysis for effective classification. IEEE ICDE, 2007.
 
5
 
6
A. Hakeem, Y. Sheikh, and M. Shah. A hierarchical event representation for the analysis of videos. AAAI, 2004.
7
 
8
 
9
B. Liu, W. Hsu, and Y. Ma. Integrating classification and association rule mining. SIGKDD, 1998.
 
10
H. Mannila, H. Toivonen, and I. Verkamo. Discovery of frequent episodes in event sequences. SIGKDD, 1995.
 
11
 
12
 
13
 
14
T. Zhao R. Nevatia and S. Hongeng. Hierarchical language-based representation of events in video streams. IEEE Workshop on Event Mining, 2003.
 
15


Collaborative Colleagues:
Dhaval Patel: colleagues
Wynne Hsu: colleagues
Mong Li Lee: colleagues