度解耦RDF图中RDF的排序
Ranking RDF Instances in Degree-decoupled RDF Graphs
摘要:
在过去的十年中,RDF作为一种新的标准化数据模型出现,并且来自信息检索等领域的大量知识都适用于RDF图。图数据库中的一个常见任务是基于中心性度量(例如PageRank和HITS)为节点定义重要性分数。大多数策略高度依赖于节点的度。然而,在一些RDF图中,称为度解耦的RDF图,重要性的概念与节点度没有直接关系。因此,这项工作首先提出了三个新的节点重要性措施,命名为InfoRank I,II和III,度解耦的RDF图。然后,它将所提出的措施与传统的PageRank和其他熟悉的中心性措施进行比较,使用IMDb数据集。
英文摘要:
In the last decade, RDF emerged as a new kind of standardized data model, and a sizable body of knowledge from fields such as Information Retrieval was adapted to RDF graphs. One common task in graph databases is to define an importance score for nodes based on centrality measures, such as PageRank and HITS. The majority of the strategies highly depend on the degree of the node. However, in some RDF graphs, called degree-decoupled RDF graphs, the notion of importance is not directly related to the node degree. Therefore, this work first proposes three novel node importance measures, named InfoRank I, II and III, for degree-decoupled RDF graphs. It then compares the proposed measures with traditional PageRank and other familiar centrality measures, using with an IMDb dataset.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。