{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T20:57:35Z","timestamp":1758401855805},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642025679"},{"type":"electronic","value":"9783642025686"}],"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-02568-6_78","type":"book-chapter","created":{"date-parts":[[2009,6,25]],"date-time":"2009-06-25T12:54:02Z","timestamp":1245934442000},"page":"767-776","source":"Crossref","is-referenced-by-count":14,"title":["An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream"],"prefix":"10.1007","author":[{"given":"Show-Jane","family":"Yen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue-Shi","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng-Wei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chin-Lin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"78_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithm for Mining Association Rules. In: Proceedings of International Conference on Very Large Data Bases, Santiago, Chile, pp. 487\u2013499 (1994)"},{"key":"78_CR2","unstructured":"Chi, Y., Wang, H., Yu, P.S., Muntz, R.R.: Moment: Maintaining Closed Frequent Itemsets over a Stream Sliding Window. In: Proceedings of 2004 IEEE International Conference on Data Mining, Brighton, pp. 59\u201366 (2004)"},{"key":"78_CR3","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, Dallas, USA, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"key":"78_CR4","doi-asserted-by":"crossref","unstructured":"Jiang, N., Gruenwald, L.: CFI-Stream: Mining Closed Frequent Itemsets in Data Streams. In: Proceedings of 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, USA, pp. 592\u2013597 (2006)","DOI":"10.1145\/1150402.1150473"},{"issue":"9","key":"78_CR5","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1109\/TKDE.2007.1047","volume":"19","author":"L. Ji","year":"2007","unstructured":"Ji, L., Tan, K.-L., Tung, A.: Compressed Hierarchical Mining of Frequent Closed Patterns from Dense Data Sets. IEEE Trans. on Knowledge and Data Engineering\u00a019(9), 1175\u20131187 (2007)","journal-title":"IEEE Trans. on Knowledge and Data Engineering"},{"key":"78_CR6","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, T., Taouil, R., Lakhal, L.: Discovering Frequent Closed Itemsets for Association Rules. In: Proceedings of the 7th International Conference on Database Theory, Jerusalem, Israel, pp. 398\u2013416 (1999)","DOI":"10.1007\/3-540-49257-7_25"},{"key":"78_CR7","unstructured":"Pei, J., Han, J., Mao, R.: Closet: An Efficient Algorithm for Mining Frequent Closed Itemsets. In: Proceedings of the ACM SIGKDD International Workshop on Research Issues in Data Mining and Knowledge Discovery, Dallas, USA, pp. 21\u201331 (2000)"},{"key":"78_CR8","doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J., Pei, J.: Closet+: Searching for the Best Strategies for Mining Frequent Closed Itemsets. In: Proceedings of 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, pp. 236\u2013245 (2003)","DOI":"10.1145\/956750.956779"}],"container-title":["Lecture Notes in Computer Science","Next-Generation Applied Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02568-6_78","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T23:42:28Z","timestamp":1552088548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02568-6_78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642025679","9783642025686"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02568-6_78","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}