The Application and Research of Personalized Network Teaching Resources Database Based on Data Mining

Article Preview

Abstract:

The key of the network teaching system is how to provide appropriate teaching resources and adopt different teaching strategies according to different users. In this paper, data mining is used in network teaching system, and builds a personalized network resources database. According to the information of the user, find the relevant rules and provide the learning resources for each learner to adapt to their needs. The results demonstrate that this proposed approach for improving the level of personalized service in network teaching system is effective.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 756-759)

Pages:

2475-2478

Citation:

Online since:

September 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Erica Melis, Eric Andr'es, Jochen Budenbender. ActiveMath: A generic and adaptive web-based learning environment artificial intelligence in education, vol. 12, No 4, (2001).

Google Scholar

[2] Jiawei Han,Mieheline Kamber.Data Mining:Concept and Techniques.Morgan Kaufmann publishers,inc.(2000).

Google Scholar

[3] Jiawei Han, Micheline Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers. Inc, (2001).

Google Scholar

[4] Penelope Markellou, Loanna Mousourouli. Using semantic web mining technologies for personalized E-Learning experiences. Research Academic computer technology institute, (2004).

Google Scholar

[5] Huang Liusheng,Chen Huaping,Wang Xun , Chen Guoliang. A Fast Algorithm for Mining Association Rules[J]. J. Comput. Sci. &Techno, 2000, 15(6): 619-624.

DOI: 10.1007/bf02948845

Google Scholar

[6] Jian Pei, Jiawei Han, Laks V.S. Lakshmanan. Mining Frequent Itemsets with Convertible Constraints[C]. in the Proceedings of 2001 IEEE International Conference on Data Engineering (ICDE'01), Heidelberg, Germany, 2001: 433-332.

DOI: 10.1109/icde.2001.914856

Google Scholar

[7] J. Han, H. Pei, and Y. Yin. Mining Frequent Patterns without Candidate Generation[C]. In: Proc. Conf. on the Management of Data (SIGMOD'00, Dallas, TX). ACM Press, New York, NY, USA , 2000: 1-1.

DOI: 10.1145/342009.335372

Google Scholar