知识卡片
引文中心性不等于专长匹配
引文网络中的中心性利用链接关系描述某种结构重要性,它与文本主题相关度回答不同问题。高中心性不直接证明符合某个查询或适合合作;还要明确节点是作者还是论文、边怎样建立,以及自引和无出边节点怎样处理。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- · 查看原书依据
The algorithm used is Page Rank which outputs a probability distribution to represent the likelihood of one author referring to another author based on their references. Ranking can be calculated for collections of authors based on their participation in research areas. The algorithm returns the probability distribution over all the papers (let's say of size n), representing the likelihood that an author would arrive at
参考来源
- 位置:《Artificial Intelligence and Data Science in Recommendation System: Current Trends, Technologies, and Applications》第05章《主题建模与作者专长推荐》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Artificial Intelligence and Data Science in Recommendation System: Current Trends, Technologies, and Applications/_epub-src/OEBPS/Text/9789815136746-C5.html)
- 结论依据:摘录中关于引文中心性不等于专长匹配的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:The algorithm used is Page Rank which outputs a probability distribution to represent the likelihood of one author referring to another author based on their references. Ranking can be calculated for collections of authors based on their participation in research areas. The algorithm returns the probability distribution over all the papers (let's say of size n), representing the likelihood that an author would arrive at