QuickSearch:   Number of matching entries: 0.

AuthorTitleYearJournal/ProceedingsReftypeDOI/URL
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}
}

Created by JabRef export filters on 01/05/2024 by the social publication management platform PUMA