Entity retrieval via entity factoid hierarchy
Refereed conference paper presented and published in conference proceedings


全文

其它資訊
摘要We propose that entity queries are generated via a two-step process: users first select entity facts that can distinguish target entities from the others; and then choose words to describe each selected fact. Based on this query generation paradigm, we propose a new entity representation model named as entity factoid hierarchy. An entity factoid hierarchy is a tree structure composed of factoid nodes. A factoid node describes one or more facts about the entity in different information granularities. The entity factoid hierarchy is constructed via a factor graph model, and the inference on the factor graph is achieved by a modified variant of Multiple-try Metropolis algorithm. Entity retrieval is performed by decomposing entity queries and computing the query likelihood on the entity factoid hierarchy. Using an array of benchmark datasets, we demonstrate that our proposed framework significantly improves the retrieval performance over existing models.
著者Lu C., Lam W., Liao Y.
會議名稱53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing of the Asian Federation of Natural Language Processing, ACL-IJCNLP 2015
會議開始日26.07.2015
會議完結日31.07.2015
會議地點Beijing
會議國家/地區中國
詳細描述organized by Association for Computational Linguistics,
出版年份2015
月份1
日期1
卷號1
頁次514 - 523
國際標準書號9781941643723
語言英式英語

上次更新時間 2020-06-09 於 00:49