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.
CITATION STYLE
Kryszkiewicz, M. (1998). Fast discovery of representative association rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1424, pp. 214–222). Springer Verlag. https://doi.org/10.1007/3-540-69115-4_30
Mendeley helps you to discover research relevant for your work.