Discovering Conditional Functional Dependencies
||International Journal of Computer Trends and Technology (IJCTT)||
|© - Issue 2012 by IJCTT Journal|
|Year of Publication : 2012|
|Authors :Swathi Mutyala, Aaluri Seenu.|
Swathi Mutyala, Aaluri Seenu."Discovering Conditional Functional Dependencies"International Journal of Computer Trends and Technology (IJCTT),V3(5):521-524 Issue 2012 .ISSN 2231-2803.www.ijcttjournal.org. Published by Seventh Sense Research Group.
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.
 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.
 A.Razia Sulthana B.Murugeswari, “ ARIPSO : Association Rule Interactive Postmining Using Schemas And Ontologies” , PROCEEDINGS OF ICETECT 2011 IEEE.
 [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.
. Berka, P., Bruha, I.: Discretization and grouping: Preprocessing steps for data mining. In: Zytkow, J.M. (ed.) PKDD 1998. LNCS, vol. 1510, pp. 239– 245. Springer, Heidelberg (1998).
KeywordsAssociation Rules, Association Rule Mining, Ontology, correlation measures, user constraints.