Discovering small-world in association link networks for association learning

被引:14
作者
Zhang, Shunxiang [1 ,2 ,3 ]
Luo, Xiangfeng [1 ,2 ]
Xuan, Junyu [1 ,2 ]
Chen, Xue [1 ,2 ]
Xu, Weimin [1 ,2 ]
机构
[1] Shanghai Univ, Sch Comp Engn & Sci, Shanghai 200072, Peoples R China
[2] Shanghai Univ, Ctr High Performance Comp, Shanghai 200072, Peoples R China
[3] Anhui Univ Sci & Technol, Sch Comp Sci & Engn, Huainan 232001, Peoples R China
来源
WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS | 2014年 / 17卷 / 02期
基金
美国国家科学基金会;
关键词
semantic network; association link network; small-world; association learning;
D O I
10.1007/s11280-012-0171-7
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Association Link Network (ALN) is a kind of Semantic Link Network built by mining the association relations among multimedia Web resources for effectively supporting Web intelligent application such as Web-based learning, and semantic search. This paper explores the Small-World properties of ALN to provide theoretical support for association learning (i.e., a simple idea of "learning from Web resources"). First, a filtering algorithm of ALN is proposed to generate the filtered status of ALN, aiming to observe the Small-World properties of ALN at given network size and filtering parameter. Comparison of the Small-World properties between ALN and random graph shows that ALN reveals prominent Small-World characteristic. Then, we investigate the evolution of Small-World properties over time at several incremental network sizes. The average path length of ALN scales with the network size, while clustering coefficient of ALN is independent of the network size. And we find that ALN has smaller average path length and higher clustering coefficient than WWW at the same network size and network average degree. After that, based on the Small-World characteristic of ALN, we present an Association Learning Model (ALM), which can efficiently provide association learning of Web resources in breadth or depth for learners.
引用
收藏
页码:229 / 254
页数:26
相关论文
共 32 条
  • [1] Adamic LA, 1999, LECT NOTES COMPUT SC, V1696, P443
  • [2] Statistical mechanics of complex networks
    Albert, R
    Barabási, AL
    [J]. REVIEWS OF MODERN PHYSICS, 2002, 74 (01) : 47 - 97
  • [3] Internet -: Diameter of the World-Wide Web
    Albert, R
    Jeong, H
    Barabási, AL
    [J]. NATURE, 1999, 401 (6749) : 130 - 131
  • [4] BRIN S, 1998, P 7 WWW
  • [5] Graph structure in the Web
    Broder, A
    Kumar, R
    Maghoul, F
    Raghavan, P
    Rajagopalan, S
    Stata, R
    Tomkins, A
    Wiener, J
    [J]. COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, 2000, 33 (1-6): : 309 - 320
  • [6] An interactive service customization model
    Cao, J
    Wang, J
    Law, K
    Zhang, SS
    Li, ML
    [J]. INFORMATION AND SOFTWARE TECHNOLOGY, 2006, 48 (04) : 280 - 296
  • [7] Chakrabarti S., 1998, P 7 WWW
  • [8] An adaptive caching strategy for m-learning based on SCORM Sequencing and Navigation
    Chang, Hsuan Pu
    Shih, Timothy K.
    Li, Qing
    Wang, Chun-Chia
    Wang, Te-Hua
    Chao, Louis R.
    [J]. WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2008, 11 (03): : 387 - 406
  • [9] Chen J, 2005, WORLD WIDE WEB, V8, P377, DOI 10.1007/s11280-00S-1319-5
  • [10] Dijkstra E. W., 1959, NUMER MATH, V1, P269