A Concise Representation of Association Rules Using Minimal Predictive Rules
Abstract
Association rule mining is an important branch of data mining research that aims to extract important relations from data. In this paper, we develop a new framework for mining association rules based on minimal predictive rules (MPR). Our objective is to minimize the number of rules in order to reduce the information overhead, while preserving and concisely describing the important underlying patterns. We develop an algorithm to efficiently mine these MPRs. Our experiments on several synthetic and UCI datasets demonstrate the advantage of our framework by returning smaller and more concise rule sets than the other existing association rule mining methods.
Cite
Text
Batal and Hauskrecht. "A Concise Representation of Association Rules Using Minimal Predictive Rules." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2010. doi:10.1007/978-3-642-15880-3_12Markdown
[Batal and Hauskrecht. "A Concise Representation of Association Rules Using Minimal Predictive Rules." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2010.](https://mlanthology.org/ecmlpkdd/2010/batal2010ecmlpkdd-concise/) doi:10.1007/978-3-642-15880-3_12BibTeX
@inproceedings{batal2010ecmlpkdd-concise,
title = {{A Concise Representation of Association Rules Using Minimal Predictive Rules}},
author = {Batal, Iyad and Hauskrecht, Milos},
booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
year = {2010},
pages = {87-102},
doi = {10.1007/978-3-642-15880-3_12},
url = {https://mlanthology.org/ecmlpkdd/2010/batal2010ecmlpkdd-concise/}
}