中文摘要：

伴随着大数据的大量涌现以及开放链接数据（LOD）等项目的开展,语义网知识库的数量激增,语义网知识库正在引起学术界和工业界越来越多的关注,在信息检索系统中起着重要的作用,如实体搜索和问答系统等.实体类型信息在信息检索中扮演着重要的角色,例如,查询“汤姆·汉克斯所出演的电影”,该查询限定了返回的实体类型是“电影”,这对提高查询结果的精度具有重要作用.然而,知识库中实体类型信息的缺失是十分严重的,影响了知识库在信息检索等领域中使用的正确性和广泛性.据统计,在DBpedia2014中,8%的实体没有任何类型信息,28%的实体只有高度抽象的类型信息（比如类型为“Thing”）,因此对于实体类型补全的研究尤其是实体细粒度类型的补全是十分重要的.目前已有的方法包括基于概率模型和表示学习两类.以基于概率模型的SDType算法为例.首先,SDType为每个谓词计算对各个类型的区分能力得分,然后,在为实体做类型补全时,累加该实体所具有的谓词对各个类型的得分.此类方法没有考虑谓词与谓词之间的相互增强作用,在存在知识缺失的情况下会影响补全效果.以表示学习的类型补全方法TransE为例,此方法对于简单的关系（1-1的关系）补全是可以的,但是对于补全实体类型这种复杂的关系效果并不理想,另外,表示学习的训练集尤其是负例难以获得.由于模型需要学习大量的参数,在大数据量的背景下,性能也是一个问题.文中提出一种基于谓词-类型推理图的随机游走方法来补全缺失的实体类型.首先对知识库中已有知识进行统计,包括具有某个谓词的实体数目、属于某个类型的实体数目以及属于某个类型并且具有某个谓词的实体数目.其次,基于得到的统计信息构建结点由谓词和类型组成的有向推理图,推理图的边包括谓词-谓词和谓词-类型两种.在构?

英文摘要：

Nowadays, semantic web knowledge bases are more and more prevalent hecause the wide usage of linking open data （LOD）. They play an important role in IR systems, especially in entity search systems and question answering systems. An intuition is that the entity＇s type information is very important for IR tasks. For example, an entity search query ＂movies in which Tom hanks plays a role＂ requires results of the type movie. Unfortunately, the lack of type constraints for entities is very serious in knowledge bases, which affects the correctness and universality of the use of the knowledge base in the field of information retrieval etc. Our investigation shows that in DBpedia 2014, 8% entities do not have any type information and 28% entities only have coarse types （such as ＂Thing＂）. How to complete the type constraints especially the fine-grained types for entities in knowledge bases is a critical task. Some studies propose to complete entity＇s type constraints in the knowledge base, such as probabilistic distributional model-based methods and representation learning methods. Take a probabilistic-based approach SDType as an example. Firstly, SDType calculates the weight of each predicate /or each type which describes the discriminability of a predicate for a type. Then, the score of a certain type for an entity is basically an aggregation of the scores of all predicates that the entity has. Such methods do not consider the mutually reinforcing effect between predicates, which may affects the accuracy of type completion in the absence of knowledge base. One typical method of representa- tion learning is TransE which is suitable for simple relations but not for complex relations such as type. Another problem of representation learning methods is that the training data is difficult to obtain, especially the negatives. Moreover, due to the large number of parameters in the model, the efficiency is also a big problem for these kinds of methods. In this paper, we propose a novel way to complete type in