{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T03:05:32Z","timestamp":1779159932269,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener. Comput."],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1007\/s00354-008-0072-6","type":"journal-article","created":{"date-parts":[[2010,2,17]],"date-time":"2010-02-17T10:44:59Z","timestamp":1266403499000},"page":"5-20","source":"Crossref","is-referenced-by-count":13,"title":["Using the Structure of Prelarge Trees to Incrementally Mine Frequent Itemsets"],"prefix":"10.1007","volume":"28","author":[{"given":"Chun-Wei","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tzung-Pei","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen-Hsiang","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,18]]},"reference":[{"key":"72_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinksi T. and Swami, A., \u201cMining association rules between sets of items in large database,\u201d in The ACM SIGMOD Conference, pp. 207-216, 1993.","DOI":"10.1145\/170035.170072"},{"issue":"6","key":"72_CR2","doi-asserted-by":"crossref","first-page":"914","DOI":"10.1109\/69.250074","volume":"5","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Imielinksi T. and Swami, A., \u201cDatabase mining: a performance perspective,\u201d IEEE Transactions on Knowledge and Data Engineering, 5, 6, pp. 914-925, 1993.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"72_CR3","unstructured":"Agrawal R. and Srikant, R., \u201cFast algorithm for mining association rules,\u201d in The International Conference on Very Large Data Bases, pp. 487-499, 1994."},{"key":"72_CR4","unstructured":"Agrawal, R., Srikant R. and Vu, Q., \u201cMining association rules with item constraints,\u201d in The Third International Conference on Knowledge Discovery in Databases and Data Mining, pp. 67-73, 1997."},{"issue":"6","key":"72_CR5","first-page":"966","volume":"8","author":"S. Chen M.","year":"1996","unstructured":"Chen, M. S., Han J. and Yu, P. S., \u201cData mining: An overview from a database perspective,\u201d IEEE Transactions on Knowledge and Data Engineering, 8, 6, pp. 966-883, 1996.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"72_CR6","doi-asserted-by":"crossref","unstructured":"Cheung, D. W., Han, J., Ng, V. T. and Wong, C. Y., \u201cMaintenance of discovered association rules in large databases: An incremental updating approach,\u201d in The Twelfth IEEE International Conference on Data Engineering, pp. 106-114, 1996.","DOI":"10.1109\/ICDE.1996.492094"},{"key":"72_CR7","doi-asserted-by":"crossref","unstructured":"Cheung, D.W., Lee, S. D. and Kao, B., \u201cA general incremental technique for maintaining discovered association rules,\u201d in Database Systems for Advanced Applications, pp. 185-194, 1997.","DOI":"10.1142\/9789812819536_0020"},{"key":"72_CR8","doi-asserted-by":"crossref","unstructured":"Ezeife, C. I., \u201cMining incremental association rules with generalized FP-tree,\u201d in The 15th Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence, pp. 147-160, 2002.","DOI":"10.1007\/3-540-47922-8_13"},{"issue":"1","key":"72_CR9","first-page":"182","volume":"58","author":"T. Fukuda","year":"1996","unstructured":"Fukuda, T., Morimoto, Y., Morishita S. and Tokuyama, T., \u201cMining optimized association rules for numeric attributes,\u201d Journal of Computer and System Sciences, 58, 1, pp. 182-191, 1996.","journal-title":"Journal of Computer and System Sciences"},{"key":"72_CR10","unstructured":"Han J. and Fu, Y., \u201cDiscovery of multiple-level association rules from large database,\u201d in The Twenty-first International Conference on Very Large Data Bases, pp. 420-431, 1995."},{"key":"72_CR11","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J. and Yin, Y., \u201cMining frequent patterns without candidate generation,\u201d in The 2000 ACM SIGMOD International Conference on Management of Data , pp. 1-12, 2000.","DOI":"10.1145\/335191.335372"},{"issue":"2","key":"72_CR12","doi-asserted-by":"crossref","first-page":"111","DOI":"10.3233\/IDA-2001-5203","volume":"5","author":"P. Hong T.","year":"2001","unstructured":"Hong, T. P., Wang, C. Y. and Tao, Y. H., \u201cA new incremental data mining algorithm using pre-large itemsets,\u201d Intelligent Data Analysis, 5, 2, pp. 111- 129, 2001.","journal-title":"Intelligent Data Analysis"},{"key":"72_CR13","doi-asserted-by":"crossref","unstructured":"Hong, T. P., Lin, C. W. and Wu, Y. L., \u201cIncrementally fast updated frequent pattern trees,\u201d Expert Systems with Applications 34, 4, pp. 2424-2435, 2008.","DOI":"10.1016\/j.eswa.2007.04.009"},{"key":"72_CR14","doi-asserted-by":"crossref","unstructured":"Koh, J. L. and Shieh, S. F., \u201cAn effcient approach for maintaining association rules based on adjusting FP-tree structure,\u201d in The Ninth International Conference on Database Systems for Advanced Applications, pp. 417-424, 2004.","DOI":"10.1007\/978-3-540-24571-1_38"},{"key":"72_CR15","unstructured":"Lin, M. Y. and Lee, S. Y., \u201cIncremental update on sequential patterns in large databases,\u201d in The Tenth IEEE International Conference on Tools with Artificial Intelligence, pp. 24-31, 1998."},{"key":"72_CR16","unstructured":"Mannila, H., Toivonen, H. and Verkamo, A. I., \u201cEfficient algorithm for discovering association rules,\u201d in The AAAI Workshop on Knowledge Discovery in Databases, pp. 181-192, 1994."},{"issue":"5","key":"72_CR17","first-page":"812","volume":"9","author":"S. Park J.","year":"1997","unstructured":"Park, J. S., Chen, M. S. and Yu, P. S., \u201cUsing a hash-based method with transaction trimming for mining association rules,\u201d IEEE Transactions on Knowledge and Data Engineering, 9, 5, pp. 812-825, 1997.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"72_CR18","unstructured":"Qiu, Y., Lan, Y. J. and Xie, Q. S., \u201cAn improved algorithm of mining from FP-tree,\u201d in The Third International Conference on Machine Learning and Cybernetics, pp. 26-29, 2004."},{"key":"72_CR19","doi-asserted-by":"crossref","unstructured":"Sarda, N. L. and Srinivas, N. V., \u201cAn adaptive algorithm for incremental mining of association rules,\u201d in The Ninth International Workshop on Database and Expert Systems, pp. 240-245, 1998.","DOI":"10.1109\/DEXA.1998.707409"},{"key":"72_CR20","unstructured":"Srikant, R. and Agrawal, R., \u201cMining generalized association rules,\u201d in The Twenty-first International Conference on Very Large Data Bases, pp. 407-419, 1995."},{"key":"72_CR21","doi-asserted-by":"crossref","unstructured":"Srikant, R. and Agrawal, R., \u201cMining quantitative association rules in large relational tables,\u201d in ACM SIGMOD International Conference on Management of Data, pp. 1-12, 1996.","DOI":"10.1145\/233269.233311"},{"key":"72_CR22","unstructured":"Zaiane, O. R. and Mohammed, E. H., \u201cCOFI-tree mining: A new approach to pattern growth with reduced candidacy generation,\u201d in IEEE International Conference on Data Mining, 2008."},{"key":"72_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, S., \u201cAggregation and maintenance for database mining,\u201d Intelligent Data Analysis, pp. 475-490, 1999.","DOI":"10.3233\/IDA-1999-3605"},{"key":"72_CR24","doi-asserted-by":"crossref","unstructured":"Zheng, Z., Kohavi, R. and Mason, L., \u201cReal world performance of association rule algorithms,\u201d in The International Conference on Knowledge Discovery and Data Mining, pp. 401-406, 2001.","DOI":"10.1145\/502512.502572"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-008-0072-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00354-008-0072-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-008-0072-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T15:52:57Z","timestamp":1739893977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00354-008-0072-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["72"],"URL":"https:\/\/doi.org\/10.1007\/s00354-008-0072-6","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1]]}}}