Incremental aspect models for mining document streams

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4213 LNAI, Issue , 2006, Pages 633-640

  Surendran, Arun C ^a   Sra, Suvrit ^b  

^a MICROSOFT RESEARCH   (United States)

^b University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; ONLINE SEARCHING; QUERY LANGUAGES;

DOCUMENT STREAMS; INCREMENTAL ASPECT MODELS; QUERY-LINE TRACKING;

DATA MINING;

EID: 33750344334     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11871637_65     Document Type: Conference Paper

References (16)

1. R. K. Ando and L. Lee. Iterative Residual Rescaling: An Analysis and Generalization of LSI. In SIGIR, September 2001.
2. D. M. Blei, T. L. Griffiths, M. I. Jordan, and J. B. Tenenbaum. Hierarchical Topic Models and the Nested Chinese Restaurant Process. In NIPS, 2004.
3. D. Böhning. A review of reliable maximum likelihood algorithms for semiparametric mixture models. J. of Stat. Planning and Inference, 47:5-28, 1995.
4. I. S. Dhillon. Co-clustering documents and words using bipartite spectral graph partitioning. In Knowledge Discovery and Data Mining, pages 269-274, 2001.
5. T. Hofmann. Unsupervised learning by Probabilistic Latent Semantic Analysis. Machine Learning, 42, 2001.
6. Z. G. J. Zhang and Y. Yang. A Probabilistic Model for On-line Document Clustering with Application to Novelty Detection. In NIPS, 2005.
7. J. Kleinberg. Authoritative sources in a hyperlinked environment. ACM, 46(5):604-632, 1999.
8. A. Kontostathis et al. A survey of emerging trends detection in textual data mining. In Survey of Text Mining, pages 185-224, 2003.
9. R. Lempel and S. Moran. The stochastic approach for link-structure analysis (salsa). In ACM Tran. on Info. Sys., volume 19, pages 131-160, 2001.
10. D. D. Lewis, Y. Yang, T. Rose, and F. Li. RCV1: A New Benchmark Collection for Text Categorization Research. JMLR, 5:361-397, 2004.
11. L. Mason, J. Baxter, P. Bartlett, and M. Frean. Boosting Algorithms as Gradient Descent in Function Space. In NIPS, pages 512-518, 2000.
12. Q. Mei and C. Zhai. Discovering evolutionary theme patters from text - an exploration of temporal mining. In Knowledge Discovery and Data Mining, pages 198-207, 2005.
13. J. Platt. FastMap, MetricMap, and Landmark MDS are all Nystrom Algorithms. In 10th International Workshop on AI and Statistics, pages 261-268, 2005.
14. U. M. R. Kumar and D. Sivakumar. A graph-theoretic approach to extracting storylines from search results. In Knowledge Discovery and Data Mining, pages 216-225, 2004.
15. G. Ridgeway. Looking for lumps: boosting and bagging for density estimation. Computational Statistics and Data Analysis, 38(4):379-392, 1999.
16. S. Rosset and E. Segal. Boosting density estimation. In NIPS, 2002.