International Journal of Computer
Trends and Technology

Research Article | Open Access | Download PDF

Volume 3 | Issue 5 | Year 2012 | Article Id. IJCTT-V3I5P101 | DOI : https://doi.org/10.14445/22312803/IJCTT-V3I5P101

A Study on Post mining of Association Rules Targeting User Interest

P. Sarala, S. Jayaprada

Citation :

P. Sarala, S. Jayaprada, "A Study on Post mining of Association Rules Targeting User Interest," International Journal of Computer Trends and Technology (IJCTT), vol. 3, no. 5, pp. 663-669, 2012. Crossref, https://doi.org/10.14445/22312803/IJCTT-V3I5P101

Abstract

Association Rule Mining means discovering interesting patterns with in large databases. Association rules are used in many application areas such as market base analysis, web log analysis, protein substructures. Several post processing methods were developed to reduce the number of rules using nonredundant rules or pruning techniques such as pruning, summarizing, grouping or visualization based on statistical information in the database. As such, problem of identifying interest rules remind the same. Methods such as Rule deductive method, Stream Mill Miner (SMM), a DSMS (Data Stream Management Systems), Medoid clustering technique (PAM: Partitioning around medoids), Constraint-based Multi-level Association Rules with an ontology support were developed but are not effective. The number of rules generated by Apriori, FPgrowth depends on statistical measures such as support, confidence and may not suit the requirements of user. Methods that use ranking algorithm and IRF (Item Relatedness Filter) have the drawbacks of using filters during pruning stage. The paper studies methods that were proposed for post processing of association rules and proposes a new method for extracting association rules based on user interest using MIRO (Mining Interest Rules Using Ontologies) framework that uses correlation measures combined with domain ontology, succint constraints.

Keywords

Association Rules, Association Rule Mining, Ontology, correlation measures, user constraints.

References

[1] A. 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.
[2] A.Razia Sulthana B.Murugeswari, “ ARIPSO : Association Rule Interactive Postmining Using Schemas And Ontologies” , PROCEEDINGS OF ICETECT 2011 IEEE.
[3] [Anyanwu and Sheth, 2003] Anyanwu, K. and Sheth, A. (2003). ρQueries: Enabling Querying for Semantic Associations on the Semantic Web. In WWW ’03: Proceedings of the 12th international conference on World Wide Web, pages 690–699, New York, NY, USA. ACM Press.
[4]. Berka, P., Bruha, I.: Discretization and grouping: Preprocessing steps for data mining. In: Zytkow, J.M. (ed.) PKDD 1998. LNCS, vol. 1510, pp. 239245. Springer, Heidelberg (1998)
[5]. Blanchard J, Guillet F, Gras R, Briand H (2005) Using informationtheoretic measures to assess association rule interestingness. In: Proceeding of the 2005 international conference on data mining (ICDM’05), Houston, TX, pp 66–73
[6] [Bloehdorn and Sure, 2007] Bloehdorn, S. and Sure, Y. (2007). Kernel Methods for Mining Instance Data in Ontologies. In Aberer, K., Choi, K.-S., and Noy, N., editors, Proceedings of the 6th International Semantic Web Conference (ISWC 2007), Lecture Notes in Computer Science. Springer. to appear.
[7] D.Narmadha1, G.NaveenSundar2, S.Geetha3, “An Efficient Approach to Prune Mined Association Rules in Large Databases”, IJCSI International Journal of Computer Science Issues, Vol. 8, Issue 1, January 2011.
[8] [Getoor and Licamele, 2005] Getoor, L. and Licamele, L. (2005). Link Mining for the Semantic Web, Position Statement. In Proceedings of the Dagstuhl Seminar in Machine Learning for the Semantic Web.
[9]. Gionis A,Mannila H, Mielikäinen T, Tsaparas P (2006) Assessing data mining results via swap randomization. In: Proceeding of the 2006 ACM SIGKDD international conference on knowledge discovery in databases (KDD’06), Philadelphia, PA, pp 167–176
[10] Hetal Thakkar, Barzan Mozafari, Carlo Zaniolo. Continuous Post-Mining of Association Rules in a Data Stream Management System. Chapter VII in Post-Mining of Association Rules: Techniques for Effective Knowledge Extraction, Yanchang Zhao; Chengqi Zhang; and Longbing Cao (eds.), ISBN: 978-1-60566-404-0.
[11]. http://electronics.shop.ebay.in/
[12] [Jiang and Tan, 2006] Jiang, T. and Tan, A.-H. (2006). Mining RDF Metadata for Generalized Association Rules: Knowledge Discovery in the Semantic Web Era. In WWW ’06: Proceedings of the 15th international conference on World Wide Web, pages 951–952, New York, NY, USA. ACM Press.
[13]. 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.
[14]. Srikant, R., Agrawal, R.: Mining generalized association rules. In: VLDB 1995: Proceedings of the 21th International Conference on Very Large Data Bases, pp. 407–419. Morgan Kaufmann Publishers Inc., San Francisco (1995)
[15] Wenxiang Dou, Jinglu Hu, Gengfeng Wu, “Interesting Rules Mining with Deductive Method”, ICROS-SICE International Joint Conference 2009.
[16]. Xin D, Shen X, Mei Q, Han J (2006) Discovering interesting patterns through user’s interactive feedback. In: Proceeding of the 2006 ACM SIGKDD international conference on knowledge discovery in databases (KDD’06), Philadelphia, PA, pp 773–778
[17] Xuan-Hiep Huynh, Fabrice Guillet and Henri Briand, “Extracting representative measures for the post-processing of association rules”, 2006