User Interactive PostProcessing of Association Rules and Correlation based Redundancy Removal

Traditional association rule mining generates a large number of rules. This leads to a difficulty in finding the interested and significant rules. An efficient interactive post-processing task which includes ontology and rule schema is used to obtain user interesting rules. Correlation analysis finds significant association rules by analyzing the dependency between the antecedent and consequent parts of the rule. In this paper, correlation analysis is integrated with the interactive postprocessing to obtain significant user interesting rules. A redundancy removal follows this framework to weed out the extra rules and also to reduce the ruleset further. The proposed methodology provides a significant set of non-redundant user interesting rules leading to an efficient analysis.

[1]  Dimitrios Gunopulos,et al.  Constraint-Based Rule Mining in Large, Dense Databases , 2004, Data Mining and Knowledge Discovery.

[2]  Marcos Aurélio Domingues,et al.  Using Taxonomies to Facilitate the Analysis of the Association Rules , 2011, ArXiv.

[3]  Andrea Bellandi,et al.  Ontology-driven Association Rules Extraction: a Case of Study , 2007, C&O:RR.

[4]  Adriana Santarosa Vivacqua,et al.  From data to knowledge mining , 2009, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[5]  Jaideep Srivastava,et al.  Selecting the right objective measure for association analysis , 2004, Inf. Syst..

[6]  Daniel Xodo,et al.  Data Mining With Ontologies: Implementations, Findings and Frameworks , 2007 .

[7]  Dimitrios Gunopulos,et al.  Constraint-Based Rule Mining in Large, Dense Databases , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[8]  Lars Marius Garshol,et al.  Metadata? Thesauri? Taxonomies? Topic Maps! Making Sense of it all , 2004, J. Inf. Sci..

[9]  B. Shekar,et al.  A relatedness-based data-driven approach to determination of interestingness of association rules , 2005, SAC '05.

[10]  Ke Wang,et al.  Visually Aided Exploration of Interesting Association Rules , 1999, PAKDD.

[11]  Fabrice Guillet,et al.  Quality Measures in Data Mining , 2009, Studies in Computational Intelligence.

[12]  Heikki Mannila,et al.  Pruning and grouping of discovered association rules , 1995 .

[13]  Abraham Silberschatz,et al.  What Makes Patterns Interesting in Knowledge Discovery Systems , 1996, IEEE Trans. Knowl. Data Eng..

[14]  Philip S. Yu,et al.  A New Approach to Online Generation of Association Rules , 2001, IEEE Trans. Knowl. Data Eng..

[15]  Ramakrishnan Srikant,et al.  Mining generalized association rules , 1995, Future Gener. Comput. Syst..

[16]  Elena Baralis,et al.  Designing Templates for Mining Association Rules , 2004, Journal of Intelligent Information Systems.

[17]  Balaji Padmanabhan,et al.  Unexpectedness as a Measure of Interestingness in Knowledge Discovery , 1999, Decis. Support Syst..

[18]  Heikki Mannila,et al.  Finding interesting rules from large sets of discovered association rules , 1994, CIKM '94.

[19]  Xiangji Huang,et al.  Objective and subjective algorithms for grouping association rules , 2003, Third IEEE International Conference on Data Mining.