paper-with-me

홈 › Papers

Knowledge Completion for Generics using Guided Tensor Factorization

2016-12-12 · TACL 2018 1 · Hanie Sedghi, Ashish Sabharwal

Given a knowledge base or KB containing (noisy) facts about common nouns or generics, such as "all trees produce oxygen" or "some animals live in forests", we consider the problem of inferring additional such facts at a precision similar to that of the starting KB. Such KBs capture general knowledge about the world, and are crucial for various applications such as question answering. Different from commonly studied named entity KBs such as Freebase, generics KBs involve quantification, have more complex underlying regularities, tend to be more incomplete, and violate the commonly used locally closed world assumption (LCWA). We show that existing KB completion methods struggle with this new task, and present the first approach that is successful. Our results demonstrate that external information, such as relation schemas and entity taxonomies, if used appropriately, can be a surprisingly powerful tool in this setting. First, our simple yet effective knowledge guided tensor factorization approach achieves state-of-the-art results on two generics KBs (80% precise) for science, doubling their size at 74%-86% precision. Second, our novel taxonomy guided, submodular, active learning method for collecting annotations about rare entities (e.g., oriole, a bird) is 6x more effective at inferring further new facts about them than multiple active learning baselines.

📄 PDF Abstract BibTeX arXiv:1612.03871

Code (0)

등록된 구현이 없습니다.

Tasks

Active LearningGeneral KnowledgeQuestion Answering

Similar Papers 제목 키워드 기반

Spectra-Guided Neural Tucker Factorization

2026-05-30 · Fusheng Wang, Yikai Hou arxiv

This paper proposes Spectra-Guided Neural Tucker Factorization (SG-NTF) for High-Dimensional and Incomplete (HDI) tensor completion. Circumventing discrete representational limits, SG-NTF maps scalar timestamps into a co…

Federated Knowledge Graph Completion via Latent Embedding Sharing and Tensor Factorization

2023-11-17 · Maolin Wang, Dun Zeng, Zenglin Xu, Ruocheng Guo 외

Knowledge graphs (KGs), which consist of triples, are inherently incomplete and always require completion procedure to predict missing triples. In real-world scenarios, KGs are distributed across clients, complicating co…

Knowledge Graph CompletionKnowledge Graphs

Attention-Guided Low-Rank Tensor Completion

2024-07-17 · IEEE Transactions on Pattern Analysis and Machine Intelligence 2024 7 · Truong Thanh Nhat Mai, Edmund Y. Lam, Chul Lee

Low-rank tensor completion (LRTC) aims to recover missing data of high-dimensional structures from a limited set of observed entries. Despite recent significant successes, the original structures of data tensors are stil…

Image Restoration

Duality-Induced Regularizer for Tensor Factorization Based Knowledge Graph Completion

2020-11-11 · NeurIPS 2020 12 · Zhanqiu Zhang, Jianyu Cai, Jie Wang

Tensor factorization based models have shown great power in knowledge graph completion (KGC). However, their performance usually suffers from the overfitting problem seriously. This motivates various regularizers -- such…

Knowledge Graph CompletionLink Prediction

GOCPT: Generalized Online Canonical Polyadic Tensor Factorization and Completion

2022-05-08 · Chaoqi Yang, Cheng Qian, Jimeng Sun

Low-rank tensor factorization or completion is well-studied and applied in various online settings, such as online tensor factorization (where the temporal mode grows) and online tensor completion (where incomplete slice…