CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Mining Association Rules with Static and Dynamic Behavior of Learner in the Internet

by Dr. R. Siva Rama Prasad, D. Bujji Babu
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 37 - Number 4
Year of Publication: 2012
Authors: Dr. R. Siva Rama Prasad, D. Bujji Babu
10.5120/4598-6556

Dr. R. Siva Rama Prasad, D. Bujji Babu . Mining Association Rules with Static and Dynamic Behavior of Learner in the Internet. International Journal of Computer Applications. 37, 4 ( January 2012), 26-30. DOI=10.5120/4598-6556

@article{ 10.5120/4598-6556,
author = { Dr. R. Siva Rama Prasad, D. Bujji Babu },
title = { Mining Association Rules with Static and Dynamic Behavior of Learner in the Internet },
journal = { International Journal of Computer Applications },
issue_date = { January 2012 },
volume = { 37 },
number = { 4 },
month = { January },
year = { 2012 },
issn = { 0975-8887 },
pages = { 26-30 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume37/number4/4598-6556/ },
doi = { 10.5120/4598-6556 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:23:27.309611+05:30
%A Dr. R. Siva Rama Prasad
%A D. Bujji Babu
%T Mining Association Rules with Static and Dynamic Behavior of Learner in the Internet
%J International Journal of Computer Applications
%@ 0975-8887
%V 37
%N 4
%P 26-30
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Now a days several Number of users are depending on internet to do their routine tasks, because the world wide web providing several services required to the people. Here the main problem is the internet environment providing huge number of services so we need to find the behavior of the user in various dimensions. First we performed a study on static model of the learner. Second we performed a study on dynamic model of the learner. In general the Association rules are extracted from the market basket analysis problem with using the apriori algorithm. Here we concentrated mainly on the unification process and apriori algorithm was improved and we experimented the internet based learning and we present the experimental results.

References
  1. IEEE Learning Technology Standards Committee(LTSC), IEEE 1484.2 “PAPI Learner Model”
  2. E.V.Wilson,Students characteristics and computer-mediated communication, Computers & Education ,2003(34),67-76
  3. E.B.Kim, The role of personality in Web-based distance education courses Communications of the ACM,Volume 47, Issue 3 March 2004
  4. Jiawei Han,Micheline Kamber,Data Mining : Concepts and Techniques, Morgan kaufman publishers.2001.
  5. The Comparative of Boolean Algebra Compress and Apriori Rule Techniques for New Theoretic Association Rule Mining Model. Somboon Anekritmongkol, Kulthon Kasamsan International Journal of Advancements in Computing Technology, Volume 3, Number 1, February 2011.
  6. An Enhanced Scaling Apriori for Association
  7. Rule Mining Efficiency European Journal of Scientific Research
  8. ISSN 1450-216X Vol.39 No.2 (2010), pp.257-264
  9. Agrawal R, H. Mannila, R. Srikant, H. Toivonen, and A.Verkamo. “Fast discovery of association rules. Advances in Knowledge Discovery and Data Mining, San Jose, CA, pages 307-328, 1996.
  10. Agrawal R, T. Imielinski, and A. Swami. “Mining association rules between sets of items in large databases”. Proc. of the ACM SIGMOD Washington, D.C, pages 207-216, May 1993.
  11. Alok Sharma, and Kuldip K. Paliwal, “Rotational Linear Discriminant Analysis Technique forDimensionality Reduction”, IEEE Transactions on Knowledge and Data Engineering, Vol. 20, No. 10, October 2008.
  12. Anthony K.H. Tung, Hongjun Lu, Jiawei Han, Member, and Ling Feng, “Efficient Mining of Inter transaction Association Rules” IEEE Transactions on Knowledge and Data Engineering,Vol. 15, No.1,January/February’03.
  13. Bodon.F, “ A Survey on Frequent Itemset Mining”, Technical report, Budapest Univ. Of Technology and Economics,2006.
  14. Cheung D, V.T Ng, A. Fu, and Y.Fu. “Efficient mining of association rules in distributed databases”. IEEE Trans. Knowledge and Data Engineering, pp 1-23, 1996.
  15. Elena Baralis, Tania Cerquitelli, and Silvia Chiusano, “IMine: Index Support for Item SetMining”, IEEE Transactions on Knowledge and Data Engineering, Vol. 21, No. 4, April 2009.
  16. Ghosh, A. and S. Dehuri, “Evolutionary algorithms for multi-criterion optimization: A survey”
  17. . International Journal on Computers and Infromation Science, 2: 38–57, 2004.
Index Terms

Computer Science
Information Sciences

Keywords

Association rule Static learning dynamic learning unification process

Powered by PhDFocusTM