{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T11:40:07Z","timestamp":1744026007040,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325830"},{"type":"electronic","value":"9783642325847"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32584-7_28","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T11:53:13Z","timestamp":1346154793000},"page":"340-351","source":"Crossref","is-referenced-by-count":3,"title":["Extrapolation Prefix Tree for Data Stream Mining Using a Landmark Model"],"prefix":"10.1007","author":[{"given":"Yun Sing","family":"Koh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Russel","family":"Pears","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gillian","family":"Dobbie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Cheung, W., Zaiane, O.: Incremental mining of frequent patterns without candidate generation or support constraint. In: Proceedings of Seventh International Database Engineering and Applications Symposium, pp. 111\u2013116 (2003)","DOI":"10.1109\/IDEAS.2003.1214917"},{"issue":"301","key":"28_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association\u00a058(301), 13\u201330 (1963)","journal-title":"Journal of the American Statistical Association"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-540-24571-1_38","volume-title":"Database Systems for Advanced Applications","author":"J.-L. Koh","year":"2004","unstructured":"Koh, J.-L., Shieh, S.-F.: An Efficient Approach for Maintaining Association Rules Based on Adjusting FP-Tree Structures. In: Lee, Y., Li, J., Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol.\u00a02973, pp. 417\u2013424. Springer, Heidelberg (2004)"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10115-006-0032-8","volume":"11","author":"C.K.S. Leung","year":"2007","unstructured":"Leung, C.K.S., Khan, Q.I., Li, Z., Hoque, T.: Cantree: a canonical-order tree for incremental frequent-pattern mining. Knowl. Inf. Syst.\u00a011, 287\u2013311 (2007)","journal-title":"Knowl. Inf. Syst."},{"key":"28_CR5","first-page":"11","volume-title":"Proceedings of the 15th International Workshop on Research Issues in Data Engineering: Stream Data Mining and Applications, RIDE 2005","author":"H.F. Li","year":"2005","unstructured":"Li, H.F., Lee, S.Y., Shan, M.K.: Online mining (recently) maximal frequent itemsets over data streams. In: Proceedings of the 15th International Workshop on Research Issues in Data Engineering: Stream Data Mining and Applications, RIDE 2005, pp. 11\u201318. IEEE Computer Society, Washington, DC (2005)"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10115-007-0112-4","volume":"17","author":"H.F. Li","year":"2008","unstructured":"Li, H.F., Shan, M.K., Lee, S.Y.: DSM-FI: an efficient algorithm for mining frequent itemsets in data streams. Knowledge and Information Systems\u00a017, 79\u201397 (2008)","journal-title":"Knowledge and Information Systems"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Manku, G.S., Motwani, R.: Approximate frequency counts over data streams. In: Proceedings of the 28th International Conference on Very Large Data Bases, VLDB 2002, pp. 346\u2013357. VLDB Endowment (2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"28_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1007\/978-3-540-68125-0_108","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"S.K. Tanbeer","year":"2008","unstructured":"Tanbeer, S.K., Ahmed, C.F., Jeong, B.-S., Lee, Y.-K.: CP-Tree: A Tree Structure for Single-Pass Frequent Pattern Mining. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol.\u00a05012, pp. 1022\u20131027. Springer, Heidelberg (2008)"},{"issue":"14","key":"28_CR9","doi-asserted-by":"publisher","first-page":"1986","DOI":"10.1016\/j.ins.2005.11.003","volume":"176","author":"J.X. Yu","year":"2006","unstructured":"Yu, J.X., Chong, Z., Lu, H., Zhang, Z., Zhou, A.: A false negative approach to mining frequent itemsets from high speed transactional data streams. Information Sciences\u00a0176(14), 1986\u20132015 (2006)","journal-title":"Information Sciences"}],"container-title":["Lecture Notes in Computer Science","Data Warehousing and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32584-7_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T11:09:49Z","timestamp":1744024189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32584-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325830","9783642325847"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32584-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}