{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:38Z","timestamp":1725512018892},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540717027"},{"type":"electronic","value":"9783540717034"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71703-4_56","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T00:31:22Z","timestamp":1186014682000},"page":"664-675","source":"Crossref","is-referenced-by-count":6,"title":["CLAIM: An Efficient Method for Relaxed Frequent Closed Itemsets Mining over Stream Data"],"prefix":"10.1007","author":[{"given":"Guojie","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongqing","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baihua","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunfeng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunqing","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"56_CR1","doi-asserted-by":"crossref","unstructured":"Yu, J.X., Chong, Z., Lu, H., Zhou, A.: False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams. In: Proc. of the 28th Intl. Conf. on Very Large Data Bases, pp. 204\u2013215 (2004)","DOI":"10.1016\/B978-012088469-8\/50021-8"},{"key":"56_CR2","unstructured":"Pei, J., Dong, G., Zou, W., Han, J.: On Computing Condensed Frequent Pattern Bases. In: Proc. of IEEE Intl. Conf. on Data Mining, pp. 378\u2013385 (2002)"},{"key":"56_CR3","doi-asserted-by":"crossref","unstructured":"Chang, J.H., Lee, W.S.: Finding recent frequent itemsets adaptively over online data streams. In: Proc. of the 9th ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining, pp. 487\u2013492 (2003)","DOI":"10.1145\/956750.956807"},{"key":"56_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/3-540-45465-9_59","volume-title":"Automata, Languages and Programming","author":"M. Charikar","year":"2002","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding Frequent Items in Data Streams. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, p. 693. Springer, Heidelberg (2002)"},{"key":"56_CR5","doi-asserted-by":"crossref","unstructured":"Manku, G., Motwani, R.: Approximate frequency counts over data streams. In: Proc. of the 28th Intl. Conf. on Very Large Data Bases, pp. 346\u2013357 (2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"56_CR6","unstructured":"Giannella, C., Han, J., Robertson, E., Liu, C.: Mining frequent itemsets over arbitrary time intervals in data streams. Technical Report tr587, Indiana University (2003)"},{"key":"56_CR7","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: What\u2019s Hot and What\u2019s Not: Tracking Most Frequent Items Dynamically. In: The ACM Symposium on Principles of Database Systems, pp. 296\u2013306 (2003)","DOI":"10.1145\/773153.773182"},{"issue":"1","key":"56_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/762471.762473","volume":"28","author":"R.M. Karp","year":"2003","unstructured":"Karp, R.M., Shenker, S.: A Simple Algorithm for Finding Frequent Elements in Streams and Bags. ACM Transactions on Database Systems\u00a028(1), 51\u201355 (2003)","journal-title":"ACM Transactions on Database Systems"},{"key":"56_CR9","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent itemsets without candidate generation. In: Proc. of the ACM SIGMOD Intl. Conf. on Management of Database, pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"key":"56_CR10","doi-asserted-by":"crossref","unstructured":"Gouda, K., Zaki, M.J.: Efficiently mining maximal frequent itemsets. In: Proc. of the 2001 IEEE Intl. Conf. on Data Mining, pp. 163\u2013170 (2001)","DOI":"10.1109\/ICDM.2001.989514"},{"key":"56_CR11","doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J., Pei, J.: Closet+: searching for the best strategies for mining frequent closed itemsets. In: Proc. of the Intl. Conf. Knowledge Discovery and Data Mining, pp. 236\u2013245 (2003)","DOI":"10.1145\/956750.956779"},{"key":"56_CR12","unstructured":"Chi, Y., Wang, H., Yu, P., Muntz, R.: MOMENT: Maintaining closed frequent itemsets over a stream sliding window. In: Proc. Of 4th IEEE Intl. Conf. on Data Mining, pp. 59\u201366 (2004)"},{"issue":"7","key":"56_CR13","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B. Bloom","year":"1970","unstructured":"Bloom, B.: Space\/time tradeoffs in in hash coding with allowable errors. Communications of the ACM\u00a013(7), 422\u2013426 (1970)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases: Concepts, Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71703-4_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:54:46Z","timestamp":1619517286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71703-4_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540717027","9783540717034"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71703-4_56","relation":{},"subject":[]}}