Extracting Minimal Non-Redundant Association Rules from QCIL

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	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 Yun Li Articles by Zong-tian Liu Articles by Ling Chen Articles by Wei Cheng Articles by Cui-hua Xie

Fourth International Conference on Computer and Information Technology (CIT'04)

Wuhan, China

September 14-September 16

ISBN: 0-7695-2216-5

	ASCII Text	x
	Yun Li, Zong-tian Liu, Ling Chen, Wei Cheng, Cui-hua Xie, "Extracting Minimal Non-Redundant Association Rules from QCIL," Computer and Information Technology, International Conference on, pp. 986-991, Fourth International Conference on Computer and Information Technology (CIT'04), 2004.

	BibTex	x
	@article{ 10.1109/CIT.2004.1357324, author = {Yun Li and Zong-tian Liu and Ling Chen and Wei Cheng and Cui-hua Xie}, title = {Extracting Minimal Non-Redundant Association Rules from QCIL}, journal ={Computer and Information Technology, International Conference on}, volume = {0}, year = {2004}, isbn = {0-7695-2216-5}, pages = {986-991}, doi = {http://doi.ieeecomputersociety.org/10.1109/CIT.2004.1357324}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computer and Information Technology, International Conference on TI - Extracting Minimal Non-Redundant Association Rules from QCIL SN - 0-7695-2216-5 SP986 EP991 A1 - Yun Li, A1 - Zong-tian Liu, A1 - Ling Chen, A1 - Wei Cheng, A1 - Cui-hua Xie, PY - 2004 KW - Association rule KW - Frequent closed itemset KW - Minimal non-redundant rule KW - Quantitative closed itemset lattice VL - 0 JA - Computer and Information Technology, International Conference on ER -

Yun Li, Shanghai University

Zong-tian Liu, Shanghai University

Ling Chen, Yangzhou University

Wei Cheng, Yangzhou University

Cui-hua Xie, Yangzhou University

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CIT.2004.1357324

The association rules are usually extracted from frequent itemsets (FIs), but the number is enormous, and there are some FIs with the same tideset, so many redundant rules exist in the mined rules. The frequent closed itemsets are adopted in order to reduce the number of FIs and without lose any useful information. With the inherent closure properties in objects and attributes, the concept lattice is very suitable for representing the relation between closed itemsets. In this paper, the Quantitative Closed Itemset Lattice (QCIL) is formed with the modified node structure, and a scheme of building QCIL incrementally from database is adopted. The minimal non-redundant rules are that with minimal antecedent and maximal consequent, and they correspond to the Set of the Least ITemsets (SLIT) of the nodes in QCIL. An innovative algorithm of extracting the association rule by using the SLIT is presented, which can directly extract minimal non-redundant association rules from QCIL.

Index Terms:

Association rule, Frequent closed itemset, Minimal non-redundant rule, Quantitative closed itemset lattice

Citation:

Yun Li, Zong-tian Liu, Ling Chen, Wei Cheng, Cui-hua Xie, "Extracting Minimal Non-Redundant Association Rules from QCIL," cit, pp.986-991, Fourth International Conference on Computer and Information Technology (CIT'04), 2004

Peer Review Notice | Give Us Feedback

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