Mining Bases for Association Rules Using Closed Sets

San Diego, California February 28-March 03

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/ICDE.2000.839424

16th International Conference on Data ...

	This Article
	PURCHASE ARTICLE: $0 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Nicolas Pasquier Articles by Yves Bastide Articles by Rafik Taouil Articles by Lotfi Lakhal

	ASCII Text	x
	Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal, "Mining Bases for Association Rules Using Closed Sets," Data Engineering, International Conference on, pp. 307, 16th International Conference on Data Engineering (ICDE'00), 2000.

	BibTex	x
	@article{ 10.1109/ICDE.2000.839424, author = {Nicolas Pasquier and Yves Bastide and Rafik Taouil and Lotfi Lakhal}, title = {Mining Bases for Association Rules Using Closed Sets}, journal ={Data Engineering, International Conference on}, volume = {0}, year = {2000}, issn = {1063-6382}, pages = {307}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDE.2000.839424}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Data Engineering, International Conference on TI - Mining Bases for Association Rules Using Closed Sets SN - 1063-6382 SP EP A1 - Nicolas Pasquier, A1 - Yves Bastide, A1 - Rafik Taouil, A1 - Lotfi Lakhal, PY - 2000 KW - Data Mining KW - Knowledge Discovery in Databases KW - Galois closure operator KW - frequent closed itemsets KW - bases for association rules VL - 0 JA - Data Engineering, International Conference on ER -

Nicolas Pasquier, Universit? Clermont-Ferrand II

Yves Bastide, Universit? Clermont-Ferrand II

Rafik Taouil, Universit? Clermont-Ferrand II

Lotfi Lakhal, Universit? Clermont-Ferrand II

We address the problem of the usefulness and the relevance of the set of discovered association rules. Using the frequent closed item set groundwork, we propose to generate bases for association rules, that are non-redundant generating sets for all association rules.

Index Terms:

Data Mining, Knowledge Discovery in Databases, Galois closure operator, frequent closed itemsets, bases for association rules

Citation:

Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal, "Mining Bases for Association Rules Using Closed Sets," icde, pp.307, 16th International Conference on Data Engineering (ICDE'00), 2000

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.