| Author | Title | Year | Journal/Proceedings | Reftype | DOI/URL |
|---|---|---|---|---|---|
| Lakhal, L. & Stumme, G. | Efficient Mining of Association Rules Based on Formal Concept Analysis | 2005 | Vol. 3626Formal Concept Analysis: Foundations and Applications, pp. 180-195 |
inbook | URL |
| 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. |
|||||
BibTeX:
@inbook{lakhal2005efficient,
author = {Lakhal, Lotfi and Stumme, Gerd},
title = {Efficient Mining of Association Rules Based on Formal Concept Analysis},
booktitle = {Formal Concept Analysis: Foundations and Applications},
publisher = {Springer},
year = {2005},
volume = {3626},
pages = {180-195},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/lakhal2005efficient.pdf}
}
|
|||||
| Lakhal, L. & Stumme, G. | Efficient Mining of Association Rules Based on Formal Concept Analysis | 2005 | Vol. 3626Formal Concept Analysis: Foundations and Applications, pp. 180-195 |
inbook | URL |
| 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. |
|||||
BibTeX:
@inbook{lakhal2005efficient,
author = {Lakhal, Lotfi and Stumme, Gerd},
title = {Efficient Mining of Association Rules Based on Formal Concept Analysis},
booktitle = {Formal Concept Analysis: Foundations and Applications},
publisher = {Springer},
year = {2005},
volume = {3626},
pages = {180-195},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/lakhal2005efficient.pdf}
}
|
|||||
| Pasquier, N., Taouil, R., Bastide, Y., Stumme, G. & Lakhal, L. | Generating a Condensed Representation for Association Rules [BibTeX] |
2005 | Journal Intelligent Information Systems (JIIS) Vol. 24(1), pp. 29-60 |
article | URL |
BibTeX:
@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}
}
|
|||||
| Pasquier, N., Taouil, R., Bastide, Y., Stumme, G. & Lakhal, L. | Generating a Condensed Representation for Association Rules [BibTeX] |
2005 | Journal Intelligent Information Systems (JIIS) Vol. 24(1), pp. 29-60 |
article | URL |
BibTeX:
@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}
}
|
|||||
Created by JabRef on 16/04/2024.