@inproceedings{bastide00miningminimal,
	title = {Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets},
	address = {Heidelberg},
	author = {Y. Bastide and N. Pasquier and R. Taouil and G. Stumme and L. Lakhal},
	booktitle = {Computational Logic --- CL 2000 Proc. CL'00},
	editor = {J. Lloyd and V. Dahl and U. Furbach and M. Kerber and K.-K. Laus and C. Palamidessi and L.M. Pereira and Y. Sagiv and P.J. Stuckey},
	note = {{P}art of \cite{pasquierinpressgenerating}},
	publisher = {Springer},
	series = {LNAI},
	url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf},
	volume = {1861},
	year = {2000},
	biburl = {http://www.bibsonomy.org/bibtex/225fa3431e7bdd7057f9b80a7385cd718/stumme},
	page = {972-986},
	keywords = {2000 analys association closed concept condensed data discovery fca formal frequent itemsets kdd knowledge mining myown representation representations rule rules }
}