Multi-view Contrastive Learning for Entity Typing over Knowledge Graphs (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to knowledge graph entity typing ignore the way types can be clustered together. |
| Approach: | They propose a method that effectively encodes coarse-grained knowledge from clusters into entity and type embeddings. |
| Outcome: | The proposed method encodes coarse-grained knowledge from clusters into entity and type embeddings. |
Similar Papers
Knowledge Graph Entity Typing with Curriculum Contrastive Learning (2025.coling-main)
Copied to clipboard
| Challenge: | Existing knowledge graphs suffer from incomplete type annotations because they are manually constructed by domain experts. |
| Approach: | They propose a CCLET model using the Curriculum Contrastive Learning strategy for KGET to fuse the entity related semantic and the structural information of the Knowledge Graph (KG) they define the difficulty of the course by controlling the level of added noise and aim to accurately learn with curriculum contrastive learning strategy from easy to difficult. |
| Outcome: | The proposed model outperforms state-of-the-art models and is highly accurate across multiple learning environments. |
Multi-Multi-View Learning: Multilingual and Multi-Representation Entity Typing (D18-1)
Copied to clipboard
| Challenge: | Accurate and complete knowledge bases (KBs) are paramount in NLP. |
| Approach: | They employ multiview learning for increasing the accuracy and coverage of entity type information in KBs by taking high- and low-resource languages from Wikipedia. |
| Outcome: | The proposed learning improves the accuracy and coverage of knowledge bases (KBs) by combining language and representation. |
The Integration of Semantic and Structural Knowledge in Knowledge Graph Entity Typing (2024.naacl-long)
Copied to clipboard
| Challenge: | Existing methods to predict missing type annotations for knowledge graphs use only structural knowledge in the local neighborhood of entities. |
| Approach: | They propose a model for KG Entity Typing that integrates semantic and structural knowledge to infer missing types. |
| Outcome: | The proposed framework outperforms existing state-of-the-art methods in the Knowledge Graph Entity Typing task. |
Connecting Embeddings for Knowledge Graph Entity Typing (2020.acl-main)
Copied to clipboard
| Challenge: | Existing knowledge graphs suffer from incompleteness and miss important facts, jeopardizing their usefulness in downstream tasks such as question answering. |
| Approach: | They propose a method which is trained by utilizing local typing knowledge from existing entity type assertions and global triple knowledge in KGs. |
| Outcome: | The proposed model favors inferences that agree with both entity type instances and triple knowledge in KGs. |
Transformer-based Entity Typing in Knowledge Graphs (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing knowledge graphs encoding entity types are far from complete, since in real-world applications they are continuously emerging. |
| Approach: | They propose a transformer-based approach to infer plausible entity types by encoding neighbours' information by a local transformer and a global transformer. |
| Outcome: | The proposed approach outperforms the state-of-the-art on two real-world datasets. |
AutoETER: Automated Entity Type Representation for Knowledge Graph Embedding (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing knowledge graphs are incomplete whether they are constructed manually or automatically, limiting the effectiveness when exploited for downstream applications. |
| Approach: | They propose a KGE framework with an automatic type embedding mechanism which can be easily integrated into any existing KGE model. |
| Outcome: | The proposed model can model and infer all the relation patterns and complex relations compared to state-of-the-art models on four datasets. |
Context-aware Entity Typing in Knowledge Graphs (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for knowledge graph entity typing are embedding-based and graph convolutional networks (GCNs) . Existing approaches for knowledge Graph Entity Typing (KGET) are incomplete and require multiple inference mechanisms. |
| Approach: | They propose a method that uses entities’ contextual information to infer missing types in knowledge graphs by using two inference mechanisms: N2T and Agg2T. |
| Outcome: | The proposed method can infer entities' missing types by completing two real-world KGs. |
A Good Neighbor, A Found Treasure: Mining Treasured Neighbors for Knowledge Graph Entity Typing (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to infer missing types for knowledge graphs only leverage one-hop neighbor information of the central entity, ignoring multi-hop neighbors that can provide valuable clues for inference. |
| Approach: | They propose a method to infer missing types for knowledge graph entities by using neighbor information and co-occurrence relations between types. |
| Outcome: | The proposed method significantly outperforms existing state-of-the-art methods on two widely used datasets. |
Type-enriched Hierarchical Contrastive Strategy for Fine-Grained Entity Typing (2022.coling-1)
Copied to clipboard
| Challenge: | Experimental results show that fine-grained entity typing (FET) can be used to deduce specific semantic types of entities. |
| Approach: | They propose a type-enriched hierarchical contrastive strategy to model type differences . their method can make type information directly perceptible and improve distinguishability . |
| Outcome: | The proposed method can model the differences between hierarchical types and distinguish multi-grained similar types at different granularities. |
MoCoKGC: Momentum Contrast Entity Encoding for Knowledge Graph Completion (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to knowledge graph completion have not integrated the structural attributes of knowledge graphs with the textual descriptions of entities to generate robust entity encodings. |
| Approach: | They propose to integrate structural information from knowledge graphs with textual descriptions of entities to generate robust entity encodings. |
| Outcome: | The proposed model improves on the standard evaluation metric, Mean Reciprocal Rank (MRR), while surpassing the current best model on the Wikidata5M dataset. |