From Intent Reducts for Attribute Implications to Approximate Intent Reducts for Association Rules

Authors:
Zhipeng Xie;Zongtian Liu
Affiliations:
Fudan University;Shanghai University
Venue:
CIT '05 Proceedings of the The Fifth International Conference on Computer and Information Technology
Year:
2005

Citing 0
Cited 2

Looking for a structural characterization of the sparseness measure of (frequent closed) itemset contexts

Information Sciences: an International Journal
Key roles of closed sets and minimal generators in concise representations of frequent patterns

Intelligent Data Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.