QuickSearch:   Number of matching entries: 0.

AuthorTitleYearJournal/ProceedingsReftypeDOI/URL
Lakhal, L. & Stumme, G. Efficient Mining of Association Rules Based on Formal Concept Analysis 2005 Formal Concept Analysis: Foundations and Applications   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 2005 Journal Intelligent Information Systems (JIIS)   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}
}
Stumme, G. Efficient Data Mining Based on Formal Concept Analysis 2002 Database and Expert Systems Applications. Proc. DEXA 2002   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., Pasquier, N. & Lakhal, L. Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis 2001 KI 2001: Advances in Artificial Intelligence. KI 2001   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 2000 Actes des 16ièmes Journées Bases de Données Avancées   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. 2000 SIGKDD Explorations, Special Issue on Scalable Algorithms   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 2000 Computational 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 2000 Principles of Data Mining and Knowledge Discovery   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. Conceptual Knowledge Discovery with Frequent Concept Lattices 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}
}
Pasquier, N., Bastide, Y., Taouil, R. & Lakhal, L. Pruning closed itemset lattices for associations rules. 1998 Bases de Donn�es Avanc�es   inproceedings URL  
BibTeX:
@inproceedings{pasquier98pruning,
  author = {Pasquier, Nicolas and Bastide, Yves and Taouil, Rafik and Lakhal, Lotfi},
  title = {Pruning closed itemset lattices for associations rules.},
  booktitle = {Bases de Donn�es Avanc�es},
  year = {1998},
  url = {http://dblp.uni-trier.de/db/conf/bda/bda98.html#PasquierBTL98}
}
Pasquier, N., Bastide, Y., Taouil, R. & Lakhal, L. Pruning closed itemset lattices for associations rules. 1998 Bases de Données Avancées   inproceedings URL  
BibTeX:
@inproceedings{pasquier98pruning,
  author = {Pasquier, Nicolas and Bastide, Yves and Taouil, Rafik and Lakhal, Lotfi},
  title = {Pruning closed itemset lattices for associations rules.},
  booktitle = {Bases de Données Avancées},
  year = {1998},
  url = {http://dblp.uni-trier.de/db/conf/bda/bda98.html#PasquierBTL98}
}

Created by JabRef export filters on 25/02/2020 by the social publication management platform PUMA