Fast Discovery of Representative Association Rules
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
In this paper, properties of representative association rules are investigated and a new efficient algorithm computing such rules are offered and offered.
Abstract
Discovering association rules among items in a large database is an important database mining problem. The number of association rules may be huge. To alleviate this problem, we introduced in [1] a notion of representative association rules. Representative association rules are a least set of rules that covers all association rules satisfying certain user specified constraints. The association rules, which are not representative ones, may be generated by means of a cover operator without accessing a database. In this paper, we investigate properties of representative association rules and offer a new efficient algorithm computing such rules.