Mining with Cover and Extension Operators

Authors:
Marzena Kryszkiewicz
Affiliations:
-
Venue:
PKDD '00 Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery
Year:
2000

Citing 3
Cited 3

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Fast discovery of association rules

Advances in knowledge discovery and data mining
Representative Association Rules

PAKDD '98 Proceedings of the Second Pacific-Asia Conference on Research and Development in Knowledge Discovery and Data Mining

Inferring Knowledge from Frequent Patterns

Soft-Ware 2002 Proceedings of the First International Conference on Computing in an Imperfect World
Inducing Theory for the Rule Set

RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Direct and Incremental Computing of Maximal Covering Rules

PAKDD '01 Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mining around association rules discovered in a large database is an important problem. In the paper, we consider the case, when a user wants to mine around the given set of association rules, but does not have access to the original database. We show how to reason with a set of rules by means of the cover and extension operators. Since the number of association rules can be huge, we introduce the concept of maximal covering rules. The algorithms for mining with the cover and extension operators are offered.