%0 Conference Paper %1 conf/cl/BastidePTSL00 %A Bastide, Yves %A Pasquier, Nicolas %A Taouil, Rafik %A Stumme, Gerd %A Lakhal, Lotfi %B Computational Logic %D 2000 %E Lloyd, John W. %E Dahl, Verónica %E Furbach, Ulrich %E Kerber, Manfred %E Lau, Kung-Kiu %E Palamidessi, Catuscia %E Pereira, Luís Moniz %E Sagiv, Yehoshua %E Stuckey, Peter J. %I Springer %K %P 972-986 %T Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets. %U http://dblp.uni-trier.de/db/conf/cl/cl2000.html#BastidePTSL00 %V 1861 %@ 3-540-67797-6

@inproceedings{conf/cl/BastidePTSL00, added-at = {2023-12-13T10:55:01.000+0100}, author = {Bastide, Yves and Pasquier, Nicolas and Taouil, Rafik and Stumme, Gerd and Lakhal, Lotfi}, biburl = {https://www.bibsonomy.org/bibtex/297b70244f01e9456c25cb37c07c5afaa/admin}, booktitle = {Computational Logic}, crossref = {conf/cl/2000}, editor = {Lloyd, John W. and Dahl, Verónica and Furbach, Ulrich and Kerber, Manfred and Lau, Kung-Kiu and Palamidessi, Catuscia and Pereira, Luís Moniz and Sagiv, Yehoshua and Stuckey, Peter J.}, ee = {https://doi.org/10.1007/3-540-44957-4_65}, interhash = {dc10d0ad3c40463f049ac775cb250f3d}, intrahash = {97b70244f01e9456c25cb37c07c5afaa}, isbn = {3-540-67797-6}, keywords = {}, pages = {972-986}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2023-12-13T10:55:01.000+0100}, title = {Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets.}, url = {http://dblp.uni-trier.de/db/conf/cl/cl2000.html#BastidePTSL00}, volume = 1861, year = 2000 }