ACM Home Page
Please provide us with feedback. Feedback
LIPED: HMM-based life profiles for adaptive event detection
Full text PdfPdf (878 KB)
Source International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining table of contents
Chicago, Illinois, USA
POSTER SESSION: Research track poster table of contents
Pages: 556 - 561  
Year of Publication: 2005
ISBN:1-59593-135-X
Authors
Chien Chin Chen  Academia Sinica, Taiwan & National Taiwan University, Taiwan
Meng Chang Chen  Academia Sinica, Taiwan
Ming-Syan Chen  National Taiwan University, Taiwan
Sponsors
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 51,   Citation Count: 3
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/1081870.1081936
What is a DOI?

ABSTRACT

In this paper, the proposed LIPED (LIfe Profile based Event Detection) employs the concept of life profiles to predict the activeness of event for effective event detection. A group of events with similar activeness patterns shares a life profile, modeled by a hidden Markov model. Considering the burst-and-diverse property of events, LIPED identifies the activeness status of event. As a result, LIPED balances the clustering precision and recall to achieve better F1 scores than other well known approaches evaluated on the official TDT1 corpus.


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
Aizen, J., Huttenlocher, D., Kleinberg, J., and Novak, A. Traffic-Based Feedback on the Web. In Proceedings of the National Academy of Sciences: 101, 2004, 5254--5260.
3
 
4
Allan, J., Carbonell, J., Doddington, G., Yamron, J., and Yang, Y. Topic Detection and Tracking Pilot Study: Final Report. In Proceedings of the DARPA Broadcast News Transcription and Understanding Workshop, 1998, 194--218.
 
5
Baum, L. E., Petrie, T., Soules, G., and Weiss, N. A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains. In Annals of Mathematical Statistics: 41, 1970, 164--171.
 
6
Dempster, A. P., Laird, N. M., and Rubin, D. B. Maximum likelihood from incomplete data via the EM algorithm. In Journal of the Royal Statistical Society. Series B 39, 1977, 1--38.
7
 
8
Ghahramani, S. Fundamentals of Probability. Prentice Hall, 2000.
 
9
Markov, A. A. An example of statistical investigation in the text of 'Eugene Onyegin' illustrating coupling of 'tests' in chains. In Proceedings of the Academy of Sciences 7, 1913, 153--162.
 
10
 
11
Myers, C., Rabiner, L. R., and Rosenberg, A. E. Performance Tradeoffs in Dynamic Time Warping Algorithms for Isolated Word Recognition. In IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. ASSP-28, No. 6, Dec, 1980, 623--635.
 
12
Rabiner, L. R. A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition. In Proceedings of the IEEE, 77(2), 1989, 257--286.
 
13
 
14
Viterbi, A. J. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. In IEEE Transactions on Information Theory IT-13, 1967, 1260--1269.
15


Collaborative Colleagues:
Chien Chin Chen: colleagues
Meng Chang Chen: colleagues
Ming-Syan Chen: colleagues