Lakhal, L. & Stumme, G.
(2005), Efficient Mining of Association Rules Based on Formal Concept Analysis
, Springer
, Heidelberg
, pp. 180-195
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Lakhal, L. & Stumme, G.
(2005), Efficient Mining of Association Rules Based on Formal Concept Analysis
, Springer
, Heidelberg
, pp. 180-195
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Pasquier, N.; Taouil, R.; Bastide, Y.; Stumme, G. & Lakhal, L. (2005),
'Generating a Condensed Representation for Association Rules', Journal Intelligent Information Systems (JIIS)
24
(1)
, 29-60
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Pasquier, N.; Taouil, R.; Bastide, Y.; Stumme, G. & Lakhal, L. (2005),
'Generating a Condensed Representation for Association Rules', Journal Intelligent Information Systems (JIIS)
24
(1)
, 29-60
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Pasquier, N.; Bastide, Y.; Taouil, R. & Lakhal, L. (1998),
Pruning closed itemset lattices for associations rules., in
Mokrane Bouzeghoub, ed.,
'Bases de Donn�es Avanc�es'
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Pasquier, N.; Bastide, Y.; Taouil, R. & Lakhal, L. (1998),
Pruning closed itemset lattices for associations rules., in
Mokrane Bouzeghoub, ed.,
'Bases de Données Avancées'
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]