{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T22:22:58Z","timestamp":1745274178436},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642105821"},{"type":"electronic","value":"9783642105838"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10583-8_7","type":"book-chapter","created":{"date-parts":[[2009,11,24]],"date-time":"2009-11-24T14:38:51Z","timestamp":1259073531000},"page":"49-56","source":"Crossref","is-referenced-by-count":2,"title":["Mining Approximate Frequent Itemsets over Data Streams Using Window Sliding Techniques"],"prefix":"10.1007","author":[{"given":"Younghee","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eunkyoung","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ungmo","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","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, pp. 346\u2013357 (2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"7_CR2","first-page":"191","volume-title":"Data Mining, Next Generation Challenges and Futures Directions","author":"C. Giannella","year":"2004","unstructured":"Giannella, C., Han, J., Pei, J., Yan, X., Yu, P.S.: Mining frequent patterns in data streams at multiple time granularities. In: Data Mining, Next Generation Challenges and Futures Directions, pp. 191\u2013212. AAAI\/MIT Press (2004)"},{"key":"7_CR3","unstructured":"Chang, J., Lee, W.: A Sliding Window Method for Finding Recently Frequent Itemsets over Online Data Streams. Journal of Information Science and Engineering\u00a020(4) (July 2004)"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.is.2004.02.001","volume":"30","author":"C.H. Lee","year":"2005","unstructured":"Lee, C.H., Lin, C.R., Chen, M.S.: Sliding window filtering: An efficient method for incremental mining on a time-variant database. Information Systems\u00a030, 227\u2013244 (2005)","journal-title":"Information Systems"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Yu, J.X., Chong, Z., Lu, H., Zhang, Z., Zhou, A.: False positive or false negative: mining frequent itemsets from high speed transactional data streams. In: Proc, VLDB, pp. 204\u2013215 (2004)","DOI":"10.1016\/B978-012088469-8\/50021-8"}],"container-title":["Communications in Computer and Information Science","Database Theory and Application"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10583-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T01:36:30Z","timestamp":1558402590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10583-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642105821","9783642105838"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10583-8_7","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2009]]}}}