Lakhal, L. & Stumme, G.
(2005), Efficient Mining of Association Rules Based on Formal Concept Analysis
, Springer
, Heidelberg
, pp. 180-195
.
[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
.
[BibTeX]
[Endnote]
Stumme, G. (2002),
Efficient Data Mining Based on Formal Concept Analysis, in
A. Hameurlain; R. Cicchetti & R. Traunmüller, ed.,
'Database and Expert Systems Applications. Proc. DEXA 2002'
, Springer, Heidelberg
, pp. 534-546
.
[BibTeX]
[Endnote]
Stumme, G.; Taouil, R.; Bastide, Y.; Pasquier, N. & Lakhal, L. (2001),
Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis, in
F. Baader; G. Brewker & T. Eiter, ed.,
'KI 2001: Advances in Artificial Intelligence. KI 2001'
, Springer, Heidelberg
, pp. 335-350
.
[BibTeX]
[Endnote]
Bastide, Y.; Taouil, R.; Pasquier, N.; Stumme, G. & Lakhal, L. (2000),
Levelwise Search of Frequent Patterns, in
'Actes des 16ièmes Journées Bases de Données Avancées'
, Blois, France
, pp. 307-322
.
[BibTeX]
[Endnote]
Bastide, Y.; Taouil, R.; Pasquier, N.; Stumme, G. & Lakhal, L. (2000),
'Mining Frequent Patterns with Counting Inference.', SIGKDD Explorations, Special Issue on Scalable Algorithms
2
(2)
, 71-80
.
[BibTeX]
[Endnote]
Bastide, Y.; Pasquier, N.; Taouil, R.; Stumme, G. & Lakhal, L. (2000),
Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets, in
J. Lloyd; V. Dahl; U. Furbach; M. Kerber; K.-K. Laus; C. Palamidessi; L.M. Pereira; Y. Sagiv & P.J. Stuckey, ed.,
'Computational Logic --- CL 2000 Proc. CL'00'
, Springer, Heidelberg
.
[BibTeX]
[Endnote]
Stumme, G. (1999),
'Conceptual Knowledge Discovery with Frequent Concept Lattices'
, Technical report, TU Darmstadt
.
[BibTeX]
[Endnote]