Affiliation:
1. Key Laboratory of Data Engineering and Knowledge Engineering, School of Information, Renmin University of China, Zhongguancun Street, Haidian District, Beijing, China
Abstract
We propose a ranking framework, called PatternRank+NN, for expanding a set of seed entities of a particular class (i.e., entity set expansion) from Web search queries. PatternRank+NN consists of two parts: PatternRank and NN. Unlike the traditional methods, PatternRank brings user behaviors into entity set expansion from Web search queries. PatternRank is a Markov chain which simulates the Web search query process of users on the graph model for Web search query log, and ranks the features of the class. The features in the front rank are used to generate candidate entities of the class. NN, a ranking strategy called Nearest Neighbor, ranks these candidate entities such that the set of seed entities can be expanded from the candidate entities in the front rank. Our experiments demonstrate the superior performance of PatternRank+NN in comparison with the state-of-the-art methods.
Funder
National Key Research 8 Development Plan
National Natural Science Foundation of China
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Pattern Driven Graph Ranking Approach to Attribute Extraction for Knowledge Graph;IEEE Transactions on Industrial Informatics;2022-02
2. Set Expander: A Knowledge-based System for Entity Set Expansion;Proceedings of the 17th International Conference on Web Information Systems and Technologies;2021