TY  - CONF
AU  - Bastide, Y.
AU  - Pasquier, N.
AU  - Taouil, R.
AU  - Stumme, G.
AU  - Lakhal, L.
A2  - Lloyd, J.
A2  - Dahl, V.
A2  - Furbach, U.
A2  - Kerber, M.
A2  - Laus, K.-K.
A2  - Palamidessi, C.
A2  - Pereira, L.M.
A2  - Sagiv, Y.
A2  - Stuckey, P.J.
T1  - Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets
T2  - Computational Logic --- CL 2000 Proc. CL'00
PB  - Springer
C1  - Heidelberg
PY  - 2000/
CY  -  
VL  - 1861
IS  - 
SP  - 
EP  - 
UR  - http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf
DO  - 
KW  - 2000
KW  - analys
KW  - association
KW  - closed
KW  - concept
KW  - condensed
KW  - data
KW  - discovery
KW  - fca
KW  - formal
KW  - frequent
KW  - itemsets
KW  - kdd
KW  - knowledge
KW  - mining
KW  - myown
KW  - representation
KW  - representations
KW  - rule
KW  - rules
L1  - 
SN  - 
N1  - Publications of Gerd Stumme
N1  - 
AB  - 
ER  -

TY  - JOUR
AU  - Bastide, Y.
AU  - Taouil, R.
AU  - Pasquier, N.
AU  - Stumme, G.
AU  - Lakhal, L.
T1  - Mining Frequent Patterns with Counting Inference.
JO  - SIGKDD Explorations, Special Issue on Scalable Algorithms
PY  - 2000/
VL  - 2
IS  - 2
SP  - 71
EP  - 80
UR  - 
DO  - 
KW  - 2000
KW  - FCA
KW  - OntologyHandbook
KW  - analys
KW  - association
KW  - closed
KW  - concept
KW  - condensed
KW  - data
KW  - discovery
KW  - fca
KW  - formal
KW  - frequent
KW  - itemsets
KW  - kdd
KW  - knowledge
KW  - mining
KW  - myown
KW  - representation
KW  - representations
KW  - rule
KW  - rules
L1  - 
SN  - 
N1  - Publications of Gerd Stumme
N1  - 
AB  - 
ER  -