{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T03:17:52Z","timestamp":1778901472699,"version":"3.51.4"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Mining and Knowledge Discovery"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1023\/a:1009895914772","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T18:53:29Z","timestamp":1040583209000},"page":"217-240","source":"Crossref","is-referenced-by-count":155,"title":["Constraint-Based Rule Mining in Large, Dense Databases"],"prefix":"10.1007","volume":"4","author":[{"suffix":"Jr","given":"Roberto J.","family":"Bayardo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rakesh","family":"Agrawal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitrios","family":"Gunopulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"262144_CR1","unstructured":"Agarwal, R., Aggarwal, C., Prasad, V.V.V., and Crestana, V. 1998. A tree projection algorithm for generation of large itemsets for association rules. IBM Research Report RC21341."},{"key":"262144_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., and Swami, A. 1993. Mining associations between sets of items in massive databases. In Proc. of the 1993 ACM-SIGMOD Int'l Conf. on Management of Data, pp. 207\u2013216.","DOI":"10.1145\/170035.170072"},{"key":"262144_CR3","unstructured":"Ali, K., Manganaris, S., and Srikant, R. 1997. Partial classification using association rules. In Proc. of the 3rd Int'l Conference on Knowledge Discovery in Databases and Data Mining, pp. 115\u2013118."},{"key":"262144_CR4","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., and Verkamo, A.I. 1996. Fast discovery of association rules. Advances in Knowledge Discovery and Data Mining. AAAI Press, pp. 307\u2013328."},{"key":"262144_CR5","unstructured":"Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules. IBM Research Report RJ9839, IBM Almaden Research Center, San Jose, CA."},{"key":"262144_CR6","unstructured":"Bayardo, R.J. 1997. Brute-force mining of high-confidence classification rules. In Proc. of the Third Int'l Conf. on Knowledge Discovery and Data Mining, pp. 123\u2013126."},{"key":"262144_CR7","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J. 1998. Efficiently mining long patterns from databases. In Proc. of the 1998 ACM-SIGMOD Int'l Conf. on Management of Data, pp. 85\u201393.","DOI":"10.1145\/276304.276313"},{"key":"262144_CR8","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J. and Agrawal, R. 1999. Mining the most interesting rules. In Proc. of the ACM SIGKDD Conf. on Knowledge Discovery and Data Mining, pp. 145\u2013154.","DOI":"10.1145\/312129.312219"},{"key":"262144_CR9","unstructured":"Berry, M.J.A. and Linoff, G.S. 1997. Data Mining Techniques for Marketing, Sales and Customer Support. John Wiley & Sons, Inc."},{"key":"262144_CR10","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Ullman, J., and Tsur, S. 1997. Dynamic itemset counting and implication rules for market basket data. In Proc. of the 1997 ACM-SIGMOD Int'l Conf. on the Management of Data, pp. 255\u2013264.","DOI":"10.1145\/253260.253325"},{"key":"262144_CR11","doi-asserted-by":"crossref","unstructured":"Clearwater, S.H. and Provost, F.J. 1990. RL4: A tool for knowledge-based induction. In Proc. of the Second Int'l IEEE Conf. on Tools for Artificial Intelligence, pp. 24\u201330.","DOI":"10.1109\/TAI.1990.130305"},{"key":"262144_CR12","doi-asserted-by":"crossref","unstructured":"Cohen, W.W. 1995. Fast effective rule induction. In Proc. of the 12th Int'l Conf. on Machine Learning, pp. 115\u2013123.","DOI":"10.1016\/B978-1-55860-377-6.50023-2"},{"issue":"6","key":"262144_CR13","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1109\/69.250075","volume":"5","author":"V. Dhar","year":"1993","unstructured":"Dhar, V. and Tuzhilin, A. 1993. Abstract-driven pattern discovery in databases. IEEE Transactions on Knowledge and Data Engineering, 5(6):926\u2013938.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"262144_CR14","doi-asserted-by":"crossref","unstructured":"Gunopulos, G., Mannila, H., and Saluja, S. 1997. Discovering all most specific sentences by randomized algorithms. In Proc. of the 6th Int'l Conf. on Database Theory, pp. 215\u2013229.","DOI":"10.1007\/3-540-62222-5_47"},{"key":"262144_CR15","unstructured":"International Business Machines. 1996. IBM intelligent miner user's guide, Version 1, Release 1."},{"key":"262144_CR16","doi-asserted-by":"crossref","unstructured":"Klemettinen, M., Mannila, P., Ronkainen, P., and Verkamo, A.I. 1994. Finding interesting rules from large sets of discovered association rules. In Proc. of the Third Int'l Conf. on Information and Knowledge Management, pp. 401\u2013407.","DOI":"10.1145\/191246.191314"},{"key":"262144_CR17","doi-asserted-by":"crossref","unstructured":"Lin, D.-I and Kedem, Z.M. 1998. Pincer-search: A new algorithm for discovering the maximum frequent set. In Proc. of the Sixth European Conf. on Extending Database Technology, pp. 105\u2013119.","DOI":"10.1007\/BFb0100980"},{"key":"262144_CR18","unstructured":"Liu, B., Hsu, W., and Ma, Y. 1998. Integrating classification and association rule mining. In Proc. of the Fourth Int'l Conf. on Knowledge Discovery and Data Mining, pp. 80\u201386."},{"key":"262144_CR19","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1613\/jair.41","volume":"1","author":"P. Murphy","year":"1994","unstructured":"Murphy, P. and Pazzani, M. 1994. Exploring the decision forest: An empirical investigation of Occam's Razor in decision tree induction. J. of Artificial Intelligence Research, 1:257\u2013275.","journal-title":"J. of Artificial Intelligence Research"},{"key":"262144_CR20","doi-asserted-by":"crossref","unstructured":"Ng, R.T., Lakshmanan, V.S., Han, J., and Pang, A. 1998. Exploratory mining and pruning optimizations of constrained association rules. In Proc. of the 1998 ACM-SIGMOD Int'l Conf. on the Management of Data, pp. 13\u201324.","DOI":"10.1145\/276304.276307"},{"key":"262144_CR21","doi-asserted-by":"crossref","unstructured":"Park, J.S., Chen, M.-S., and Yu, P.S. 1996. An effective hash based algorithm for mining association rules. In Proc. of the 1995 SIGMOD Conf. on the Management of Data, pp. 175\u2013186.","DOI":"10.1145\/223784.223813"},{"key":"262144_CR22","unstructured":"Rymon, R. 1992. Search through systematic set enumeration. In Proc. of Third Int'l Conf. on Principles of Knowledge Representation and Reasoning, pp. 539\u2013550."},{"key":"262144_CR23","unstructured":"Rymon, R. 1994. On kernel rules and prime implicants. In Proc. of the Twelfth Nat'l Conf. on Artificial Intelligence, pp. 181\u2013186."},{"key":"262144_CR24","unstructured":"Savasere, A., Omiecinski, E., and Navathe, S. 1995. An efficient algorithm for mining association rules in large databases. In Proc. of the 21st Conf. on Very Large Data-Bases, pp. 432\u2013444."},{"key":"262144_CR25","doi-asserted-by":"crossref","unstructured":"Schlimmer, J.C. 1993. Efficiently inducing determinations: A complete and systematic search algorithm that uses optimal pruning. In Proc. of the Tenth. Int'l Conf. on Machine Learning, pp. 284\u2013290.","DOI":"10.1016\/B978-1-55860-307-3.50043-5"},{"key":"262144_CR26","unstructured":"Segal, R. and Etzioni, O. 1994. Learning decision lists using homogeneous rules. In Proc. of the Twelfth Nat'l Conf. on Artificial Intelligence, pp. 619\u2013625."},{"key":"262144_CR27","unstructured":"Shafer, J., Agrawal, R., and Mehta, M. 1996. SPRINT: A scalable parallel classifier for data-mining. In Proc. of the 22nd Conf. on Very Large Data-Bases, pp. 544\u2013555."},{"issue":"4","key":"262144_CR28","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/69.149926","volume":"4","author":"P. Smythe","year":"1992","unstructured":"Smythe, P. and Goodman, R.M. 1992. An information theoretic approach to rule induction from databases. IEEE Transactions on Knowledge and Data Engineering, 4(4):301\u2013316.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"262144_CR29","unstructured":"Srikant, R., Vu, Q., and Agrawal, R. 1997. Mining association rules with item constraints. In Proc. of the Third Int'l Conf. on Knowledge Discovery in Databases and Data Mining, pp. 67\u201373."},{"key":"262144_CR30","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1613\/jair.227","volume":"3","author":"G.I. Webb","year":"1995","unstructured":"Webb, G.I. 1995. OPUS: An efficient admissible algorithm for unordered search. Journal of Artificial Intelligence Research, 3:431\u2013465.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"262144_CR31","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., and Li,W. 1997. New algorithms for fast discovery of association rules. In Proc. of the Third Int'l Conf. on Knowledge Discovery in Databases and Data Mining, pp. 283\u2013286.","DOI":"10.1007\/978-1-4615-5669-5_1"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009895914772.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009895914772\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009895914772.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:56:41Z","timestamp":1752461801000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009895914772"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":31,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["262144"],"URL":"https:\/\/doi.org\/10.1023\/a:1009895914772","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}