检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:孙海生[1]
机构地区:[1]聊城大学图书馆,聊城252059
出 处:《图书情报工作》2016年第10期123-129,共7页Library and Information Service
摘 要:[目的/意义]传统共词分析的聚类算法存在以下不足:1关键词只能被划归一个聚类;2聚类过程对分类数目的确定缺乏严格判断标准。针对以上问题,采用复杂网络理论进行改进研究。[方法/过程]采用连边社团检测算法对关键词进行聚类,以科学计量学为例进行实证研究。[结果/结论]分析结果表明:算法对关键词的聚类结果有较好的改进效果,能够把核心度高的关键词同时划分到不同的研究主题之中,克服传统聚类算法的不足,而且划分密度可为聚类数目的确定提供客观判断依据。[ Purpose/significance] There are some shortages as follows in the present study on co-word analysis: 1 ) every keyword belonging to only one cluster ; 2) lack of strict criteria for determining the number of clusters. Complex network theory is used to solve the above problems. [ Method/process] Link communities algorithm is applied to improve result of clustering, and an empirical research of scientometries is conducted. [ Result/conclusion ] The results show that the improvement effect on clustering is notable. Key words with high coreness simultaneously belong to several communities, which overcomes the shortages of traditional clustering algorithm. Moreover, partition density provides an objective basis for the determination of the number of clusters.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.112