{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:31:12Z","timestamp":1725532272903},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642015090"},{"type":"electronic","value":"9783642015106"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","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-01510-6_95","type":"book-chapter","created":{"date-parts":[[2009,5,20]],"date-time":"2009-05-20T03:38:37Z","timestamp":1242790717000},"page":"845-852","source":"Crossref","is-referenced-by-count":1,"title":["WSFI-Mine: Mining Frequent Patterns in Data Streams"],"prefix":"10.1007","author":[{"given":"Younghee","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ungmo","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"95_CR1","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":"95_CR2","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":"95_CR3","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Conf. of the 20th VLDB conference, pp. 487\u2013499 (1994)"},{"key":"95_CR4","unstructured":"Li., H.F., Lee, S.Y., Shan, M.K.: An Efficient Algorithm for Mining Frequent Itemsets over the Entire History of Data Streams. In: Proceedings of First International Workshop on Knowledge Discovery in Data Streams 9IWKDDS (2004)"},{"key":"95_CR5","unstructured":"Li., H.F., Lee, S.Y., Shan, M.K.: Online Mining (Recently) Maximal Frequent Itemsets over Data Streams. In: Proceedings of the 15th IEEE International Workshop on Research Issues on Data Engineering, RIDE (2005)"},{"key":"95_CR6","unstructured":"Chi, Y., Wang, H., Yu, P.S., Muntz, R.R.: Moment: Maintaining Closed Frequent Itemsets over a Stream Sliding Window. In: Proceedings of the Fourth IEEE International Conference on Data Mining (ICDM 2004) (2004)"},{"key":"95_CR7","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":"95_CR8","first-page":"68","volume-title":"Proc. SIAM Int\u2019l. Conference on Data Mining","author":"C.H. Lin","year":"2005","unstructured":"Lin, C.H., Chiu, D.Y., Wu, Y.H., Chen, A.L.P.: Mining Frequent Itemsets from Data Streams with a Time-sensitive Sliding Window. In: Proc. SIAM Int\u2019l. Conference on Data Mining, pp. 68\u201379. SIAM, Philadelphia (2005)"},{"key":"95_CR9","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proc. of 2000 ACM SIGMOD, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"key":"95_CR10","doi-asserted-by":"crossref","unstructured":"Li, H.F., Lee, S.Y.: Mining Frequent Itemsets over Data Streams using Efficient Window Sliding Techniques. Expert Systems with Applications (2008)","DOI":"10.1016\/j.eswa.2007.07.046"},{"key":"95_CR11","doi-asserted-by":"crossref","unstructured":"Li, H.F., Ho, C.C., Shan, M.K., Lee, S.Y.: Efficient Maintenance and Mining of Frequent Itemsets over Online Data Streams with a Sliding Window. In: IEEE SMC 2006 (2006)","DOI":"10.1109\/ICSMC.2006.385267"},{"key":"95_CR12","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1016\/j.jss.2007.07.026","volume":"81","author":"C.J. Chu","year":"2008","unstructured":"Chu, C.J., Tseng, V.S., Liang, T.: An Efficient Algorithm for Mining Temporal High Utility Itemsets from Data Streams. The Journal of System and Software\u00a081, 1105\u20131117 (2008)","journal-title":"The Journal of System and Software"},{"key":"95_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11788911_13","volume-title":"Flexible and Efficient Information Handling","author":"Y. Guo","year":"2006","unstructured":"Guo, Y., et al.: A FP-tree based method for inverse frequent set mining. In: Bell, D.A., Hong, J. (eds.) BNCOD 2006. LNCS, vol.\u00a04042, pp. 152\u2013163. Springer, Heidelberg (2006)"},{"key":"95_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-540-68125-0_61","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"C.K.S. Leung","year":"2008","unstructured":"Leung, C.K.S., et al.: A tree-based approach for frequent pattern mining from uncertain data. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol.\u00a05012, pp. 653\u2013661. Springer, Heidelberg (2008)"},{"issue":"3","key":"95_CR15","first-page":"287","volume":"11","author":"C.K.S. Leung","year":"2007","unstructured":"Leung, C.K.S., et al.: CanTree: a canonical-order tree for incremental frequent-pattern mining. KAIS\u00a011(3), 287\u2013311 (2007)","journal-title":"KAIS"},{"key":"95_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J. Han","year":"2004","unstructured":"Han, J., Pei, J., Yin, Y., Mao, R.: Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach. Data Mining and Knowledge Discovery\u00a08, 53\u201387 (2004)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"95_CR17","doi-asserted-by":"crossref","unstructured":"Zhu, X.D., Huang, Z.Q.: Conceptual modeling rules extracting for data streams. Knowledge-Based Systems, 1\u20137 (2008)","DOI":"10.1016\/j.knosys.2008.04.003"}],"container-title":["Lecture Notes in Computer Science","Advances in Neural Networks \u2013 ISNN 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01510-6_95","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T01:27:46Z","timestamp":1552008466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01510-6_95"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642015090","9783642015106"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01510-6_95","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}