A Level Wise Tree Based Approach for Ontology-Driven Association Rules Mining
Dr. Mahesh Motwani Dr. J.L. Rana Dr R.C Jain, “Use of Domain Knowledge for Fast Mining of Association Rules,” Proceedings of the International Multi Conference of Engineers and Computer Scientists,Vol.1, IMECS, March 18 - 20, 2009, Hong Kong.
N. Rajkumar, M.R. Karthik, S.N. Sivananda, “Fast algorithm for mining multilevel association rules,” IEEE Trans. Knowledge and Data Eng., Vol. 2, pp. 688-692 , 2003.
R. Agrawal, T. Imielinski, A. Swami, Mining “Association Rules Between Sets of Items in Large Databases,” Proc. 1993 ACM SIGMOD Int‟l Conf. Management of Data, pp.207216, Washington, D.C., May 1993.
Yue XU, Gavin SHAW, Yuefeng LI, "Concise Representations for Association in Multilevel Datasets,"Systems Engineering Society of China & Springer-Verlag, vol.18 (1), pp.53-70, 2009. ISSN : 0975-3397 1704
H. Ravi Sankar, Dr. M.M. Naidu, “An Innovative Algorithm for mining multilevel association rules,” Proceeding of the 25th IASTED International multi-conference Artificial intelligence and applications February 12-14, 2007, Innsbruck Austria.
R.S. Thakur, R.C. Jain, K.R. Pardasani, “Fast Algorithms for Mining Multi-Level Association Rules in Large Databases”, in Asian Journal of Information Management, USA, 2007, Vol. 1(1):19-26.
R.S. Thakur, R.C. Jain, K.R. Pardasani, “MAXFP: A Multi-strategy Algorithm for Mining Maximum Frequent Pattern and their Support Counts”, in Trends in Applied Sciences Research, New York, 2006, Vol. 1(4): 402-415.
J. Han, J. Pei, and Y. Yin, .Mining Frequent patterns without candidate Generation,. Proceedings of the ACM SIGMOD, Dallas, TX, May 2000, pp.1-12.
R.S. Thakur, R.C. Jain, K.R. Pardasani, “Mining Level-Crossing Association Rules from Large Databases” in Journal of Computer Science, USA, 2006, 2(1):76-81.
J. Han, and Y. Fu, .Discovery of Multiple-Level Association Rules from Large Databases,. Proceedings of the VLDB, Zurich, Switzerland, 1995.
J. Han, J, Pei ,Y Yin. “Mining Frequent Patterns Without Candidate Generation,” In ACM SIGMOD Conf. Management of Data, May 2000.
Predrag Stanišić, Savo Tomović, "Apriori Multiple Algorithm for Mining Association Rules," 124X Information Technology and Control, vol.37, pp.311-320, 2008.
Xuan Zhou, James Geller” Raising, to Enhance Rule Mining in Web Marketing with the Use of an Ontology” Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07104-2007.
Hector Nigro ,“Data Mining with Ontologies: Implementation ,Finding and Frameworks” INCA/INTIA- Institute of Research on Advanced Informatics Technology ,ARGENTINA-book published in 2007.
Pauray S.M. and Chien-Ming “Mining interesting association rules from customer databases and transaction databases” , Elsevier June 2003.
B.Liu, Book-Web Data Mining, Springer- Data-Centric Systems and Applications, 2011.
Vivek Tiwari,Vipin Tiwari (June-2010),” Association Rule Mining- A Graph based approach for mining Frequent Itemsets” IEEE International Conference on Networking and Information Technology (ICNIT 2010) Manila, Philippines, IEEE Catalog Number:CFP1023K-PRT, ISBN:978-4244-7577-3.
Pratima Gautam and K. R. Pardasani,” A Fast Algorithm for Mining Multilevel Association Rule Based on Boolean Matrix” International Journal on Computer Science and Engineering(IJCSE) Vol. 02,2010
Pratima Gautam and K. R. Pardasani,” A model for mining multilevelfuzzy association rule in databse” JOURNAL OF COMPUTING, VOLUME 2, ISSUE 1, JANUARY 2010, ISSN 2151-9617
Pratima Gautam and K. R. Pardasani,” A novel approach for discovering multilevel fuzzy association rule mining” JOURNAL OF COMPUTING, VOLUME 2, ISSUE 3, MARCH 2010, ISSN 2151-9617
Pauray S.M. Tsai and Chien-Ming Chen “Mining interesting association rules from customer databases and transaction databases” Information system 2003 Elsevier.
R.Vishnu Priya, A.Vadivel, R.S.Thakur, “Frequent Pattern Mining using Modified CP-Tree for Knowledge Discovery”, Advanced Data Mining and Applications, LNCS-2010 volume 6440, pp. 254–261, © Springer-Verlag Berlin Heidelberg 2010.
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.