The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Yves Bastide: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal
    Discovering Frequent Closed Itemsets for Association Rules. [Citation Graph (2, 11)][DBLP]
    ICDT, 1999, pp:398-416 [Conf]
  2. Rafik Taouil, Nicolas Pasquier, Yves Bastide, Lotfi Lakhal
    Mining Bases for Association Rules Using Closed Sets. [Citation Graph (1, 0)][DBLP]
    ICDE, 2000, pp:307- [Conf]
  3. Yves Bastide, Rafik Taouil, Nicolas Pasquier, Gerd Stumme, Lotfi Lakhal
    Levelwise Search of Frequent Patterns with Counting Inference. [Citation Graph (0, 0)][DBLP]
    BDA, 2000, pp:- [Conf]
  4. Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal
    Pruning closed itemset lattices for associations rules. [Citation Graph (0, 0)][DBLP]
    BDA, 1998, pp:- [Conf]
  5. Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal
    Closed Set Based Discovery of Small Covers for Association Rules. [Citation Graph (0, 0)][DBLP]
    Proc. 15èmes Journées Bases de Données Avancées, BDA, 1999, pp:361-381 [Conf]
  6. Yves Bastide, Nicolas Pasquier, Rafik Taouil, Gerd Stumme, Lotfi Lakhal
    Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets. [Citation Graph (0, 0)][DBLP]
    Computational Logic, 2000, pp:972-986 [Conf]
  7. Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal
    Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis. [Citation Graph (0, 0)][DBLP]
    KI/ÖGAI, 2001, pp:335-350 [Conf]
  8. Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal
    Fast Computation of Concept lattices Using Data Mining Techniques. [Citation Graph (0, 0)][DBLP]
    KRDB, 2000, pp:129-139 [Conf]
  9. Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal
    Computing iceberg concept lattices with T. [Citation Graph (0, 0)][DBLP]
    Data Knowl. Eng., 2002, v:42, n:2, pp:189-222 [Journal]
  10. Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal
    Efficient Mining of Association Rules Using Closed Itemset Lattices. [Citation Graph (0, 0)][DBLP]
    Inf. Syst., 1999, v:24, n:1, pp:25-46 [Journal]
  11. Nicolas Pasquier, Rafik Taouil, Yves Bastide, Gerd Stumme, Lotfi Lakhal
    Generating a Condensed Representation for Association Rules. [Citation Graph (0, 0)][DBLP]
    J. Intell. Inf. Syst., 2005, v:24, n:1, pp:29-60 [Journal]
  12. Yves Bastide, Rafik Taouil, Nicolas Pasquier, Gerd Stumme, Lotfi Lakhal
    Mining Frequent Patterns with Counting Inference. [Citation Graph (0, 0)][DBLP]
    SIGKDD Explorations, 2000, v:2, n:2, pp:66-75 [Journal]

Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002