Balancing the analysis of frequent patterns

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A main challenge in pattern mining is to focus the discovery on high-quality patterns. One popular solution is to compute a numerical score on how well each discovered pattern describes the data. The best rating patterns are then the most analyzed by the data expert. In this paper, we evaluate the quality of discovered patterns by anticipating of how user analyzes them. We show that the examination of frequent patterns with the notion of support led to an unbalanced analysis of the dataset. Certain transactions are indeed completely ignored. Hence, we propose the notion of balanced support that weights the transactions to let each of them receive user specified attention. We also develop an algorithm Absolute for calculating these weights leading to evaluate the quality of patterns. Our experiments on frequent itemsets validate its effectiveness and show the relevance of the balanced support. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Giacometti, A., Li, D. H., & Soulet, A. (2014). Balancing the analysis of frequent patterns. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8443 LNAI, pp. 53–64). Springer Verlag. https://doi.org/10.1007/978-3-319-06608-0_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free