Evidence map›Paper›PMID 35327841›Full record

ArticleEntropy (Basel, Switzerland)2022

Complex Embedding with Type Constraints for Link Prediction.

Xiaohui Li, Zhiliang Wang, Zhaohui Zhang

Open access · goldAbstract read
In one paragraph

Article in Entropy (Basel, Switzerland), 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
0.3field-weighted citation impact, top 40% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed, 2 citations in OpenAlex.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors at 1 institution in 1 country.

Xiaohui LiSchool of Computer & Communication Engineering, University of Science and Technology Beijing, Beijing 100083, China.
Zhiliang WangSchool of Computer & Communication Engineering, University of Science and Technology Beijing, Beijing 100083, China.
Zhaohui ZhangSchool of Automation and Electrical Engineering, University of Science and Technology Beijing, Beijing 100083, China.
University of Science and Technology Beijing · CN

Funding

National Key Research and Development Program 2019YFB2101902
6 · The paper itself

Abstract

Large-scale knowledge graphs not only store entities and relations but also provide ontology-based information about them. Type constraints that exist in this information are of great importance for link prediction. In this paper, we proposed a novel complex embedding method, CHolE, in which complex circular correlation was introduced to extend the classic real-valued compositional representation HolE to complex domains, and type constraints were integrated into complex representational embeddings for improving link prediction. The proposed model consisted of two functional components, the type constraint model and the relation learning model, to form type constraints such as modulus constraints and acquire the relatedness between entities accurately by capturing rich interactions in the modulus and phase angles of complex embeddings. Experimental results on benchmark datasets showed that CHolE outperformed previous state-of-the-art methods, and the impartment of type constraints improved its performance on link prediction effectively.

Indexed as

complex circular correlationcomplex embeddinglink predictiontype constraint

Identifiers

PMID35327841
PMCPMC8947114
OpenAlexW4214618392

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.