BibSonomy :: bibtex  ::

publications

(4)

• Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets
  Yves Bastide and Nicolas Pasquier and Rafik Taouil and Gerd Stumme and Lotfi Lakhal Computational Logic - CL 2000. Proc. CL '00 972-986 (2000)
  to imported by example on 2007-01-12 12:23:27
  | BibTeX  
• Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets
  Y. Bastide and N. Pasquier and R. Taouil and G. Stumme and L. Lakhal Computational Logic --- CL 2000 Proc. CL'00 (2000)
  to analysis association closed concept condensed data-mining discovery fca formal frequent itemset kdd knowledge representation rule by grahl on 2006-11-17 08:45:35
  | URL | BibTeX  
• Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets
  Y. Bastide and N. Pasquier and R. Taouil and G. Stumme and L. Lakhal Computational Logic --- CL 2000 Proc. CL'00 (2000)
  to 2000 analys association closed concept condensed data discovery fca formal frequent itemsets kdd knowledge mining myown representation representations rule rules by stumme on 2006-09-20 19:31:53
  | URL | BibTeX  
• Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets.
  Yves Bastide and Nicolas Pasquier and Rafik Taouil and Gerd Stumme and Lotfi Lakhal Computational Logic 972-986 (2000)
  to dblp by dblp on 2002-01-03 00:00:00
  | URL | BibTeX