| Extracting the Cores of Implicit Communities |
| |
| 作者姓名： | YANG Nan LIN Songxiang GAO Qiang |
| |
| 作者单位： | School of Information, Renmin University of China, Beijing 100872, China |
| |
| 基金项目： | Supported by the Natural Science Fund of Renmin University of China （30207108） |
| |
| 摘 要： | In this paper, we improve the trawling and point out some communities missed by trawling. We use the DBG （Dense Bipartite Graph） to identify a structure of a potential community instead of CBG （Complete Bipartite Graph）. Based on DBG, we proposed a new method based on edge removal to extract cores from a web graph. Moreover, we improve the crawler to save only potential pages as fans of a core and save a lot of disk storage space. To evaluate the set of cores whether or not belong to a community, the statistics of term frequency is used. In the paper, the dataset of experiment were crawled under domain ＂.cn＂. The result show that the our algorithm works properly and some new cores can be found by our method.
|
| 关 键 词： | 网络社区 链接分析 密集双向图表 存储空间 |
| 文章编号： | 1007-1202（2007）05-0783-06 |
| 收稿时间： | 25 January 2007 |
| 修稿时间： | 2007-01-25 |
Extracting the cores of implicit communities |
| |
| YANG Nan LIN Songxiang GAO Qiang.Extracting the Cores of Implicit Communities[J].Wuhan University Journal of Natural Sciences,2007,12(5):783-788. |
| |
| Authors: | Yang Nan Lin Songxiang Gao Qiang |
| |
| Institution: | (1) School of Information, Renmin University of China, Beijing, 100872, China |
| |
| Abstract: | In this paper, we improve the trawling and point out some communities missed by trawling. We use the DBG (Dense Bipartite
Graph) to identify a structure of a potential community instead of CBG (Complete Bipartite Graph). Based on DBG, we proposed
a new method based on edge removal to extract cores from a web graph. Moreover, we improve the crawler to save only potential
pages as fans of a core and save a lot of disk storage space. To evaluate the set of cores whether or not belong to a community,
the statistics of term frequency is used. In the paper, the dataset of experiment were crawled under domain “.cn”. The result
show that the our algorithm works properly and some new cores can be found by our method.
Biography: YANG Nan(1962–), male, Associate professor, research interest: Web data mining, Web searching. |
| |
| Keywords: | Web community link analysis dense bipartite graph |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
