Bastide, Y.; Pasquier, N.; Taouil, R.; Stumme, G. & Lakhal, L.: Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets. In: Lloyd, J.; Dahl, V.; Furbach, U.; Kerber, M.; Laus, K.-K.; Palamidessi, C.; Pereira, L.; Sagiv, Y. & Stuckey, P. (Hrsg.): Computational Logic -- CL 2000 Proc. CL'00. Heidelberg: Springer, 2000 (LNAI 1861)
[Volltext]
@inproceedings{bastide00miningminimal,
author = {Bastide, Y. and Pasquier, N. and Taouil, R. and Stumme, G. and Lakhal, L.},
title = {Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets},
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.},
booktitle = {Computational Logic --- CL 2000 Proc. CL'00},
series = {LNAI},
publisher = {Springer},
address = {Heidelberg},
year = {2000},
volume = {1861},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf},
keywords = {2000, analys, association, closed, concept, condensed, data, discovery, fca, formal, frequent, itemsets, kdd, knowledge, mining, myown, representation, representations, rule, rules}
}
Bastide, Y.; Taouil, R.; Pasquier, N.; Stumme, G. & Lakhal, L.: Mining Frequent Patterns with Counting Inference.. In: SIGKDD Explorations, Special Issue on Scalable Algorithms 2 (2000), Nr. 2, S. 71-80
@article{bastide00miningfrequent,
author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.},
title = {Mining Frequent Patterns with Counting Inference.},
journal = {SIGKDD Explorations, Special Issue on Scalable Algorithms},
year = {2000},
volume = {2},
number = {2},
pages = {71-80},
keywords = {2000, FCA, OntologyHandbook, analys, association, closed, concept, condensed, data, discovery, fca, formal, frequent, itemsets, kdd, knowledge, mining, myown, representation, representations, rule, rules}
}