Mitigating the Effect of Out-of-Vocabulary Entity Pairs in Matrix Factorization for KB Inference

被引:0
作者
Jain, Prachi [1 ]
Murty, Shikhar [1 ]
Mausam [1 ]
Chakrabarti, Soumen [2 ]
机构
[1] Indian Inst Technol Delhi, Delhi, India
[2] Indian Inst Technol, Bombay, Maharashtra, India
来源
PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE | 2018年
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper analyzes the varied performance of Matrix Factorization (MF) on the related tasks of relation extraction and knowledge-base completion, which have been unified recently into a single framework of knowledge-base inference (KBI) [Toutanova et al., 2015]. We first propose a new evaluation protocol that makes comparisons between MF and Tensor Factorization (TF) models fair. We find that this results in a steep drop in MF performance. Our analysis attributes this to the high out-of-vocabulary (OOV) rate of entity pairs in test folds of commonly-used datasets. To alleviate this issue, we propose three extensions to MF. Our best model is a TF-augmented MF model. This hybrid model is robust and obtains strong results across various KBI datasets.
引用
收藏
页码:4122 / 4129
页数:8
相关论文
共 32 条
[1]  
[Anonymous], 1970, UCLA Working Papers in Phonetics, DOI DOI 10.1134/S0036023613040165
[2]  
[Anonymous], 2016, NAACL HLT, DOI 10.18653/v1/n16-1054
[3]  
[Anonymous], 2016, ICML
[4]  
[Anonymous], 2015, P 2015 C EMP METH NA, DOI 10.18653/v1/D15-1038
[5]  
[Anonymous], 2015, Proceedings of the 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, DOI 10.3115/v1/N15-1118
[6]  
[Anonymous], 2013, P C N AM CHAPT ASS C
[7]  
[Anonymous], 2015, P C EMPIR METH NAT L, DOI DOI 10.18653/V1/D15-1034
[8]  
Berant J., 2011, P 49 ANN M ASS COMP, V1, P610
[9]  
Bordes A., 2013, ADV NEURAL INFORM PR, P2787
[10]  
Chollet F., 2015, about us