loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth International Conference on Computer and Information Technology (CIT'05)
From Intent Reducts for Attribute Implications to Approximate Intent Reducts for Association Rules
Shanghai, China
September 21-September 23
ISBN: 0-7695-2432-X
ASCII Text
x 
 
Zhipeng Xie, Zongtian Liu, "From Intent Reducts for Attribute Implications to Approximate Intent Reducts for Association Rules," Computer and Information Technology, International Conference on, pp. 162-169, Fifth International Conference on Computer and Information Technology (CIT'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/CIT.2005.121,
author = {Zhipeng Xie and Zongtian Liu},
title = {From Intent Reducts for Attribute Implications to Approximate Intent Reducts for Association Rules},
journal ={Computer and Information Technology, International Conference on},
volume = {0},
year = {2005},
isbn = {0-7695-2432-X},
pages = {162-169},
doi = {http://doi.ieeecomputersociety.org/10.1109/CIT.2005.121},
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 - From Intent Reducts for Attribute Implications to Approximate Intent Reducts for Association Rules
SN - 0-7695-2432-X
SP162
EP169
A1 - Zhipeng Xie,
A1 - Zongtian Liu,
PY - 2005
KW - null
VL - 0
JA - Computer and Information Technology, International Conference on
ER -
 
Zhipeng Xie, Fudan University
Zongtian Liu, Shanghai University

Automatic extraction of data dependencies or regularities from historical data is of great importance in practice. Concept lattice could serve as a common framework for such tasks. To deal with two typical kinds of data dependencies, attribute implications and association rules, this paper presents the de?nitions of intent reducts and approximate intent reducts, as the theoretical foundation for extracting these two kinds of knowledge. Algorithms for calculating them are developed. We also given out the methods for extracting attribute implications and association rules. The results provide a better understanding of attribute implications, association rules, and concept lattices.

Citation:
Zhipeng Xie, Zongtian Liu, "From Intent Reducts for Attribute Implications to Approximate Intent Reducts for Association Rules," cit, pp.162-169, Fifth International Conference on Computer and Information Technology (CIT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.