Extracting and evaluating method of web dense cores

作     者：杨楠 高洁 薛鸿鹄 刘秀德 Yang Nan;Gao Jie;Xue Honghu;Liu Xiude

作者机构：中国人民大学信息学院北京100872 

基　　金：The National Natural Science Foundation of China(No.60773216) the National High Technology Research and Development Program of China(863Program)(No.2006AA010109) the Natural Science Foundation of Renmin University of China(No.06XNB052) Free Exploration Project(985 Project of Renmin University of China)(No.21361231) 

出 版 物：《Journal of Southeast University(English Edition)》 (东南大学学报（英文版）)

年 卷 期：2008年第24卷第3期

页      码：276-280页

摘      要：This paper focuses on some key problems in web community discovery and link *** on the topic-oriented technology,the characteristics of a bipartite graph are *** Х bipartite core set is introduced to more clearly define extracting *** scanning the topic subgraph to construct Х bipartite graph and then prune the graph with i and j ,an Х bipartite core set,which is also the minimum element of a community,can be ***,a hierarchical clustering algorithm is applied to many Х bipartite core sets and the dendrogram of the community inner construction is *** correctness of the constructing and pruning method is proved and the algorithm is *** typical datasets in the experiment are prepared according to the way in HITS（hyperlink-induced topic search）.Ten topics and four search engines are chosen and the returned results are *** 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 *** experimental results show that the proposed algorithm is effective and efficient.

主 题 词：dense cores link analysis hierarchical clustering modularity measure 

学科分类：0810[工学-土木类] 08[工学] 0805[工学-能源动力学] 0835[0835] 0812[工学-测绘类] 081202[081202] 

核心收录：

D　O　I：10.3969/j.issn.1003-7985.2008.03.006

馆 藏 号：203917464...