Heterogeneous representation learning and matching for few-shot relation prediction. (November 2022)

• Record Type: Journal Article
• Authors: Wu, Tao; Ma, Hongyu; Wang, Chao; Qiao, Shaojie; Zhang, Liang; Yu, Shui
• Is Part Of: Pattern recognition. Volume 131(2022)
• Publication Date: 2022-11
• Subjects: Knowledge graphs -- Few-shot learning -- Relation prediction -- Representation learning -- Convolutional network; Pattern perception -- Periodicals; Perception des structures -- Périodiques; Patroonherkenning; 006.4
• DOI: 10.1016/j.patcog.2022.108830
• Languages: English
• ISSNs: 0031-3203

Abstract

Highlights: A novel few-shot relation prediction method is proposed to capture the heterogeneous influences of relational neighbors and their features. Single-layer CNN with differently sized filters is devised to capture multi-scale characteristics while controlling model complexity. Multiple similarity methods are taken into consideration to construct a matching metric between query and support set. Abstract: The recent explosive development of knowledge graphs (KGs) in artificial intelligence tasks coupled with incomplete or partial information has triggered considerable research interest in relation prediction. However, many challenges still remain unsolved: (i) the previous relation prediction methods require a significant amount of training instances (i.e., head-tail entity pairs) for every relation, which is infeasible in practical scenarios; and (ii) the representation learning of entities and relations always assumes that all local neighbors and their features contribute equally to the embedding, not sufficiently considering the heterogeneity of the information; and (iii) the state-of-the-art methods usually require a lot of training time, resulting in a high cost in real-world applications. To overcome these challenges, we propose a heterogeneous representation learning and matching approach, Multi-metric Feature Extraction Network (MFEN for short), for few-shot relation prediction in KGs. Our method focuses on knowledge graphs to sufficiently explore the topological structure and node content in graphs. Rather than taking the average of the embeddings of all relational neighbors, a heterogeneity-aware representation learning method is proposed to generate high-expressive embeddings, which capture the heterogenous roles of the relational neighbors of given entity and all of their features via a convolutional encoder. To learn the expressive representations efficiently, a single-layer CNN architecture with multi-scale filters is devised. In addition, multiple heuristic metrics are combined to efficiently improve the accuracy of similarity calculation. The proposed MFEN model is evaluated on two representative benchmark datasets NELL and Wiki. Extensive experiments have demonstrated that our method gets more than 5 % accuracy improvement and three times speedup to state-of-the-art models. Code is available on https://github.com/summer-funny/MFEN .