We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Reseach Article

Mining Association Rules using Domain Ontology and Hefting

by A. Razia Sulthana, R. Subburaj
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 65 - Number 2
Year of Publication: 2013
Authors: A. Razia Sulthana, R. Subburaj
10.5120/10897-5821

A. Razia Sulthana, R. Subburaj . Mining Association Rules using Domain Ontology and Hefting. International Journal of Computer Applications. 65, 2 ( March 2013), 27-32. DOI=10.5120/10897-5821

@article{ 10.5120/10897-5821,
author = { A. Razia Sulthana, R. Subburaj },
title = { Mining Association Rules using Domain Ontology and Hefting },
journal = { International Journal of Computer Applications },
issue_date = { March 2013 },
volume = { 65 },
number = { 2 },
month = { March },
year = { 2013 },
issn = { 0975-8887 },
pages = { 27-32 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume65/number2/10897-5821/ },
doi = { 10.5120/10897-5821 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:17:37.724237+05:30
%A A. Razia Sulthana
%A R. Subburaj
%T Mining Association Rules using Domain Ontology and Hefting
%J International Journal of Computer Applications
%@ 0975-8887
%V 65
%N 2
%P 27-32
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

One of the major concerns in the field of knowledge discovery is the interestingness problem and the unreasonable number of association rules being mined. The past studies confirm that although a large number of rules are mined for each query, they do not seem to satisfy user's expectations. The methods already proposed in the literature like post-processing and algorithms to reduce itemsets and nonredundant rules do not always guarantee mining of interesting rules for the user. In conventional Data Mining, the usefulness of association rules is limited by the huge amount of delivered rules. In this paper we propose a new interactive approach 'Onto-Mine' to trim and filter the discovered rules. We propose to integrate user knowledge in association rule mining by combining Domain Ontology and interactive intelligence. First, we use Domain and Background Ontology with user knowledge and this interactive intelligence of Onto-Mine assists the user throughout the analyzing task and helps the user in selection of rules and also to revise the information that is proposed. Moreover ranking algorithm is used for retrieval of frequently accessed rules and the concept of privacy is enforced while mining. By applying the proposed approach the number of rules will be considerably reduced improving user productivity.

References
  1. Feyyad, U. M. 1996. Knowledge Discovery and Data Mining: Making Sense out of Data. Journal of IEEE Expert Magazine. Vol 11. Issue 5. Page 20-25.
  2. Jiawei Han. and Yongjian Fu. 1999. Mining Multiple Level Association Rules from Large Databases. IEEE Transactions on Knowledge and Data Engineering. Vol 11. Issue 5. Page 798-805.
  3. Argawal, R. and Imielinski, T. 1993. Mining Association Rules between Sets of Items in Large Databases. Proc ACMSIGMOD.
  4. Burdick, D. Calimlim, M. Flannick, J. Gehrke, J. and Yiu,T. 2005. Mafia: A Maximal Frequent Itemset Algotithm. IEEE Transactions on Knowledge and Data Engineering. Vol 17. No 11. Page 1490-1504.
  5. Qiang Yang. Jie Yin. Ling, C,X. Chen, T. 2003. Post Processing Decision Trees to Extract Actionable Knowledge. Third IEEE International Conference on Data Mining.
  6. Fabrizio Lamberti. Andrea Sanna and Claudio Demartini. 2009. A relation- based page rank algorithm for semantic web search engines. Vol 21. No 1. Page 123-136
  7. J. Li. On Optimal Rule Discovery. 2006. IEEE Transactions on Knowledge and Data Engineering. vol 18. no 4. Page 460-471.
  8. Chien-Le Goh. Tsukamoto, M. Nishio, S. 1996. Knowledge discovery in deductive databases with large deduction results: the first step. IEEE Transactions on Knowledge and Data Engineering. Vol 8. Issue 6. Page 952-956
  9. Bing Liu. Wynne Hsu. Lai-Fun Mun. and Hing_Yan Lee. 1999. Finding Interesting Patterns Using User Expectations. IEEE Transactions on Knowledge and Data Engineering. Vol 11. No 6. Page 811-831.
  10. E. R. Omiecinski. Alternative Interest Measures for Mining Associations in Databases. IEEE Trans. Knowledge and Data Engineering. Vol 15. No 1. Page 57-69.
  11. Zhang Hong. Zhang Bo. Kong Ling-Dong. Cai Zheng Xing. 2001. Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing.
  12. Jen-Wei Huang. Chi-Yao Tseng. Jian-Chih Ou. Ming-Syan Chen. 2008. A General Model for Sequential Pattern Mining with a Progressive Database. IEEE Transactions on Knowledge and Data Engineering. Vol 20. Issue 9. Page 1153-1167.
  13. Silberschatz, A. Tuzhilin, A. 1996. What Makes Patterns Interesting in Knowledge Discovery Systems. IEEE Transactions on Knowledge and Data Engineering. Vol 8. No 6. Page 970-974.
  14. M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen. and A,I,Verkamo. 1994. Finding Interesting Rules from Large Sets of Discovered Association Rules. Proc. Int'l Conf. Information and Knowledge Management (CIKM). Page 401-407.
  15. Karin Koogan Breitman. 2003. Ontology as a Requirements Engineering Product. IEEE International Requirements Engineering Conference. Page 309-319.
  16. H. Nigro. S,G, Cisaro. and D. Xodo. 2007. Data Mining with Ontologies: Implementations, Findings and Frameworks. Idea Group, Inc. , 2007.
  17. R, Srikant. and R, Agrawal. 1995. Mining Generalized Association Rules. Proc. 21st Int'l Conf. Very Large Databases. Page 407-419.
  18. N, Guarino. 1998. Formal Ontology in Information Systems. Proc. First Int'l Conf. Formal Ontology in Information Systems. Page 3-15.
  19. Ding Pan. Yan Pan. 2006. Using ontology repository to support data mining. Proc of the 6th world congress on intelligent control and automation.
Index Terms

Computer Science
Information Sciences

Keywords

Association Rule Colander FP Tree Hefting item set Onto-Mine Knowledge Discovery Post mining