paper-with-me

홈 › Papers

NOTE: Solution for KDD-CUP 2021 WikiKG90M-LSC

2021-07-05 · Weiyue Su, Zeyang Fang, Hui Zhong, Huijuan Wang, Siming Dai, Zhengjie Huang, Yunsheng Shi, Shikun Feng, Zeyu Chen

WikiKG90M in KDD Cup 2021 is a large encyclopedic knowledge graph, which could benefit various downstream applications such as question answering and recommender systems. Participants are invited to complete the knowledge graph by predicting missing triplets. Recent representation learning methods have achieved great success on standard datasets like FB15k-237. Thus, we train the advanced algorithms in different domains to learn the triplets, including OTE, QuatE, RotatE and TransE. Significantly, we modified OTE into NOTE (short for Norm-OTE) for better performance. Besides, we use both the DeepWalk and the post-smoothing technique to capture the graph structure for supplementation. In addition to the representations, we also use various statistical probabilities among the head entities, the relations and the tail entities for the final prediction. Experimental results show that the ensemble of state-of-the-art representation learning methods could draw on each others strengths. And we develop feature engineering from validation candidates for further improvements. Please note that we apply the same strategy on the test set for final inference. And these features may not be practical in the real world when considering ranking against all the entities.

📄 PDF Abstract BibTeX arXiv:2107.01892

Code (0)

등록된 구현이 없습니다.

Tasks

Feature EngineeringQuestion AnsweringRecommendation SystemsRepresentation Learning

Methods 이 논문이 사용한 방법론

Self-Adversarial Negative Sampling 설명 없음
RotatE RotatE is a method for generating graph embeddings which is able to model and infer various relation patterns including: symmetry/antisymmetry, inversion, and composition.…
DeepWalk DeepWalk learns embeddings (social representations) of a graph's vertices, by modeling a stream of short random walks. Social representations are latent features of the…
TransE TransE is an energy-based model that produces knowledge base embeddings. It models relationships by interpreting them as translations operating on the low-dimensional…

Similar Papers 제목 키워드 기반

Technical Report of Team GraphMIRAcles in the WikiKG90M-LSC Track of OGB-LSC @ KDD Cup 2021

2021-07-12 · Jianyu Cai, Jiajun Chen, Taoxing Pan, Zhanqiu Zhang 외

Link prediction in large-scale knowledge graphs has gained increasing attention recently. The OGB-LSC team presented OGB Large-Scale Challenge (OGB-LSC), a collection of three real-world datasets for advancing the state-…

Knowledge DistillationKnowledge GraphsLink Prediction

TIEG-Youpu Solution for NeurIPS 2022 WikiKG90Mv2-LSC

2026-03-30 · Feng Nie, Zhixiu Ye, Sifa Xie, Shuang Wu 외 arxiv

WikiKG90Mv2 in NeurIPS 2022 is a large encyclopedic knowledge graph. Embedding knowledge graphs into continuous vector spaces is important for many practical applications, such as knowledge acquisition, question answerin…

Recommendation SystemsQuestion AnsweringKnowledge GraphsGraph Embedding

BESS: Balanced Entity Sampling and Sharing for Large-Scale Knowledge Graph Completion

2022-11-22 · Alberto Cattaneo, Daniel Justus, Harry Mellor, Douglas Orr 외

We present the award-winning submission to the WikiKG90Mv2 track of OGB-LSC@NeurIPS 2022. The task is link-prediction on the large-scale knowledge graph WikiKG90Mv2, consisting of 90M+ nodes and 600M+ edges. Our solution…

Graph EmbeddingKnowledge Graph CompletionKnowledge Graph EmbeddingLink Prediction

StarGraph: Knowledge Representation Learning based on Incomplete Two-hop Subgraph

2022-05-27 · Hongzhu Li, Xiangrui Gao, Linhui Feng, Yafeng Deng 외

Conventional representation learning algorithms for knowledge graphs (KG) map each entity to a unique embedding vector, ignoring the rich information contained in the neighborhood. We propose a method named StarGraph, wh…

Entity EmbeddingsKnowledge GraphsRepresentation LearningVocal Bursts Valence Prediction

AutoWeird: Weird Translational Scoring Function Identified by Random Search

2022-07-24 · Hansi Yang, Yongqi Zhang, Quanming Yao

Scoring function (SF) measures the plausibility of triplets in knowledge graphs. Different scoring functions can lead to huge differences in link prediction performances on different knowledge graphs. In this report, we …

AttributeKnowledge GraphsLink PredictionTriplet