Identification of Web Communities using Cellular Learning Automata

被引:0
作者
Motiee, S. [1 ]
Meybodi, M. R. [1 ]
机构
[1] Amirkabir Univ Technol, Comp Engn & Informat Technol Dept, Soft Comp Lab, Tehran, Iran
来源
2009 14TH INTERNATIONAL COMPUTER CONFERENCE | 2009年
关键词
Web Mining; Web Community; Cellular Learning Automata; HITS Algorithm; Web Usage Data;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A collection of web pages which are about a common topic and are created by individuals or any kind of associations that have a common interest on that specific topic is called a web community. Since at present, the size of the web is over 3 billion pages and it is still growing very fast, identification of web communities has become an increasingly hard task. In this paper, a method based on asynchronous cellular learning automata (ACLA) for identification of web communities is proposed. In the proposed method first an asynchronous cellular learning automaton is used to determine the related pages and their relevance degree (the relationship structure of web pages). For determination of relationship structure of web pages information about hyperlinks and the users' behaviour in visiting the web pages are used. Then, an algorithm similar to the HITS algorithm is applied on the obtained structure to identify the web communities. One of the advantages of the proposed method is that the web community obtained using this method is not dependent on a specific web graph structure. To evaluate the proposed approach, it is implemented and the results are compared with the results obtained for two existing methods, HITS and a complete bipartite graph based method. Experimental results show the superiority of the proposed method.
引用
收藏
页码:552 / 562
页数:11
相关论文
共 17 条
[1]  
[Anonymous], 1998, P ACM SIAM S DISCR A
[2]   A mathematical framework for cellular learning automata [J].
Beigy, H ;
Meybodi, MR .
ADVANCES IN COMPLEX SYSTEMS, 2004, 7 (3-4) :295-319
[3]  
BEIGY H, 2007, ADV COMPLEX SYST, V10, P1
[4]   Asynchronous cellular learning automata [J].
Beigy, Hamid ;
Meybodi, M. R. .
AUTOMATICA, 2008, 44 (05) :1350-1357
[5]  
CHEN XX, 2004, P IEEE WIC ACM INT C
[6]  
Flake G. W., 2000, Proceedings. KDD-2000. Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, P150, DOI 10.1145/347090.347121
[7]   Self-organization and identification of web communities [J].
Flake, GW ;
Lawrence, S ;
Giles, CL ;
Coetzee, FM .
COMPUTER, 2002, 35 (03) :66-+
[8]  
Gibson D., 1998, PROC HYPERTEXT, P225, DOI DOI 10.1145/276627.276652
[9]  
IMAFUJI N, 2002, P 4 INT WORKSH WEB I, P43
[10]   REVERSIBILITY OF 2D CELLULAR AUTOMATA IS UNDECIDABLE [J].
KARI, J .
PHYSICA D, 1990, 45 (1-3) :379-385