Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets
Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, und L. Lakhal.
Computational Logic --- CL 2000 Proc. CL'00, Volume 1861 von LNAI, Heidelberg, Springer, (2000)

Dokument

http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf

Suchen auf

Diese Publikation wurde noch nicht bewertet.

Bewertungsverteilung

Durchschnittliche Benutzerbewertung0,0 von 5.0 auf Grundlage von 0 Rezensionen

Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.

@inproceedings{bastide00miningminimal,
  added-at = {2010-04-07T13:54:41.000+0200},
  address = {Heidelberg},
  author = {Bastide, Y. and Pasquier, N. and Taouil, R. and Stumme, G. and Lakhal, L.},
  biburl = {https://puma.uni-kassel.de/bibtex/225fa3431e7bdd7057f9b80a7385cd718/stumme},
  booktitle = {Computational Logic --- CL 2000 Proc. CL'00},
  description = {Publications of Gerd Stumme},
  editor = {Lloyd, J. and Dahl, V. and Furbach, U. and Kerber, M. and Laus, K.-K. and Palamidessi, C. and Pereira, L.M. and Sagiv, Y. and Stuckey, P.J.},
  interhash = {dc10d0ad3c40463f049ac775cb250f3d},
  intrahash = {25fa3431e7bdd7057f9b80a7385cd718},
  keywords = {2000 analys association closed concept condensed data discovery fca formal frequent itemsets kdd knowledge mining myown representation representations rule rules},
  page = {972-986},
  publisher = {Springer},
  series = {LNAI},
  timestamp = {2010-04-07T13:54:42.000+0200},
  title = {Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf},
  volume = 1861,
  year = 2000
}

%0 Conference Paper
%1 bastide00miningminimal
%A Bastide, Y.
%A Pasquier, N.
%A Taouil, R.
%A Stumme, G.
%A Lakhal, L.
%B Computational Logic --- CL 2000 Proc. CL'00
%C Heidelberg
%D 2000
%E Lloyd, J.
%E Dahl, V.
%E Furbach, U.
%E Kerber, M.
%E Laus, K.-K.
%E Palamidessi, C.
%E Pereira, L.M.
%E Sagiv, Y.
%E Stuckey, P.J.
%I Springer
%K 2000 analys association closed concept condensed data discovery fca formal frequent itemsets kdd knowledge mining myown representation representations rule rules
%T Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets
%U http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf
%V 1861

PUMA

Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets
Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, und L. Lakhal.
Computational Logic --- CL 2000 Proc. CL'00, Volume 1861 von LNAI, Heidelberg, Springer, (2000)

Tags

Nutzer

Kommentare und Rezensionen

Zitieren Sie diese Publikation

PUMA

Mining Minimal Non-Redundant Association Rules Using Frequent Closed ItemsetsY. Bastide, N. Pasquier, R. Taouil, G. Stumme, und L. Lakhal. Computational Logic --- CL 2000 Proc. CL'00, Volume 1861 von LNAI, Heidelberg, Springer, (2000)

Tags

Nutzer

Kommentare und Rezensionen

Zitieren Sie diese Publikation

Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets
Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, und L. Lakhal.
Computational Logic --- CL 2000 Proc. CL'00, Volume 1861 von LNAI, Heidelberg, Springer, (2000)