BibSonomy :: bibtex  ::

tag user group author concept BibTeX key search:all search:grahl
A blue social bookmark and publication sharing system.
tags · relations · groups · popular
help · blog · about
login · register
grahl's BibTeX entry:  

Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets

Computational Logic --- CL 2000 Proc. CL'00, 18612000.
Authors: Y. Bastide and N. Pasquier and R. Taouil and G. Stumme and L. Lakhal
Editors: J. Lloyd and V. Dahl and U. Furbach and M. Kerber and K.-K. Laus and C. Palamidessi and L.M. Pereira and Y. Sagiv and P.J. Stuckey
URL: http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf
Tags: analysis association closed concept condensed data-mining discovery fca formal frequent itemset kdd knowledge representation rule
| URL | BibTeX  
@inproceedings{bastide00miningminimal,
title = {Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets},
address = {Heidelberg},
author = {Y. Bastide and N. Pasquier and R. Taouil and G. Stumme and L. Lakhal},
booktitle = {Computational Logic --- CL 2000 Proc. CL'00},
editor = {J. Lloyd and V. Dahl and U. Furbach and M. Kerber and K.-K. Laus and C. Palamidessi and L.M. Pereira and Y. Sagiv and P.J. Stuckey},
note = {{P}art of \cite{pasquierinpressgenerating}},
publisher = {Springer},
series = {LNAI},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf},
volume = {1861},
year = {2000},
page = {972-986},
keywords = {analysis association closed concept condensed data-mining discovery fca formal frequent itemset kdd knowledge representation rule }
}