Incorporating Temporal Information in Entailment Graph Mining
원문 초록
We present a novel method for injecting temporality into entailment graphs to address the problem of spurious entailments, which may arise from similar but temporally distinct events involving the same pair of entities. We focus on the sports domain in which the same pairs of teams play on different occasions, with different outcomes. We present an unsupervised model that aims to learn entailments such as win/lose $\rightarrow$ play, while avoiding the pitfall of learning non-entailments such as win $\not\rightarrow$ lose. We evaluate our model on a manually constructed dataset, showing that incorporating time intervals and applying a temporal window around them, are effective strategies.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Efficient Parallel Genetic Algorithm for Perturbed Substructure Optimization in Complex Network
Correlation-Aware Graph Convolutional Networks for Multi-Label Node Classification
Higher-Order GNNs Meet Efficiency: Sparse Sobolev Graph Neural Networks
Accurate and Fast Estimation of Temporal Motifs using Path Sampling
Refining Wikidata Taxonomy using Large Language Models
A Versatile Framework for Attributed Network Clustering via K-Nearest Neighbor Augmentation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.