{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T11:23:16Z","timestamp":1725708196282},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642351006"},{"type":"electronic","value":"9783642351013"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35101-3_52","type":"book-chapter","created":{"date-parts":[[2012,11,29]],"date-time":"2012-11-29T11:40:16Z","timestamp":1354189216000},"page":"614-625","source":"Crossref","is-referenced-by-count":1,"title":["Kernel-Tree: Mining Frequent Patterns in a Data Stream Based on Forecast Support"],"prefix":"10.1007","author":[{"given":"David Tse Jung","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun Sing","family":"Koh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gillian","family":"Dobbie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Russel","family":"Pears","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"52_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J. Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. SIGMOD Rec.\u00a029, 1\u201312 (2000)","journal-title":"SIGMOD Rec."},{"key":"52_CR2","first-page":"1447","volume-title":"Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008","author":"S.K. Tanbeer","year":"2008","unstructured":"Tanbeer, S.K., Ahmed, C.F., Jeong, B.S., Lee, Y.K.: Efficient frequent pattern mining over data streams. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, pp. 1447\u20131448. ACM, NY (2008)"},{"key":"52_CR3","unstructured":"Giannella, C., Han, J., Pei, J., Yan, X., Yu, P.S.: Mining frequent patterns in data streams at multiple time granularities (2002)"},{"key":"52_CR4","doi-asserted-by":"crossref","unstructured":"Leung, C.K.S., Khan, Q.I.: DSTree: A tree structure for the mining of frequent sets from data streams. In: Sixth International Conference on Data Mining, ICDM 2006, pp. 928\u2013932 (December 2006)","DOI":"10.1109\/ICDM.2006.62"},{"key":"52_CR5","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":"52_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-642-32584-7_28","volume-title":"Data Warehousing and Knowledge Discovery","author":"Y.S. Koh","year":"2012","unstructured":"Koh, Y.S., Pears, R., Dobbie, G.: Extrapolation Prefix Tree for Data Stream Mining Using a Landmark Model. In: Cuzzocrea, A., Dayal, U. (eds.) DaWaK 2012. LNCS, vol.\u00a07448, pp. 340\u2013351. Springer, Heidelberg (2012)"},{"key":"52_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-642-23544-3_20","volume-title":"Data Warehousing and Knowledge Discovery","author":"Y.S. Koh","year":"2011","unstructured":"Koh, Y.S., Dobbie, G.: SPO-Tree: Efficient Single Pass Ordered Incremental Pattern Mining. In: Cuzzocrea, A., Dayal, U. (eds.) DaWaK 2011. LNCS, vol.\u00a06862, pp. 265\u2013276. Springer, Heidelberg (2011)"},{"issue":"8","key":"52_CR8","doi-asserted-by":"publisher","first-page":"2275","DOI":"10.1109\/TSP.2004.830985","volume":"52","author":"Y. Engel","year":"2004","unstructured":"Engel, Y., Mannor, S., Meir, R.: The kernel recursive least-squares algorithm. IEEE Transactions on Signal Processing\u00a052(8), 2275\u20132285 (2004)","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"301","key":"52_CR9","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"}],"container-title":["Lecture Notes in Computer Science","AI 2012: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35101-3_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T06:07:00Z","timestamp":1557382020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35101-3_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642351006","9783642351013"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35101-3_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}