{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T07:11:29Z","timestamp":1768115489276,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540677970","type":"print"},{"value":"9783540449577","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44957-4_65","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T01:24:41Z","timestamp":1180661081000},"page":"972-986","source":"Crossref","is-referenced-by-count":132,"title":["Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets"],"prefix":"10.1007","author":[{"given":"Yves","family":"Bastide","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Pasquier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafik","family":"Taouil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerd","family":"Stumme","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lotfi","family":"Lakhal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,12,15]]},"reference":[{"key":"65_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. Proc. SIGMOD conf., pp 207\u2013216, May 1993.","DOI":"10.1145\/170035.170072"},{"key":"65_CR2","unstructured":"R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. Proc. VLDB conf., pp 478\u2013499, September 1994."},{"key":"65_CR3","doi-asserted-by":"crossref","unstructured":"W. W. Armstrong. Dependency structures of data base relationships. Proc. IFIP congress, pp 580\u2013583, August 1974.","DOI":"10.1515\/9783110840308-026"},{"key":"65_CR4","doi-asserted-by":"crossref","unstructured":"R. J. Bayardo, R. Agrawal, and D. Gunopulos. Constraint-based rule mining in large, dense databases. Proc. ICDE conf., pp 188\u2013197, March 1999.","DOI":"10.1109\/ICDE.1999.754924"},{"key":"65_CR5","doi-asserted-by":"crossref","unstructured":"R. J. Bayardo, and R. Agrawal. Mining the most interesting rules. Proc. KDD Conference, pp 145\u2013154, August 1999.","DOI":"10.1145\/312129.312219"},{"issue":"1","key":"65_CR6","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/320064.320066","volume":"4","author":"C. Beeri","year":"1979","unstructured":"C. Beeri, P. A. Bernstein. Computational problems related to the design of normal form relational schemas. Transactions on Database Systems, 4(1):30\u201359, 1979.","journal-title":"Transactions on Database Systems"},{"key":"65_CR7","doi-asserted-by":"crossref","unstructured":"S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules to correlation. Proc. SIGMOD conf., pp 265\u2013276, May 1997.","DOI":"10.1145\/253260.253327"},{"issue":"95","key":"65_CR8","first-page":"5","volume":"24","author":"V. Duquenne","year":"1986","unstructured":"V. Duquenne and J.-L. Guigues. Famille minimale d\u2019implications informatives r\u00e9sultant d\u2019un tableau de donn\u00e9es binaires. Math\u00e9matiques et Sciences Humaines, 24(95):5\u201318, 1986.","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"key":"65_CR9","doi-asserted-by":"crossref","unstructured":"B. Ganter and R. Wille. Formal Concept Analysis: Mathematical foundations. Springer, 1999.","DOI":"10.1007\/978-3-642-59830-2"},{"key":"65_CR10","unstructured":"J. Han and Y. Fu. Discovery of multiple-level association rules from large databases. Proc. VLDB conf., pp 420\u2013431, September 1995."},{"key":"65_CR11","unstructured":"D. Heckerman. Bayesian networks for knowledge discovery. Advances in Knowledge Discovery and Data Mining, pp 273\u2013305, 1996."},{"key":"65_CR12","doi-asserted-by":"crossref","unstructured":"KMR+94._M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen, and A. I. Verkamo. Finding interesting rules from large sets of discovered association rules. Proc. CIKM conf., pp 401\u2013407, November 1994.","DOI":"10.1145\/191246.191314"},{"issue":"113","key":"65_CR13","first-page":"35","volume":"29","author":"M. Luxenburger","year":"1991","unstructured":"M. Luxenburger. Implications partielles dans un contexte. Math\u00e9matiques, Informatique et Sciences Humaines, 29(113):35\u201355, 1991.","journal-title":"Math\u00e9matiques, Informatique et Sciences Humaines"},{"issue":"4","key":"65_CR14","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1145\/322217.322223","volume":"27","author":"D. Maier","year":"1980","unstructured":"D. Maier. Minimum covers in relational database model. Journal of the ACM, 27(4):664\u2013674, 1980.","journal-title":"Journal of the ACM"},{"key":"65_CR15","doi-asserted-by":"crossref","unstructured":"R. T. Ng, V. S. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained association rules. Proc. SIGMOD conf., pp 13\u201324, June 1998.","DOI":"10.1145\/276304.276307"},{"key":"65_CR16","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Pruning closed itemset lattices for association rules. Proc. BDA conf., pp 177\u2013196, Octobre 1998."},{"issue":"1","key":"65_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1):25\u201346, 1999.","journal-title":"Information Systems"},{"key":"65_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Proc. ICDT conf.","author":"N. Pasquier","year":"1999","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. Proc. ICDT conf., LNCS 1540, pp 398\u2013416, January 1999."},{"key":"65_CR19","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Closed set based discovery of small covers for association rules. Proc. BDA conf., pp 361\u2013381, Octobre 1999."},{"key":"65_CR20","unstructured":"G. Piatetsky-Shapiro and C. J. Matheus. The interestingness of deviations. AAAI KDD workshop, pp 25\u201336, July 1994."},{"issue":"6","key":"65_CR21","doi-asserted-by":"crossref","first-page":"970","DOI":"10.1109\/69.553165","volume":"8","author":"A. Silberschatz","year":"1996","unstructured":"A. Silberschatz and A. Tuzhilin. What makes patterns interesting in knowledge discovery systems. IEEE Transactions on Knowledge and Data Engineering, 8(6):970\u2013974, December 1996.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"65_CR22","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1023\/A:1009713703947","volume":"2","author":"C. Silverstein","year":"1998","unstructured":"C. Silverstein, S. Brin, and R. Motwani. Beyond market baskets: Generalizing association rules to dependence rules. Data Mining and Knowledge Discovery, 2(1):39\u201368, January 1998.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"65_CR23","unstructured":"R. Srikant and R. Agrawal. Mining generalized association rules. Proc. VLDB conf., pp 407\u2013419, September 1995."},{"key":"65_CR24","unstructured":"R. Srikant, Q. Vu, and R. Agrawal. Mining association rules with item constraints. Proc. KDD conf., pp 67\u201373, August 1997."}],"container-title":["Lecture Notes in Computer Science","Computational Logic \u2014 CL 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44957-4_65","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T11:23:26Z","timestamp":1556450606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44957-4_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677970","9783540449577"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-44957-4_65","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}