{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T23:27:22Z","timestamp":1756682842985},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681243"},{"type":"electronic","value":"9783540681250"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68125-0_108","type":"book-chapter","created":{"date-parts":[[2008,5,10]],"date-time":"2008-05-10T03:40:05Z","timestamp":1210390805000},"page":"1022-1027","source":"Crossref","is-referenced-by-count":35,"title":["CP-Tree: A Tree Structure for Single-Pass Frequent Pattern Mining"],"prefix":"10.1007","author":[{"given":"Syed Khairuzzaman","family":"Tanbeer","sequence":"first","affiliation":[]},{"given":"Chowdhury Farhan","family":"Ahmed","sequence":"additional","affiliation":[]},{"given":"Byeong-Soo","family":"Jeong","sequence":"additional","affiliation":[]},{"given":"Young-Koo","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"108_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules Between Sets of Items in Large Databases. In: SIGMOD, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"108_CR2","doi-asserted-by":"crossref","unstructured":"Han, J., Cheng, H., Xin, D., Yan, X.: Frequent Pattern Mining: Current Status and Future Directions. Data Min. Knowl. Disc. 10th Anniversary Issue (2007)","DOI":"10.1007\/s10618-006-0059-1"},{"issue":"3","key":"108_CR3","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10115-006-0032-8","volume":"11","author":"C.K. Leung","year":"2007","unstructured":"Leung, C.K., Khan, Q.I., Li, Z., Hoque, T.: CanTree: A Canonical-Order Tree for Incremental Frequent-Pattern Mining. Knowledge and Information Systems\u00a011(3), 287\u2013311 (2007)","journal-title":"Knowledge and Information Systems"},{"key":"108_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/978-3-540-24571-1_38","volume-title":"Database Systems for Advanced Applications","author":"J.-L. Koh","year":"2004","unstructured":"Koh, J.-L., Shieh, S.-F.: An Efficient Approach for Maintaining Association Rules Based on Adjusting FP-tree Structures. In: Lee, Y., Li, J., Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol.\u00a02973, pp. 417\u2013424. Springer, Heidelberg (2004)"},{"key":"108_CR5","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: International Conference on Management of Data (2000)","DOI":"10.1145\/342009.335372"},{"key":"108_CR6","unstructured":"Cheung, W., Za\u00efane, O.R.: Incremental Mining of Frequent Patterns without Candidate Generation or Support Constraint. In: Seventh International Database Engineering and Applications Symposium (IDEAS) (2003)"},{"key":"108_CR7","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: International Conference on Very Large Databases (1994)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68125-0_108.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:36:20Z","timestamp":1620002180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68125-0_108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681243","9783540681250"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68125-0_108","relation":{},"subject":[]}}