PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Bastide, Yves"

Author of the publication

copydeleteadd this publication to your clipboard
Fast Computation of Concept lattices Using Data Mining Techniques.

, , , , and . KRDB, volume 29 of CEUR Workshop Proceedings, page 129-139. CEUR-WS.org, (2000)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Yves Klett

 

Other publications of authors with the same name

Efficient Mining of Association Rules Using Closed Itemset Lattices., , , and . Inf. Syst., 24 (1): 25-46 (1999)Pruning closed itemset lattices for associations rules., , , and . BDA, (1998)Generating a Condensed Representation for Association Rules., , , , and . J. Intell. Inf. Syst., 24 (1): 29-60 (2005)Mining Frequent Patterns with Counting Inference., , , , and . SIGKDD Explorations, 2 (2): 66-75 (2000)Closed Set Based Discovery of Small Covers for Association Rules., , , and . Proc. 15èmes Journées Bases de Données Avancées, BDA, page 361-381. Actes, (1999)Levelwise Search of Frequent Patterns with Counting Inference., , , , and . BDA, (2000)Fast Computation of Concept lattices Using Data Mining Techniques., , , , and . KRDB, volume 29 of CEUR Workshop Proceedings, page 129-139. CEUR-WS.org, (2000)Computing iceberg concept lattices with T., , , , and . Data Knowl. Eng., 42 (2): 189-222 (2002)Mining Bases for Association Rules Using Closed Sets., , , and . ICDE, page 307. (2000)Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets., , , , and . Computational Logic, volume 1861 of Lecture Notes in Computer Science, page 972-986. Springer, (2000)