东南大学学报（英文版）2008，Vol.24Issue(3)：276-280,5.
Web紧密核的抽取和评价方法
Extracting and evaluating method of web dense cores
摘要
Abstract
This paper focuses on some key problems in web community discovery and link analysis. Based on the topic-oriented technology, the characteristics of a bipartite graph are studied. An x bipartite core set is introduced to more clearly define extracting ways. By scanning the topic subgraph to construct x bipartite graph and then prune the graph with i and j,an x bipartite core set, which is also the minimum element of a community, can be found. Finally, a hierarchical clustering algorithm is applied to many x bipartite core sets and the dendrogram of the community inner construction is obtained. The correctness of the constructing and pruning method is proved and the algorithm is designed. The typical datasets in the experiment are prepared according to the way in HITS (hypedink-induced topic seaich). Ten topics and four search engines are chosen and the returned results are integrated. The modularity, which is a measure of the strength of the community structure in the social network, is used to validate the efficiency of the proposed method. The experimental results show that the proposed algorithm is effective and efficient.关键词
紧密核/链接分析/层次聚类/模块化度量Key words
dense cores/link analysis/hierarchical clustering/modularity measure分类
信息技术与安全科学引用本文复制引用
杨楠,高洁,薛鸿鹄,刘秀德..Web紧密核的抽取和评价方法[J].东南大学学报（英文版）,2008,24(3):276-280,5.基金项目
The National Natural Science Foundation of China (No.60773216), the National High Technology Research and Development Pro-gram of China(863 Program) (No. 2006AA010109), the Natural Science Foundation of Renmin University of China (No. 06XNB052),Free Exploration Project (985 Project of Renmin University of China)(No.2131231). （No.60773216）
