Post-processing Association Rules: A Network Based Label Propagation Approach

• Published in: SOFSEM 2016: Theory and Practice of Computer Science pp. 580 - 591
• Main Authors: de Padua, Renan, de Carvalho, Veronica Oliveira, Rezende, Solange Oliveira
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2016
• Series: Lecture Notes in Computer Science
• Subjects: Association Rules; Interesting Rules; Label Propagation Algorithm; Local And Global Consistency (LLGC); Post-processing Approach
• ISBN: 9783662491911; 3662491915
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-662-49192-8_47

Association rules are widely used to find relations among items in a given database. However, the amount of generated rules is too large to be manually explored. Traditionally, this task is done by post-processing approaches that explore and direct the user to the interesting rules. Recently, the user’s knowledge has been considered to post-process the rules, directing the exploration to the knowledge he considers interesting. However, sometimes the user wants to explore the rule set without adding his prior knowledge BIAS, exploring the rule set according to its features. Aiming to solve this problem, this paper presents an approach, named \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$PAR_{LP}$$\end{document} (Post-processing Association Rules using Label Propagation), that explores the entire rule set, suggesting rules to be classified by the user as “Interesting” or “Non-Interesting”. In this way, the user is directed to analyze the rules that have some importance on the rule set, so the user does not need to explore the entire rule set. Moreover, the user’s classification is propagated to all the rules using label propagation approaches, so the most similar rules will likely be on the same class. The results show that the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$PAR_{LP}$$\end{document} succeeds to direct the exploration to a set of rules considered interesting, reducing the amount of association rules to be explored.