%0 Conference Paper %1 bastide00miningminimal %A Bastide, Y. %A Pasquier, N. %A Taouil, R. %A Stumme, G. %A Lakhal, L. %B Computational Logic --- CL 2000 Proc. CL'00 %C Heidelberg %D 2000 %E Lloyd, J. %E Dahl, V. %E Furbach, U. %E Kerber, M. %E Laus, K.-K. %E Palamidessi, C. %E Pereira, L.M. %E Sagiv, Y. %E Stuckey, P.J. %I Springer %K analysis association closed concept condensed data-mining discovery fca formal frequent itemset kdd knowledge representation rule %T Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets %U http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf %V 1861

@inproceedings{bastide00miningminimal, added-at = {2006-11-17T08:45:35.000+0100}, address = {Heidelberg}, author = {Bastide, Y. and Pasquier, N. and Taouil, R. and Stumme, G. and Lakhal, L.}, biburl = {https://www.bibsonomy.org/bibtex/225fa3431e7bdd7057f9b80a7385cd718/grahl}, booktitle = {Computational Logic --- CL 2000 Proc. CL'00}, editor = {Lloyd, J. and Dahl, V. and Furbach, U. and Kerber, M. and Laus, K.-K. and Palamidessi, C. and Pereira, L.M. and Sagiv, Y. and Stuckey, P.J.}, interhash = {dc10d0ad3c40463f049ac775cb250f3d}, intrahash = {25fa3431e7bdd7057f9b80a7385cd718}, keywords = {analysis association closed concept condensed data-mining discovery fca formal frequent itemset kdd knowledge representation rule}, note = {{P}art of \cite{pasquierinpressgenerating}}, page = {972-986}, publisher = {Springer}, series = {LNAI}, timestamp = {2007-07-26T12:06:28.000+0200}, title = {Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf}, volume = 1861, year = 2000 }