Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Yves Bastide, Nicolas Pasquier, Rafik Taouil, Gerd Stumme, Lotfi Lakhal
Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets
ICLP, 2000.

CL 2000
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{CL-2000-BastidePTSL,
	author        = "Yves Bastide and Nicolas Pasquier and Rafik Taouil and Gerd Stumme and Lotfi Lakhal",
	booktitle     = "{Proceedings of the First International Conference on Computational Logic}",
	doi           = "10.1007/3-540-44957-4_65",
	isbn          = "3-540-67797-6",
	pages         = "972--986",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets}",
	volume        = 1861,
	year          = 2000,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.