{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:56:36Z","timestamp":1725555396751},"publisher-location":"London","reference-count":13,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781846282256"},{"type":"electronic","value":"9781846282263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/978-1-84628-226-3_20","type":"book-chapter","created":{"date-parts":[[2010,5,11]],"date-time":"2010-05-11T14:32:28Z","timestamp":1273588348000},"page":"263-276","source":"Crossref","is-referenced-by-count":1,"title":["Improved Methods for Extracting Frequent Itemsets from Interim-Support Trees"],"prefix":"10.1007","author":[{"given":"Frans","family":"Coenen","sequence":"first","affiliation":[]},{"given":"Paul","family":"Leng","sequence":"additional","affiliation":[]},{"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[]},{"given":"Dora","family":"Souliou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"F. Angiulli, G. Ianni, L. Palopoli. On the complexity of inducing categorical and quantitative association rules, arXiv:cs.CC\/0111009 vol. 1, Nov. 2001"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, and A. Swami. Mining Association Rules between Sets of Items in Large Databases. In Proc. of ACM SIGMOD Conference on Management of Data, Washington DC, May 1993.","DOI":"10.1145\/170035.170072"},{"issue":"6","key":"20_CR3","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1109\/69.250074","volume":"5","author":"R. Agrawal","year":"1993","unstructured":"R. Agrawal, T. Imielinski, and A. Swami. Database mining: a performance perspective. IEEE Transactions on Knowledge and Data Engineering, 5(6):914\u2013925, Dec 1993. Special Issue on Learning and Discovery in Knowledge-Based Databases.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"20_CR4","unstructured":"R. Agrawal and R. Srikant. Fast Algorithms for mining association rules. In VLDB\u201994, pp. 487\u2013499."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"R. Agrawal, C. Aggarwal and V. Prasad. Depth First Generation of Long Patterns. In KDD 2000, ACM, pp. 108\u2013118","DOI":"10.1145\/347090.347114"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"E. Boros, V. Gurvich, L. Khachiyan, K. Makino. On the complexity of generating maximal frequent and minimal infrequent sets, in STACS 2002.","DOI":"10.1007\/3-540-45841-7_10"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"F. Coenen, G. Goulbourne, and P. Leng. Computing Association Rules using Partial Totals. In L. De Raedt and A. Siebes eds, Principles of Data Mining and Knowledge Discovery (Proc 5th European Conference, PKDD 2001, Freiburg, Sept 2001), Lecture Notes in AI 2168, Springer-Verlag, Berlin, Heidelberg: pp. 54\u201366.","DOI":"10.1007\/3-540-44794-6_5"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/B:DAMI.0000005257.93780.3b","volume":"8","author":"F. Coenen","year":"2004","unstructured":"F. Coenen, G. Goulbourne and P. Leng. Tree Structures for Mining Association Rules. Data Mining and Knowledge Discovery, 8 (2004), pp. 25\u201351","journal-title":"Data Mining and Knowledge Discovery"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0950-7051(00)00055-1","volume":"13","author":"G. Goulbourne","year":"2000","unstructured":"G. Goulbourne, F. Coenen and P. Leng. Algorithms for Computing Association Rules using a Partial-Support Tree. Journal of Knowledge-Based Systems 13 (2000), pp. 141\u2013149.","journal-title":"Journal of Knowledge-Based Systems"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J. Han","year":"2004","unstructured":"J. Han, J. Pei, Y. Yin and R. Mao. Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach. Data Mining and Knowledge Discovery, 8 (2004), pp. 53\u201387","journal-title":"Data Mining and Knowledge Discovery"},{"key":"20_CR11","unstructured":"A. Savasere, E. Omiecinski and S. Navathe. An Efficient Algorithm for Mining Association Rules in Large Databases. In VLDB 1995, pp. 432\u2013444"},{"key":"20_CR12","unstructured":"H. Toivonen. Sampling Large Databases for Association Rules. In VLDB 1996, pp. 1\u201312."},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"M. J. Zaki. Generating Non-Redundant Association Rules. In Proc. SIGKDD-2000, pp. 34\u201343, 2000.","DOI":"10.1145\/347090.347101"}],"container-title":["Research and Development in Intelligent Systems XXII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-84628-226-3_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T19:49:37Z","timestamp":1605728977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-84628-226-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9781846282256","9781846282263"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-1-84628-226-3_20","relation":{},"subject":[],"published":{"date-parts":[[2006]]}}}