Lakhal, L. & Stumme, G.
(2005):
Efficient Mining of Association Rules Based on Formal Concept Analysis. LNAI Heidelberg
[Volltext] [Kurzfassung] [BibTeX]
[Endnote]
Association rules are a popular knowledge discovery technique for
rehouse basket analysis. They indicate which items of the
rehouse are frequently bought together. The problem of association
le mining has first been stated in 1993. Five years later, several
search groups discovered that this problem has a strong connection
Formal Concept Analysis (FCA). In this survey, we will first
troduce some basic ideas of this connection along a specific
gorithm, and show how FCA helps in reducing the number
resulting rules without loss of information, before giving a
neral overview over the history and state of the art of applying
A for association rule mining.
@inbook{lakhal2005efficient,
author = {Lakhal, Lotfi and Stumme, Gerd},
title = {Efficient Mining of Association Rules Based on Formal Concept Analysis},
editor = {Ganter, Bernhard and Stumme, Gerd and Wille, Rudolf},
booktitle = {Formal Concept Analysis: Foundations and Applications},
series = {LNAI},
publisher = {Springer},
address = {Heidelberg},
year = {2005},
volume = {3626},
pages = {180-195},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/lakhal2005efficient.pdf},
keywords = {concept, book, discovery, 2005, association, l3s, analysis, kdd, myown, data, knowledge, closed, formal, rules, itegpub, condensed, itemsets, fca, representations, mining},
abstract = {Association rules are a popular knowledge discovery technique for
rehouse basket analysis. They indicate which items of the
rehouse are frequently bought together. The problem of association
le mining has first been stated in 1993. Five years later, several
search groups discovered that this problem has a strong connection
Formal Concept Analysis (FCA). In this survey, we will first
troduce some basic ideas of this connection along a specific
gorithm, and show how FCA helps in reducing the number
resulting rules without loss of information, before giving a
neral overview over the history and state of the art of applying
A for association rule mining.}
}
%0 = inbook
%A = Lakhal, Lotfi and Stumme, Gerd
%B = Formal Concept Analysis: Foundations and Applications
%C = Heidelberg
%D = 2005
%I = Springer
%T = Efficient Mining of Association Rules Based on Formal Concept Analysis
%U = http://www.kde.cs.uni-kassel.de/stumme/papers/2005/lakhal2005efficient.pdf
Lakhal, L. & Stumme, G.
(2005):
Efficient Mining of Association Rules Based on Formal Concept Analysis. LNAI Heidelberg
[Volltext] [Kurzfassung] [BibTeX]
[Endnote]
Association rules are a popular knowledge discovery technique for
rehouse basket analysis. They indicate which items of the
rehouse are frequently bought together. The problem of association
le mining has first been stated in 1993. Five years later, several
search groups discovered that this problem has a strong connection
Formal Concept Analysis (FCA). In this survey, we will first
troduce some basic ideas of this connection along a specific
gorithm, and show how FCA helps in reducing the number
resulting rules without loss of information, before giving a
neral overview over the history and state of the art of applying
A for association rule mining.
@inbook{lakhal2005efficient,
author = {Lakhal, Lotfi and Stumme, Gerd},
title = {Efficient Mining of Association Rules Based on Formal Concept Analysis},
editor = {Ganter, Bernhard and Stumme, Gerd and Wille, Rudolf},
booktitle = {Formal Concept Analysis: Foundations and Applications},
series = {LNAI},
publisher = {Springer},
address = {Heidelberg},
year = {2005},
volume = {3626},
pages = {180-195},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/lakhal2005efficient.pdf},
keywords = {concept, book, discovery, 2005, association, l3s, analysis, kdd, myown, data, knowledge, closed, formal, rules, itegpub, condensed, itemsets, fca, representations, mining},
abstract = {Association rules are a popular knowledge discovery technique for
rehouse basket analysis. They indicate which items of the
rehouse are frequently bought together. The problem of association
le mining has first been stated in 1993. Five years later, several
search groups discovered that this problem has a strong connection
Formal Concept Analysis (FCA). In this survey, we will first
troduce some basic ideas of this connection along a specific
gorithm, and show how FCA helps in reducing the number
resulting rules without loss of information, before giving a
neral overview over the history and state of the art of applying
A for association rule mining.}
}
%0 = inbook
%A = Lakhal, Lotfi and Stumme, Gerd
%B = Formal Concept Analysis: Foundations and Applications
%C = Heidelberg
%D = 2005
%I = Springer
%T = Efficient Mining of Association Rules Based on Formal Concept Analysis
%U = http://www.kde.cs.uni-kassel.de/stumme/papers/2005/lakhal2005efficient.pdf
Pasquier, N.; Taouil, R.; Bastide, Y.; Stumme, G. & Lakhal, L.
(2005):
Generating a Condensed Representation for Association Rules.
In: Journal Intelligent Information Systems (JIIS),
Ausgabe/Number: 1,
Vol. 24,
Verlag/Publisher: Kluwer Academic Publishers.
Erscheinungsjahr/Year: 2005.
Seiten/Pages: 29-60.
[Volltext] [BibTeX]
[Endnote]
@article{pasquier2005generating,
author = {Pasquier, Nicolas and Taouil, Rafik and Bastide, Yves and Stumme, Gerd and Lakhal, Lotfi},
title = {Generating a Condensed Representation for Association Rules},
journal = {Journal Intelligent Information Systems (JIIS)},
publisher = {Kluwer Academic Publishers},
year = {2005},
volume = {24},
number = {1},
pages = {29-60},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/pasquier2005generating.pdf},
keywords = {concept, discovery, 2005, association, OntologyHandbook, l3s, analysis, kdd, itemset, myown, rule, data, knowledge, closed, formal, rules, itegpub, condensed, fca, sets, representations, mining}
}
%0 = article
%A = Pasquier, Nicolas and Taouil, Rafik and Bastide, Yves and Stumme, Gerd and Lakhal, Lotfi
%D = 2005
%I = Kluwer Academic Publishers
%T = Generating a Condensed Representation for Association Rules
%U = http://www.kde.cs.uni-kassel.de/stumme/papers/2005/pasquier2005generating.pdf
Pasquier, N.; Taouil, R.; Bastide, Y.; Stumme, G. & Lakhal, L.
(2005):
Generating a Condensed Representation for Association Rules.
In: Journal Intelligent Information Systems (JIIS),
Ausgabe/Number: 1,
Vol. 24,
Verlag/Publisher: Kluwer Academic Publishers.
Erscheinungsjahr/Year: 2005.
Seiten/Pages: 29-60.
[Volltext] [BibTeX]
[Endnote]
@article{pasquier2005generating,
author = {Pasquier, Nicolas and Taouil, Rafik and Bastide, Yves and Stumme, Gerd and Lakhal, Lotfi},
title = {Generating a Condensed Representation for Association Rules},
journal = {Journal Intelligent Information Systems (JIIS)},
publisher = {Kluwer Academic Publishers},
year = {2005},
volume = {24},
number = {1},
pages = {29-60},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/pasquier2005generating.pdf},
keywords = {concept, discovery, 2005, association, OntologyHandbook, l3s, analysis, kdd, itemset, myown, rule, data, knowledge, closed, formal, rules, itegpub, condensed, fca, sets, representations, mining}
}
%0 = article
%A = Pasquier, Nicolas and Taouil, Rafik and Bastide, Yves and Stumme, Gerd and Lakhal, Lotfi
%D = 2005
%I = Kluwer Academic Publishers
%T = Generating a Condensed Representation for Association Rules
%U = http://www.kde.cs.uni-kassel.de/stumme/papers/2005/pasquier2005generating.pdf
Pasquier, N.; Bastide, Y.; Taouil, R. & Lakhal, L.
(1998):
Pruning closed itemset lattices for associations rules..
In: Bases de Donn�es Avanc�es,
[Volltext]
[BibTeX][Endnote]
@inproceedings{pasquier98pruning,
author = {Pasquier, Nicolas and Bastide, Yves and Taouil, Rafik and Lakhal, Lotfi},
title = {Pruning closed itemset lattices for associations rules.},
editor = {Bouzeghoub, Mokrane},
booktitle = {Bases de Donn�es Avanc�es},
year = {1998},
url = {http://dblp.uni-trier.de/db/conf/bda/bda98.html#PasquierBTL98},
keywords = {rules, closed, concept, formal, association, OntologyHandbook, FCA, analysis, fca, itemset, mining}
}
%0 = inproceedings
%A = Pasquier, Nicolas and Bastide, Yves and Taouil, Rafik and Lakhal, Lotfi
%B = Bases de Donn�es Avanc�es
%D = 1998
%T = Pruning closed itemset lattices for associations rules.
%U = http://dblp.uni-trier.de/db/conf/bda/bda98.html#PasquierBTL98
Pasquier, N.; Bastide, Y.; Taouil, R. & Lakhal, L.
(1998):
Pruning closed itemset lattices for associations rules..
In: Bases de Données Avancées,
[Volltext]
[BibTeX][Endnote]
@inproceedings{pasquier98pruning,
author = {Pasquier, Nicolas and Bastide, Yves and Taouil, Rafik and Lakhal, Lotfi},
title = {Pruning closed itemset lattices for associations rules.},
editor = {Bouzeghoub, Mokrane},
booktitle = {Bases de Données Avancées},
year = {1998},
url = {http://dblp.uni-trier.de/db/conf/bda/bda98.html#PasquierBTL98},
keywords = {rules, closed, concept, formal, association, analysis, fca, itemset, mining}
}
%0 = inproceedings
%A = Pasquier, Nicolas and Bastide, Yves and Taouil, Rafik and Lakhal, Lotfi
%B = Bases de Données Avancées
%D = 1998
%T = Pruning closed itemset lattices for associations rules.
%U = http://dblp.uni-trier.de/db/conf/bda/bda98.html#PasquierBTL98