Association mining is the comprehensive identification of frequent patterns in discrete tabular data. The result of association mining can be a listing of hundreds to millions of patterns, of which few are likely of interest. In this paper we present a probabilistic metric to filter association rules that can help highlight the important structure in the data. The proposed filtering technique can be combined with maximal association mining algorithms or heuristic association mining algorithms to more efficiently search for interesting association rules with lower support.
CITATION STYLE
Ableson, A., & Glasgow, J. (2003). Efficient statistical pruning of association rules. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2838, pp. 23–34). Springer Verlag. https://doi.org/10.1007/978-3-540-39804-2_5
Mendeley helps you to discover research relevant for your work.