{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T14:26:22Z","timestamp":1785248782600,"version":"3.55.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319419190","type":"print"},{"value":"9783319419206","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-41920-6_30","type":"book-chapter","created":{"date-parts":[[2016,6,27]],"date-time":"2016-06-27T01:11:43Z","timestamp":1466989903000},"page":"387-400","source":"Crossref","is-referenced-by-count":5,"title":["Building FP-Tree on the Fly: Single-Pass Frequent Itemset Mining"],"prefix":"10.1007","author":[{"given":"Nima","family":"Shahbazi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rohollah","family":"Soltani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jarek","family":"Gryz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aijun","family":"An","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,6,28]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the SIGMOD, New York (1993)","DOI":"10.1145\/170035.170072"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Dallas, Texas (2000)","DOI":"10.1145\/342009.335372"},{"issue":"3","key":"30_CR3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s10115-006-0032-8","volume":"11","author":"CK-S Leung","year":"2007","unstructured":"Leung, C.K.-S., Khan, Q.I., Li, Z., Hoque, T.: CanTree: a canonical-order tree for incremental frequent-pattern mining. Knowledge and Information Systems 11(3), 287\u2013311 (2007)","journal-title":"Knowledge and Information Systems"},{"issue":"5","key":"30_CR4","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.ins.2008.10.027","volume":"179","author":"SK Tanbeer","year":"2009","unstructured":"Tanbeer, S.K., Ahmed, C.F., Jeong, B.S., Lee, Y.K.: Efficient single-pass frequent pattern mining using a prefix-tree. Information Sciences 179(5), 559\u2013583 (2009)","journal-title":"Information Sciences"},{"issue":"9","key":"30_CR5","doi-asserted-by":"crossref","first-page":"2008","DOI":"10.1007\/s11432-012-4638-z","volume":"55","author":"ZH Deng","year":"2012","unstructured":"Deng, Z.H., Wang, Z., Jiang, J.J.: A new algorithm for fast mining frequent itemsets using N-lists. SCIENCE CHINA Information Sciences 55(9), 2008\u20132030 (2012)","journal-title":"SCIENCE CHINA Information Sciences"},{"issue":"13","key":"30_CR6","doi-asserted-by":"crossref","first-page":"5424","DOI":"10.1016\/j.eswa.2015.03.004","volume":"42","author":"ZH Deng","year":"2015","unstructured":"Deng, Z.H., Lv, S.L.: PrePost+: An efficient N-lists-based algorithm for mining frequent itemsets via Children-Parent Equivalence pruning. Expert Systems with Applications 42(13), 5424\u20135432 (2015)","journal-title":"Expert Systems with Applications"},{"issue":"7","key":"30_CR7","doi-asserted-by":"crossref","first-page":"3506","DOI":"10.1016\/j.eswa.2013.10.056","volume":"41","author":"ZH Deng","year":"2014","unstructured":"Deng, Z.H., Lv, S.L.: Fast mining frequent itemsets using Nodesets. Expert Systems with Applications 41(7), 3506\u20133513 (2014)","journal-title":"Expert Systems with Applications"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Cheung, D.W., Han, J., Ng, V.T., Wong, C.Y.: Maintenance of discovered association rules in large databases: an incremental updating technique. In: Proceedings of the ICDE, Los Alamitos, CA (1996)","DOI":"10.1109\/ICDE.1996.492094"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Cheung, D.W., Lee, S.D., Kao, B.: A general incremental technique for maintaining discovered association rules. In: Proceedings of the DASFAA, Singapore (1997)","DOI":"10.1142\/9789812819536_0020"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Ayan, N.F., Tansel, A.U., Arkun, E.: Efficient algorithm to update large itemsets with early pruning. In: Proceedings of the SIGKDD, New York (1999)","DOI":"10.1145\/312129.312252"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Koh, J.L., Shieh, S.F.: An efficient approach for maintaining association rules based on adjusting FP-tree structures. In: Proceedings of the DASFAA, New York (2004)","DOI":"10.1007\/978-3-540-24571-1_38"},{"key":"30_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/11811305_5","volume-title":"Advanced Data Mining and Applications","author":"X Li","year":"2006","unstructured":"Li, X., Deng, Z.-H., Tang, S.-W.: A fast algorithm for maintenance of association rules in incremental databases. In: Li, X., Za\u00efane, O.R., Li, Z.-H. (eds.) ADMA 2006. LNCS (LNAI), vol. 4093, pp. 56\u201363. Springer, Heidelberg (2006)"},{"issue":"4","key":"30_CR13","doi-asserted-by":"crossref","first-page":"2424","DOI":"10.1016\/j.eswa.2007.04.009","volume":"34","author":"TP Hong","year":"2008","unstructured":"Hong, T.P., Lin, C.W., Wu, Y.L.: Incrementally fast updated frequent pattern trees. Expert Systems with Applications 34(4), 2424\u20132435 (2008)","journal-title":"Expert Systems with Applications"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Cheung, W., Zaiane, O.R.: Incremental mining of frequent patterns without candidate generation or support constraint. In: Proceedings of the IDEAS, Los Alamitos, CA (2003)","DOI":"10.1109\/IDEAS.2003.1214917"},{"issue":"2","key":"30_CR15","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.is.2005.11.004","volume":"32","author":"G Liu","year":"2007","unstructured":"Liu, G., Lu, H., Yu, J.X.: CFP-tree: A compact disk-based structure for storing and querying frequent itemsets. Information Systems 32(2), 295\u2013319 (2007)","journal-title":"Information Systems"},{"key":"30_CR16","volume-title":"UCI repository of machine learning databases","author":"C Blake","year":"1998","unstructured":"Blake, C., Merz, C.: UCI repository of machine learning databases. University of California, Irvine (1998)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Data Mining in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41920-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:13:03Z","timestamp":1498324383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41920-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319419190","9783319419206"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41920-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}