An Intelligent Personalized Learning Model Based on Community Discovery Method

Article Preview

Abstract:

In this paper, we proposed a model of support personalized learning based on SGCL (Social Group Collaborative Learning System). In the model, we provide two algorithms to discover knowledge communities. Based on the community discovery result and system recommendation policy, we give our user the recommendation suggestions to help them to construct their personalized knowledge structure. The paper mainly introduce these algorithms, the AG algorithm based on aggregation and the KC algorithm based on K-Clique model, which are algorithms to discover knowledge communities in SGCL.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

248-251

Citation:

Online since:

December 2010

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] West D B: Introduction to Graph Theory [M]. Prentice Hall, Upper Saddle River, (2001).

Google Scholar

[2] Kernighan B W, Lin S: An efficient heuristic procedure for partitioning graphs [J]. Bell Systems Technical Journal, 1970. 49(2):, p.291~307.

DOI: 10.1002/j.1538-7305.1970.tb01770.x

Google Scholar

[3] Fiedler M: Algebraic connectivity of graphs [J]. Czechoslovak Mathematical Journal, 1973, 23(98), p.298~305.

DOI: 10.21136/cmj.1973.101168

Google Scholar

[4] Pothen A, Simon H, Liou K P: Partitioning sparse matrices with eigenvectors of graphs [J]. SIAM Journal on Matrix Analysis and Applications. 1990. 11(3), p.430~452.

DOI: 10.1137/0611030

Google Scholar

[5] Girvan M, Newman M E J: Community structure in social and biological networks [J]. Proc Natl Acad Sci, 2001, 99(12), pp.7821-7826.

DOI: 10.1073/pnas.122653799

Google Scholar