{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:25:46Z","timestamp":1725495946148},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770169"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77018-3_25","type":"book-chapter","created":{"date-parts":[[2007,11,26]],"date-time":"2007-11-26T07:46:39Z","timestamp":1196063199000},"page":"231-243","source":"Crossref","is-referenced-by-count":2,"title":["Approximately Mining Recently Representative Patterns on Data Streams"],"prefix":"10.1007","author":[{"given":"Jia-Ling","family":"Koh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan-Bin","family":"Don","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. of Int. Conf. on Very Large Data Bases (1994)"},{"key":"25_CR2","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 International Conference on Knowledge Discovery and Data Ming (2003)","DOI":"10.1145\/956750.956807"},{"key":"25_CR3","first-page":"753","volume":"20","author":"J.H. Chang","year":"2004","unstructured":"Chang, J.H., Lee, W.S.: A Sliding Window Method for Finding Recently Frequent Itemsets over Online Data Streams. Journal of Information Science and Engineering\u00a020, 753\u2013762 (2004)","journal-title":"Journal of Information Science and Engineering"},{"issue":"1","key":"25_CR4","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(1), 53\u201387 (2004)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Jin, C., Qian, W., Sha, C., Yu, J.X., Zhou, A.: Dynamically Maintaining Frequent Items Over a Data Stream. In: Proc. of the 12th ACM International Conference on Information and Knowledge Management (2003)","DOI":"10.1145\/956863.956918"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11823728_34","volume-title":"Data Warehousing and Knowledge Discovery","author":"J.L. Koh","year":"2006","unstructured":"Koh, J.L., Shin, S.N.: An Approximate Approach for Mining Recently Frequent Itemsets from Data Streams. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2006. LNCS, vol.\u00a04081, Springer, Heidelberg (2006)"},{"key":"25_CR7","doi-asserted-by":"crossref","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. of SIAM Intl. Conference on Data Mining (2005)","DOI":"10.1137\/1.9781611972757.7"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Manku, G.S., Chen Motwani, R.: Approximate Frequent Counts over Data Streams. In: Proc. of the 28th International Conference on Very Large Database, Hong Kong, China (August 2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Park, J.S., Chen, M.S., Yu, P.S.: An Effective Hash-based Algorithm for Mining Association Rules. In: Proc. of the ACM SIGMOD International Conference on Management of Data (SIGMOD 1995), May, pp. 175\u2013186 (1995)","DOI":"10.1145\/223784.223813"},{"key":"25_CR10","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: An efficient algorithm for mining frequent closed itemsets. In: Proc. of ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (2000)"},{"key":"25_CR11","series-title":"Lecture Notes in Artificial Intelligence","first-page":"6","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"K. Wang","year":"2002","unstructured":"Wang, K., Tang, L., Han, J., Liu, J.: Top Down FP-Growth for Association Rule Mining. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol.\u00a02336, pp. 6\u20138. Springer, Heidelberg (2002)"},{"key":"25_CR12","unstructured":"Xin, D., Han, J., Yan, X., Cheng, H.: Mining Compressed Frequent-Pattern Sets. in Proc. of Int. Conf. on Very Large Data Bases (VLDB 2005) (2005)"}],"container-title":["Lecture Notes in Computer Science","Emerging Technologies in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77018-3_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:53:31Z","timestamp":1619520811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77018-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540770169"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77018-3_25","relation":{},"subject":[]}}