ACM Home Page
Please provide us with feedback. Feedback
Data association for topic intensity tracking
Full text PdfPdf (619 KB)
Source ACM International Conference Proceeding Series; Vol. 148 archive
Proceedings of the 23rd international conference on Machine learning table of contents
Pittsburgh, Pennsylvania
Pages: 497 - 504  
Year of Publication: 2006
ISBN:1-59593-383-2
Authors
Andreas Krause  Carnegie Mellon University, Pittsburgh, PA
Jure Leskovec  Carnegie Mellon University, Pittsburgh, PA
Carlos Guestrin  Carnegie Mellon University, Pittsburgh, PA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 41,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

We present a unified model of what was traditionally viewed as two separate tasks: data association and intensity tracking of multiple topics over time. In the data association part, the task is to assign a topic (a class) to each data point, and the intensity tracking part models the bursts and changes in intensities of topics over time. Our approach to this problem combines an extension of Factorial Hidden Markov models for topic intensity tracking with exponential order statistics for implicit data association. Experiments on text and email datasets show that the interplay of classification and topic intensity tracking improves the accuracy of both classification and intensity tracking. Even a little noise in topic assignments can mislead the traditional algorithms. However, our approach detects correct topic intensities even with 30% topic noise.


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
Aizen, J., Huttenlocher, D., Kleinberg, J., & Novak, A. (2004). Traffic-based feedback on the web. Proc. Natl. Acad. Sci., 101, 5254--5260.
2
 
3
Blei, D., & Lafferty, J. (2005). Correlated topic models. NIPS '05.
 
4
 
5
Deerwester, S. C., Dumais, S. T., Landauer, T. K., Furnas, G. W., & Harshman, R. A. (1990). Indexing by latent semantic analysis. J. of the Am. Soc. of Inf. Sci., 41.
 
6
 
7
Ghahramani, Z., & Jordan, M. I. (1995). Factorial hidden Markov models. NIPS '95.
 
8
Kleinberg, J. (2003). Bursty and hierarchical structure in streams. KDD '03.
 
9
Krause, A., Leskovec, J., & Guestrin, C. (2006). Data association for topic intensity tracking (Technical Report CMU-ML-06-100). Carnegie Mellon University.
 
10
Lerner, U. (2002). Hybrid bayesian networks for reasoning about complex systems. Ph.d. thesis, Stanford University.
 
11
 
12
Ng, B., Pfeffer, A., & Dearden, R. (2005). Continuous time particle filtering. IJCAI.
 
13
Nodelman, U., Shelton, C., & Koller, D. (2003). Learning continuous time bayesian networks. UAI.
14
15
 
16
17


Collaborative Colleagues:
Andreas Krause: colleagues
Jure Leskovec: colleagues
Carlos Guestrin: colleagues