检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]浙江大学信息资源管理系,杭州310027 [2]华东师范大学商学院信息学系,上海200241
出 处:《现代图书情报技术》2015年第7期31-36,共6页New Technology of Library and Information Service
摘 要:【目的】研究h度这一新型带权信息网络分析框架在学术博客推荐网络中的特性。【方法】以科学网博客2013年数据为基础,构建学术博客推荐网络,计算h度等相关参数,并辅以信息可视化进行讨论。【结果】学术博客推荐网络中,高h度节点的产生可由信息源(博主)所持有的学术知识内涵导致,也可因信息源提供话题的兴趣外延引发;h度(hA)与节点带权度(NA)之间存在形如NA=b×hA2的近似函数关系;高h度节点通常成为网络中心部分的局部子群组织者。【局限】h度并非完美指标,后续研究可试用改进型h度进行拓展。【结论】h度可作为学术博客推荐网络分析的测度工具之一,对于此类社群的管理可从高h度节点入手。[Objective] This paper studies the features of h-degree in recommendation network of academic blogs. [Methods] Based on the datasets of blogs in ScienceNet.cn in 2013, construct the recommendation network of academic blogs, calculate the h-degree and related measures, and enter discussion by information visualization. [Results] In recommendation network of academic blogs, the generation of nodes with high h-degree is not only caused by academic knowledge connotations which are held by the information source (bloggers), but also because of the interest from topic the information source provided. This paper explores an approximate functional relationship (NA=b×hA2) between h-degree (hA) and node weighted degree (NA). Nodes with high h-degree typically become the organizer of subgroup in the center of a network. [Limitations] H-degree is not a perfect indicator, and the future studies will expand the improved h-degree. [Conclusions] H-degree can be one of the measurements for recommendation network analysis of academic blogs, and h-degree is also important for community management of this kind community.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.26