The week's pick
Reseach Article
User Interactive PostProcessing of Association Rules and Correlation based Redundancy Removal
| International Conference in Recent trends in Computational Methods, Communication and Controls |
| Foundation of Computer Science USA |
| ICON3C - Number 3 |
| April 2012 |
| Authors: C. Sweetlin, V. Kalaivani |
| 14e5ff1b-aab7-4516-a893-b8dfb0ee7e91 |
C. Sweetlin, V. Kalaivani . User Interactive PostProcessing of Association Rules and Correlation based Redundancy Removal. International Conference in Recent trends in Computational Methods, Communication and Controls. ICON3C, 3 (April 2012), 31-35.
Abstract
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 post-processing 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
References
- F. Guillet and H. Hamilton, Quality Measures in Data Mining. Springer, 2007.
- P. -N. Tan, V. Kumar, and J. Srivastava, "Selecting the Right Objective Measure for Association Analysis," Information Systems, vol. 29, pp. 293-313, 2004.
- Silberschatz and A. Tuzhilin, "What Makes Patterns Interesting in Knowledge Discovery Systems," IEEE Trans. Knowledge and Data Eng. vol. 8, no. 6, pp. 970-974, Dec. 1996.
- M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen, and A. I. Verkamo, "Finding Interesting Rules from Large Sets of Discovered Association Rules," Proc. Int'l Conf. Information and Knowledge Management (CIKM), pp. 401-407, 1994.
- Baralis and G. Psaila, "Designing Templates for Mining Association Rules," J. Intelligent Information Systems, vol. 9, pp. 7-2, 1997.
- Liu, W. Hsu, K. Wang, and S. Chen, "Visually Aided Exploration of Interesting Association Rules," Proc. Pacific-Asia Conf. Knowledge Discovery and Data Mining (PAKDD), pp. 380-389, 1999.
- B. Padmanabhan and A. Tuzhuilin, "Unexpectedness as a Measure of Interestingness in Knowledge Discovery," Proc. Workshop Information Technology and Systems (WITS), pp. 81-90, 1997
- An, S. Khan, and X. Huang, "Objective and Subjective Algorithms for Grouping Association Rules," Proc. Third IEEE Int'l Conf. Data Mining (ICDM '03), pp. 477-480, 2003.
- H. Nigro, S. G. Cisaro, and D. Xodo, Data Mining with Ontologies: Implementations, Findings and Frameworks. Idea Group, Inc. , 2007.
- R. Srikant and R. Agrawal, "Mining Generalized Association Rules," Proc. 21st Int'l Conf. Very Large Databases, pp. 407-419, 1995.
- H. Toivonen, M. Klemettinen, P. Ronkainen, K. Hatonen, and H. Mannila, "Pruning and Grouping of Discovered Association Rules," Proc. ECML-95 Workshop Knowledge Discovery in Databases, pp. 47-52, 1995.
- Charu C. Agrarian and Philip S. Yu, "A new Approach to Online Generation of Association Rules". IEEE TKDE, Vol. 13, No. 4 pages 527- 540.
- Bing Liu, Wynne Hsu and Yiming Ma, "Pruning and Summarize the Discovered Associations". In the proc. of ACM SIGMOD pp. 125 134, San Diego, CA, August 1999.
- L. M. Garshol, "Metadata? Thesauri? Taxonomies? Topic Maps Making Sense of It All," J. Information Science, vol. 30, no. 4, pp. 378-391, 2004.
- M. A. Domingues and S. A. Rezende, "Using Taxonomies to Facilitate the Analysis of the Association Rules," Proc. Second Int'l Workshop Knowledge Discovery and Ontologies, held with ECML/ PKDD, pp. 59-66, 2005.
- Bellandi, B. Furletti, V. Grossi, and A. Romei, "Ontology- Driven Association Rule Extraction: A Case Study," Proc. Workshop Context and Ontologies: Representation and Reasoning, pp. 1-10, 2007.
- R. Natarajan and B. Shekar, "A Relatedness-Based Data-Driven Approach to Determination of Interestingness of Association Rules," Proc. 2005 ACM Symp. Applied Computing (SAC), pp. 551- 552, 2005.
- A. C. B. Garcia and A. S. Vivacqua, "Does Ontology Help Make Sense of a Complex World or Does It Create a Biased Interpretation?" Proc. Sense making Workshop in CHI '08 Conf. Human Factors in Computing Systems, 2008.
- A. C. B. Garcia, I. Ferraz, and A. S. Vivacqua, "From Data to Knowledge Mining," Artificial Intelligence for Eng. Design, Analysis and Manufacturing, vol. 23, pp. 427-441, 2009.
- Bayardo, R. , Agrawal, R, and Gunopulos, D. "Constraint-based rule mining in large, dense databases. "To appear in ICDE-99, 1999.
- Knowledge-Based Interactive Postmining of association rules using ontologies and rule schemas IEEE Transactions on knowledge and data engineering, VOL. 22, NO. 6, JUNE 2010.
- Pruning and Summarizing the Discovered Associations ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD-99), August 15-18, 1999, San Diego, CA, USA.
Index Terms
Keywords