TY - GEN
T1 - A probability model for related entity retrieval using relation pattern
AU - Jiang, Peng
AU - Yang, Qing
AU - Zhang, Chunxia
AU - Niu, Zhendong
AU - Fu, Hongping
PY - 2011
Y1 - 2011
N2 - As the Web is becoming the largest knowledge repository which contains various entities and their relations, the task of related entity retrieval excites interest in the field of information retrieval. This challenging task is introduced in TREC 2009 Entity Track. In this task, given an entity and the type of the target entity, as well as the nature of their relation described in free text, a retrieval system is required to return a ranked list of related entities that are of the target type. It means that entity ranking goes beyond entity relevance and integrates the judgment of relation into the evaluation of the retrieved entities. In this paper, we propose a probability model using relation pattern to address the task of related entity retrieval. This model takes into account both relevance and relation between entities. We focus on using relation patterns to measure the level of relation matching between entities, and then to estimate the probability of occurrence of relation between two entities. In addition, we represent entity by its context language model and measure the relevance between two entities by a language model approach. Experimental results on TREC Entity Track dataset show that our proposed model significantly improves retrieval performances over baseline. The comparison with other approaches also reveals the effectiveness of our model.
AB - As the Web is becoming the largest knowledge repository which contains various entities and their relations, the task of related entity retrieval excites interest in the field of information retrieval. This challenging task is introduced in TREC 2009 Entity Track. In this task, given an entity and the type of the target entity, as well as the nature of their relation described in free text, a retrieval system is required to return a ranked list of related entities that are of the target type. It means that entity ranking goes beyond entity relevance and integrates the judgment of relation into the evaluation of the retrieved entities. In this paper, we propose a probability model using relation pattern to address the task of related entity retrieval. This model takes into account both relevance and relation between entities. We focus on using relation patterns to measure the level of relation matching between entities, and then to estimate the probability of occurrence of relation between two entities. In addition, we represent entity by its context language model and measure the relevance between two entities by a language model approach. Experimental results on TREC Entity Track dataset show that our proposed model significantly improves retrieval performances over baseline. The comparison with other approaches also reveals the effectiveness of our model.
KW - Relation pattern
KW - language model
KW - related entity retrieval
UR - http://www.scopus.com/inward/record.url?scp=84863234373&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-25975-3_28
DO - 10.1007/978-3-642-25975-3_28
M3 - Conference contribution
AN - SCOPUS:84863234373
SN - 9783642259746
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 318
EP - 330
BT - Knowledge Science, Engineering and Management - 5th International Conference, KSEM 2011, Proceedings
T2 - 5th International Conference on Knowledge Science, Engineering and Management, KSEM 2011
Y2 - 12 December 2011 through 14 December 2011
ER -