Adaptive structural similarity preserving for unsupervised cross modal hashing

Relation Extraction (RE) is a vital step to complete Knowledge Graph (KG) by extracting entity relations from texts. However, it usually suffers from the long-tail issue. The training data mainly concentrates on a few types of relations, leading to the lack of sufficient annotations for the remainin...

Full description

Saved in:
Bibliographic Details
Main Authors: LI, Liang, ZHENG, Baihua, SUN, Weiwei
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2022
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/7435
https://ink.library.smu.edu.sg/context/sis_research/article/8438/viewcontent/3503161.3548431.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-8438
record_format dspace
spelling sg-smu-ink.sis_research-84382022-10-20T07:48:37Z Adaptive structural similarity preserving for unsupervised cross modal hashing LI, Liang ZHENG, Baihua SUN, Weiwei Relation Extraction (RE) is a vital step to complete Knowledge Graph (KG) by extracting entity relations from texts. However, it usually suffers from the long-tail issue. The training data mainly concentrates on a few types of relations, leading to the lack of sufficient annotations for the remaining types of relations. In this paper, we propose a general approach to learn relation prototypes from unlabeled texts, to facilitate the long-tail relation extraction by transferring knowledge from the relation types with sufficient training data. We learn relation prototypes as an implicit factor between entities, which reflects the meanings of relations as well as their proximities for transfer learning. Specifically, we construct a co-occurrence graph from texts, and capture both first-order and second-order entity proximities for embedding learning. Based on this, we further optimize the distance from entity pairs to corresponding prototypes, which can be easily adapted to almost arbitrary RE frameworks. Thus, the learning of infrequent or even unseen relation types will benefit from semantically proximate relations through pairs of entities and large-scale textual information. We have conducted extensive experiments on two publicly available datasets: New York Times and Google Distant Supervision. Compared with eight state-of-the-art baselines, our proposed model achieves significant improvements (4.1% F1 on average). Further results on long-tail relations demonstrate the effectiveness of the learned relation prototypes. We further conduct an ablation study to investigate the impacts of varying components, and apply it to four basic relation extraction models to verify the generalization ability. Finally, we analyze several example cases to give intuitive impressions as qualitative analysis. Our codes will be released later. 2022-10-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/7435 info:doi/10.1145/3503161.3548431 https://ink.library.smu.edu.sg/context/sis_research/article/8438/viewcontent/3503161.3548431.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Relation Extraction long-tail Knowledge Graph Prototype Learning Databases and Information Systems
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Relation Extraction
long-tail
Knowledge Graph
Prototype Learning
Databases and Information Systems
spellingShingle Relation Extraction
long-tail
Knowledge Graph
Prototype Learning
Databases and Information Systems
LI, Liang
ZHENG, Baihua
SUN, Weiwei
Adaptive structural similarity preserving for unsupervised cross modal hashing
description Relation Extraction (RE) is a vital step to complete Knowledge Graph (KG) by extracting entity relations from texts. However, it usually suffers from the long-tail issue. The training data mainly concentrates on a few types of relations, leading to the lack of sufficient annotations for the remaining types of relations. In this paper, we propose a general approach to learn relation prototypes from unlabeled texts, to facilitate the long-tail relation extraction by transferring knowledge from the relation types with sufficient training data. We learn relation prototypes as an implicit factor between entities, which reflects the meanings of relations as well as their proximities for transfer learning. Specifically, we construct a co-occurrence graph from texts, and capture both first-order and second-order entity proximities for embedding learning. Based on this, we further optimize the distance from entity pairs to corresponding prototypes, which can be easily adapted to almost arbitrary RE frameworks. Thus, the learning of infrequent or even unseen relation types will benefit from semantically proximate relations through pairs of entities and large-scale textual information. We have conducted extensive experiments on two publicly available datasets: New York Times and Google Distant Supervision. Compared with eight state-of-the-art baselines, our proposed model achieves significant improvements (4.1% F1 on average). Further results on long-tail relations demonstrate the effectiveness of the learned relation prototypes. We further conduct an ablation study to investigate the impacts of varying components, and apply it to four basic relation extraction models to verify the generalization ability. Finally, we analyze several example cases to give intuitive impressions as qualitative analysis. Our codes will be released later.
format text
author LI, Liang
ZHENG, Baihua
SUN, Weiwei
author_facet LI, Liang
ZHENG, Baihua
SUN, Weiwei
author_sort LI, Liang
title Adaptive structural similarity preserving for unsupervised cross modal hashing
title_short Adaptive structural similarity preserving for unsupervised cross modal hashing
title_full Adaptive structural similarity preserving for unsupervised cross modal hashing
title_fullStr Adaptive structural similarity preserving for unsupervised cross modal hashing
title_full_unstemmed Adaptive structural similarity preserving for unsupervised cross modal hashing
title_sort adaptive structural similarity preserving for unsupervised cross modal hashing
publisher Institutional Knowledge at Singapore Management University
publishDate 2022
url https://ink.library.smu.edu.sg/sis_research/7435
https://ink.library.smu.edu.sg/context/sis_research/article/8438/viewcontent/3503161.3548431.pdf
_version_ 1770576339198279680