{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:40:59Z","timestamp":1752230459126},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data & Knowledge Engineering"],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1016\/s0169-023x(00)00055-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:58:13Z","timestamp":1027612693000},"page":"47-64","source":"Crossref","is-referenced-by-count":67,"title":["TBAR: An efficient method for association rule mining in relational databases"],"prefix":"10.1016","volume":"37","author":[{"given":"Fernando","family":"Berzal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan-Carlos","family":"Cubero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicol\u00e1s","family":"Mar\u0131\u0301n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9-Mar\u0131\u0301a","family":"Serrano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0169-023X(00)00055-0_BIB1","doi-asserted-by":"crossref","unstructured":"C.C. Aggarwal, P.S. Yu, A new framework for itemset generation, in: Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Seattle, Washington, June 1\u20133, 1998, pp. 18\u201324","DOI":"10.1145\/275487.275490"},{"key":"10.1016\/S0169-023X(00)00055-0_BIB2","doi-asserted-by":"crossref","unstructured":"C.C. Aggarwal, P.S. Yu, Mining large itemsets for association rules, Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, 1998","DOI":"10.1109\/ICDE.1998.655803"},{"key":"10.1016\/S0169-023X(00)00055-0_BIB3","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, A. Swami, Mining association rules between sets of items in large databases, in: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, DC, May 26\u201328, 1993, pp. 207\u2013216","DOI":"10.1145\/170035.170072"},{"issue":"6","key":"10.1016\/S0169-023X(00)00055-0_BIB4","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1109\/69.553164","article-title":"Parallel mining of association rules","volume":"8","author":"Agrawal","year":"1996","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/S0169-023X(00)00055-0_BIB5","unstructured":"R. Agrawal, K. Shim, Developing tightly-coupled applications on IBM DB2\/CS relational database system: methodology and experience, in: Proceedings of the Second International Conference on Knowledge Discovery in Databases and Data Mining, Portland, Oregon, August 1996, pp. 287\u2013290"},{"key":"10.1016\/S0169-023X(00)00055-0_BIB6","unstructured":"R. Agrawal, R. Skirant, Fast Algorithms for Mining Association Rules, IBM Research Report RJ9839, IBM Almaden Research Center, San Jose, CA, June 1994"},{"key":"10.1016\/S0169-023X(00)00055-0_BIB7","unstructured":"K. Ali, S. Manganaris, R. Skirant, Partial classification using association rules, in: KDD'97 Proceedings of the Third International Conference on Knowledge Discovery in Databases and Data Mining, August 14\u201317, 1997, Newport Beach, CA, USA, pp. 115\u2013118"},{"key":"10.1016\/S0169-023X(00)00055-0_BIB8","doi-asserted-by":"crossref","unstructured":"R.J. Bayardo Jr., Efficiently mining long patterns from databases. in: SIGMOD 1998 Proceedings ACM SIGMOD International Conference on Management of Data, June 2\u20134, 1998, Seattle, Washington, USA, pp. 85\u201393","DOI":"10.1145\/276304.276313"},{"key":"10.1016\/S0169-023X(00)00055-0_BIB9","doi-asserted-by":"crossref","unstructured":"S. Brin, R. Motwani, J.D. Ullman, Shalom Tsur, Dynamic itemset counting and implication rules for market basket data, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, May 11\u201315, 1997, Tucson, AZ, USA, pp. 255\u2013264","DOI":"10.1145\/253262.253325"},{"key":"10.1016\/S0169-023X(00)00055-0_BIB10","doi-asserted-by":"crossref","unstructured":"D.W. Cheung, J. Han, V.T. Ng, C.Y.Wong, Maintenance of discovered association rules in large databases: an incremental updating technique, in: Proceedings of the 12th International Conference on Data Engineering, New Orleans, Louisiana, February 1996, pp. 106\u2013114","DOI":"10.1109\/ICDE.1996.492094"},{"key":"10.1016\/S0169-023X(00)00055-0_BIB11","unstructured":"D.W. Cheung, V.T. Ng, B.W. Tam, Maintenance of discovered knowledge: a case in multi-level association rules, in: KDD-96 Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, Oregon, August 1996, pp. 307\u2013310"},{"key":"10.1016\/S0169-023X(00)00055-0_BIB12","unstructured":"R. Feldman, A. Amir, Y. Auman, A. Zilberstien, H. Hirsh, Incremental algorithms for association generation, in: Proceedings of the First Pacific-Asia Conference on Knowledge Discovery and Data Mining, in: H. Lu, et al. (Eds.), KDD: Techniques and Applications, World Scientific, Singapore, 1997, pp. 227\u2013240"},{"key":"10.1016\/S0169-023X(00)00055-0_BIB13","doi-asserted-by":"crossref","unstructured":"J. Han, J. Pei, Y. Yin, Mining frequent patterns without candidate generation, in: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, May 15\u201318, 2000, Dallas, TX, USA, pp. 1\u201312","DOI":"10.1145\/342009.335372"},{"key":"10.1016\/S0169-023X(00)00055-0_BIB14","doi-asserted-by":"crossref","unstructured":"J.L. Han, A.W. Plank, Background for association rules and cost estimate of selected mining algorithms, in: CIKM '96 Proceedings of the Fifth International Conference on Information and Knowledge Management, November 12\u201316, 1996, Rockville, MD, USA, pp. 73\u201380","DOI":"10.1145\/238355.238440"},{"issue":"1","key":"10.1016\/S0169-023X(00)00055-0_BIB15","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/360402.360421","article-title":"Algorithms for association rule mining \u2013 a general survey and comparison","volume":"2","author":"Hipp","year":"2000","journal-title":"SIGKDD Explorations"},{"key":"10.1016\/S0169-023X(00)00055-0_BIB16","unstructured":"M. Houtsma, A. Swami, Set-oriented mining for association rules, IBM Research Report RJ9567, IBM Almaden Research Center, San Jose, CA, October 1993"},{"key":"10.1016\/S0169-023X(00)00055-0_BIB17","unstructured":"H. Mannila, H. Toivonen, A.I. Verkamo, Improved Methods for Finding Association Rules, Technical Report, Department of Computer Science, University of Helsinki, Helsinki, Finland, December 1993 (Revised February 1994)"},{"key":"10.1016\/S0169-023X(00)00055-0_BIB18","doi-asserted-by":"crossref","unstructured":"J.S. Park, M.S. Chen, P.S. Yu, An effective hash-based algorithm for mining association rules, in: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, San Jose, CA, May 22\u201325, 1995, pp. 175\u2013186","DOI":"10.1145\/223784.223813"},{"key":"10.1016\/S0169-023X(00)00055-0_BIB19","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF00116251","article-title":"Induction on decision trees","volume":"1","author":"Quinlan","year":"1996","journal-title":"Machine Learning"},{"key":"10.1016\/S0169-023X(00)00055-0_BIB20","doi-asserted-by":"crossref","unstructured":"S. Sarawagi, S. Thomas, R. Agrawal, Integrating association rule mining with relational database systems: alternatives and implications, in: SIGMOD 1998 Proceedings of the ACM SIGMOD International Conference on Management of Data, June 2\u20134, 1998, Seattle, Washington, USA, pp. 343\u2013354","DOI":"10.1145\/276304.276335"},{"key":"10.1016\/S0169-023X(00)00055-0_BIB21","doi-asserted-by":"crossref","unstructured":"R. Skirant, R. Agrawal, Mining quantitative association rules in large relational tables, in: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, Montreal, Que., Canada, June 4\u20136, 1996, pp. 1\u201312","DOI":"10.1145\/235968.233311"},{"key":"10.1016\/S0169-023X(00)00055-0_BIB22","unstructured":"R. Skirant, Q. Vu, R. Agrawal, Mining association rules with item constraints, in: KDD'97 Proceedings of the Third International Conference on Knowledge Discovery in Databases and Data Mining, Newport Beach, CA, August 1997, pp. 67\u201373"}],"container-title":["Data & Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X00000550?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X00000550?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T16:11:59Z","timestamp":1579104719000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0169023X00000550"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,4]]}},"alternative-id":["S0169023X00000550"],"URL":"https:\/\/doi.org\/10.1016\/s0169-023x(00)00055-0","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}