| 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}
}
|
|||||
| Bastide, Y., Taouil, R., Pasquier, N., Stumme, G. & Lakhal, L. | Pascal: un alogorithme d'extraction des motifs fréquents [BibTeX] |
2002 | Technique et Science Informatiques (TSI) Vol. 21(1), pp. 65-95 |
article | URL |
BibTeX:
@article{bastide02unalogorithme,
author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.},
title = {Pascal: un alogorithme d'extraction des motifs fréquents},
journal = {Technique et Science Informatiques (TSI)},
year = {2002},
volume = {21},
number = {1},
pages = {65-95},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2001/TSI01.pdf}
}
|
|||||
| Stumme, G., Taouil, R., Bastide, Y., Pasqier, N. & Lakhal, L. | Computing Iceberg Concept Lattices with Titanic [BibTeX] |
2002 | J. Data and KnowledgeEngineering (DKE) Vol. 42(2), pp. 189-222 |
article | URL |
BibTeX:
@article{stumme02computing,
author = {Stumme, G. and Taouil, R. and Bastide, Y. and Pasqier, N. and Lakhal, L.},
title = {Computing Iceberg Concept Lattices with Titanic},
journal = {J. Data and KnowledgeEngineering (DKE)},
year = {2002},
volume = {42},
number = {2},
pages = {189-222},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2002/stumme2002computing.pdf}
}
|
|||||
| Stumme, G. | Efficient Data Mining Based on Formal Concept Analysis [BibTeX] |
2002 | Vol. 2453Database and Expert Systems Applications. Proc. DEXA 2002, pp. 534-546 |
inproceedings | URL |
BibTeX:
@inproceedings{stumme02efficient,
author = {Stumme, G.},
title = {Efficient Data Mining Based on Formal Concept Analysis},
booktitle = {Database and Expert Systems Applications. Proc. DEXA 2002},
publisher = {Springer},
year = {2002},
volume = {2453},
pages = {534-546},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2002/DEXA02.pdf}
}
|
|||||
| Stumme, G., Taouil, R., Bastide, Y. & Lakhal, L. | Conceptual Clustering with Iceberg Concept Lattices [BibTeX] |
2001 | Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01) | inproceedings | URL |
BibTeX:
@inproceedings{stumme01conceptualclustering,
author = {Stumme, G. and Taouil, R. and Bastide, Y. and Lakhal, L.},
title = {Conceptual Clustering with Iceberg Concept Lattices},
booktitle = {Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01)},
year = {2001},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2001/FGML01.pdf}
}
|
|||||
| Stumme, G., Taouil, R., Bastide, Y. & Lakhal, L. | Conceptual Clustering with Iceberg Concept Lattices [BibTeX] |
2001 | Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01) | inproceedings | URL |
BibTeX:
@inproceedings{stumme01conceptualclustering,
author = {Stumme, G. and Taouil, R. and Bastide, Y. and Lakhal, L.},
title = {Conceptual Clustering with Iceberg Concept Lattices},
booktitle = {Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01)},
year = {2001},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2001/FGML01.pdf}
}
|
|||||
| Stumme, G., Taouil, R., Bastide, Y., Pasquier, N. & Lakhal, L. | Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis [BibTeX] |
2001 | Vol. 2174KI 2001: Advances in Artificial Intelligence. KI 2001, pp. 335-350 |
inproceedings | URL |
BibTeX:
@inproceedings{stumme01intelligent,
author = {Stumme, G. and Taouil, R. and Bastide, Y. and Pasquier, N. and Lakhal, L.},
title = {Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis},
booktitle = {KI 2001: Advances in Artificial Intelligence. KI 2001},
publisher = {Springer},
year = {2001},
volume = {2174},
pages = {335-350},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2001/KI01.pdf}
}
|
|||||
| Bastide, Y., Taouil, R., Pasquier, N., Stumme, G. & Lakhal, L. | Levelwise Search of Frequent Patterns [BibTeX] |
2000 | Actes des 16ièmes Journées Bases de Données Avancées, pp. 307-322 | inproceedings | URL |
BibTeX:
@inproceedings{bastide00levelwise,
author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.},
title = {Levelwise Search of Frequent Patterns},
booktitle = {Actes des 16ièmes Journées Bases de Données Avancées},
publisher = {Blois},
year = {2000},
pages = {307-322},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/BDA00.pdf}
}
|
|||||
| Bastide, Y., Taouil, R., Pasquier, N., Stumme, G. & Lakhal, L. | Mining Frequent Patterns with Counting Inference. [BibTeX] |
2000 | SIGKDD Explorations, Special Issue on Scalable Algorithms Vol. 2(2), pp. 71-80 |
article | |
BibTeX:
@article{bastide00miningfrequent,
author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.},
title = {Mining Frequent Patterns with Counting Inference.},
journal = {SIGKDD Explorations, Special Issue on Scalable Algorithms},
year = {2000},
volume = {2},
number = {2},
pages = {71-80}
}
|
|||||
| Bastide, Y., Pasquier, N., Taouil, R., Stumme, G. & Lakhal, L. | Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets [BibTeX] |
2000 | Vol. 1861Computational Logic --- CL 2000 Proc. CL'00 |
inproceedings | URL |
BibTeX:
@inproceedings{bastide00miningminimal,
author = {Bastide, Y. and Pasquier, N. and Taouil, R. and Stumme, G. and Lakhal, L.},
title = {Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets},
booktitle = {Computational Logic --- CL 2000 Proc. CL'00},
publisher = {Springer},
year = {2000},
volume = {1861},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf}
}
|
|||||
| Boulicaut, J.-F., Bykowski, A. & Rigotti, C. | Approximation of Frequency Queris by Means of Free-Sets [BibTeX] |
2000 | Principles of Data Mining and Knowledge Discovery, pp. 75-85 | inproceedings | URL |
BibTeX:
@inproceedings{boulicaut00approximation,
author = {Boulicaut, Jean-Francois and Bykowski, Artur and Rigotti, Christophe},
title = {Approximation of Frequency Queris by Means of Free-Sets},
booktitle = {Principles of Data Mining and Knowledge Discovery},
year = {2000},
pages = {75-85},
url = {citeseer.ist.psu.edu/boulicaut00approximation.html}
}
|
|||||
| Stumme, G., Taouil, R., Bastide, Y., Pasquier, N. & Lakhal, L. | Fast Computation of Concept Lattices Using Data Mining Techniques [BibTeX] |
2000 | Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases | inproceedings | URL |
BibTeX:
@inproceedings{stumme00fast,
author = {Stumme, G. and Taouil, R. and Bastide, Y. and Pasquier, N. and Lakhal, L.},
title = {Fast Computation of Concept Lattices Using Data Mining Techniques},
booktitle = {Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases},
year = {2000},
note = {http://ceur-ws.org/Vol-29. Part of testumme02computing},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/KRDB00.pdf}
}
|
|||||
| Stumme, G. | Conceptual Knowledge Discovery with Frequent Concept Lattices [BibTeX] |
1999 | techreport | URL | |
BibTeX:
@techreport{stumme99conceptualknowledge,
author = {Stumme, G.},
title = {Conceptual Knowledge Discovery with Frequent Concept Lattices},
year = {1999},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/1999/P2043.pdf}
}
|
|||||
Created by JabRef on 01/05/2024.