{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:41:34Z","timestamp":1742395294962,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540453741"},{"type":"electronic","value":"9783540460480"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11871637_65","type":"book-chapter","created":{"date-parts":[[2006,9,19]],"date-time":"2006-09-19T11:09:53Z","timestamp":1158664193000},"page":"633-640","source":"Crossref","is-referenced-by-count":4,"title":["Incremental Aspect Models for Mining Document Streams"],"prefix":"10.1007","author":[{"given":"Arun C.","family":"Surendran","sequence":"first","affiliation":[]},{"given":"Suvrit","family":"Sra","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"65_CR1","doi-asserted-by":"crossref","unstructured":"Ando, R.K., Lee, L.: Iterative Residual Rescaling: An Analysis and Generalization of LSI. In: SIGIR (September 2001)","DOI":"10.1145\/383952.383981"},{"key":"65_CR2","unstructured":"Blei, D.M., Griffiths, T.L., Jordan, M.I., Tenenbaum, J.B.: Hierarchical Topic Models and the Nested Chinese Restaurant Process. In: NIPS (2004)"},{"key":"65_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0378-3758(94)00119-G","volume":"47","author":"D. B\u00f6hning","year":"1995","unstructured":"B\u00f6hning, D.: A review of reliable maximum likelihood algorithms for semi-parametric mixture models. J. of Stat. Planning and Inference\u00a047, 5\u201328 (1995)","journal-title":"J. of Stat. Planning and Inference"},{"key":"65_CR4","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S.: Co-clustering documents and words using bipartite spectral graph partitioning. In: Knowledge Discovery and Data Mining, pp. 269\u2013274 (2001)","DOI":"10.1145\/502512.502550"},{"key":"65_CR5","doi-asserted-by":"crossref","unstructured":"Hofmann, T.: Unsupervised learning by Probabilistic Latent Semantic Analysis. Machine Learning\u00a042 (2001)","DOI":"10.1023\/A:1007617005950"},{"key":"65_CR6","unstructured":"Zhang, Z.G.J., Yang, Y.: A Probabilistic Model for On-line Document Clustering with Application to Novelty Detection. In: NIPS (2005)"},{"issue":"5","key":"65_CR7","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"J. Kleinberg","year":"1999","unstructured":"Kleinberg, J.: Authoritative sources in a hyperlinked environment. ACM\u00a046(5), 604\u2013632 (1999)","journal-title":"ACM"},{"key":"65_CR8","doi-asserted-by":"crossref","unstructured":"Kontostathis, A., et al.: A survey of emerging trends detection in textual data mining. In: Survey of Text Mining, pp. 185\u2013224 (2003)","DOI":"10.1007\/978-1-4757-4305-0_9"},{"key":"65_CR9","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/382979.383041","volume":"19","author":"R. Lempel","year":"2001","unstructured":"Lempel, R., Moran, S.: The stochastic approach for link-structure analysis (salsa). ACM Tran. on Info. Sys.\u00a019, 131\u2013160 (2001)","journal-title":"ACM Tran. on Info. Sys."},{"key":"65_CR10","first-page":"361","volume":"5","author":"D.D. Lewis","year":"2004","unstructured":"Lewis, D.D., Yang, Y., Rose, T., Li, F.: RCV1: A New Benchmark Collection for Text Categorization Research. JMLR\u00a05, 361\u2013397 (2004)","journal-title":"JMLR"},{"key":"65_CR11","unstructured":"Mason, L., Baxter, J., Bartlett, P., Frean, M.: Boosting Algorithms as Gradient Descent in Function Space. In: NIPS, pp. 512\u2013518 (2000)"},{"key":"65_CR12","doi-asserted-by":"crossref","unstructured":"Mei, Q., Zhai, C.: Discovering evolutionary theme patters from text - an exploration of temporal mining. In: Knowledge Discovery and Data Mining, pp. 198\u2013207 (2005)","DOI":"10.1145\/1081870.1081895"},{"key":"65_CR13","unstructured":"Platt, J.: FastMap, MetricMap, and Landmark MDS are all Nystrom Algorithms. In: 10th International Workshop on AI and Statistics, pp. 261\u2013268 (2005)"},{"key":"65_CR14","doi-asserted-by":"crossref","unstructured":"Mahadevan, U., Kumar, R., Sivakumar, D.: A graph-theoretic approach to extracting storylines from search results. In: Knowledge Discovery and Data Mining, pp. 216\u2013225 (2004)","DOI":"10.1145\/1014052.1014078"},{"issue":"4","key":"65_CR15","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0167-9473(01)00066-4","volume":"38","author":"G. Ridgeway","year":"1999","unstructured":"Ridgeway, G.: Looking for lumps: boosting and bagging for density estimation. Computational Statistics and Data Analysis\u00a038(4), 379\u2013392 (1999)","journal-title":"Computational Statistics and Data Analysis"},{"key":"65_CR16","unstructured":"Rosset, S., Segal, E.: Boosting density estimation. In: NIPS (2002)"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11871637_65.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T22:31:24Z","timestamp":1736548284000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11871637_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540453741","9783540460480"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11871637_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}