@inproceedings{conf/cl/BastidePTSL00,
	title = {Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets.},
	author = {Yves Bastide and Nicolas Pasquier and Rafik Taouil and Gerd Stumme and Lotfi Lakhal},
	booktitle = {Computational Logic},
	crossref = {conf/cl/2000},
	editor = {John W. Lloyd and Verónica Dahl and Ulrich Furbach and Manfred Kerber and Kung-Kiu Lau and Catuscia Palamidessi and Luís Moniz Pereira and Yehoshua Sagiv and Peter J. Stuckey},
	pages = {972-986},
	publisher = {Springer},
	series = {Lecture Notes in Computer Science},
	url = {http://dblp.uni-trier.de/db/conf/cl/cl2000.html#BastidePTSL00},
	volume = {1861},
	year = {2000},
	biburl = {http://www.bibsonomy.org/bibtex/297b70244f01e9456c25cb37c07c5afaa/dblp},
	description = {dblp},
	ee = {http://link.springer.de/link/service/series/0558/bibs/1861/18610972.htm}, isbn = {3-540-67797-6}, date = {2002-01-03},
	keywords = {dblp }
}