| Challenge: | Existing approaches for document dating assume accurate knowledge of document date, but this is not always available for arbitrary documents from the Web. |
| Approach: | They propose a Graph Convolutional Network (GCN) based document dating approach which exploits syntactic and temporal graph structures of document in a principled way. |
| Outcome: | The proposed approach outperforms state-of-the-art models on real-world datasets by 19% absolute accuracy points. |
Similar Papers
AD3: Attentive Deep Document Dater (D18-1)
Copied to clipboard
| Challenge: | Existing methods to predict creation time of documents are based on time-stamp metadata, but none are available. |
| Approach: | They propose an attention-based neural document dating system which utilizes both context and temporal information in documents in a flexible and principled manner. |
| Outcome: | The proposed system outperforms neural and non-neural baselines on multiple real-world datasets. |
Neural Topic Modeling by Incorporating Document Relationship Graph (2020.emnlp-main)
Copied to clipboard
| Challenge: | Graph Topic Models (GNNs) capture relationships between graph nodes via message passing . recent research has focused on topic modeling using latent Dirichlet Allocation . |
| Approach: | They propose a Graph Topic Model (GTM) that captures relationships between graph nodes via message passing. |
| Outcome: | The proposed model captures the relationships between nodes via message passing . the results demonstrate that the proposed model is effective in generating documents . |
Doc-GCN: Heterogeneous Graph Convolutional Networks for Document Layout Analysis (2022.coling-1)
Copied to clipboard
| Challenge: | Document Layout Analysis tasks rely on visual cues to understand documents . traditional deep learning-based methods fail to recognize the layout and components of unstructured documents based on the document structure and the boundaries of each layout region. |
| Approach: | They propose a way to harmonize and integrate heterogeneous aspects for Document Layout Analysis by using graph convolutional networks to enhance each aspect of features. |
| Outcome: | The proposed task is based on three widely used datasets: PubLayNet, FUNSD, and DocBank. |
Question Answering by Reasoning Across Documents with Graph Convolutional Networks (N19-1)
Copied to clipboard
| Challenge: | Recent research in reading comprehension has focused on answering questions based on individual documents or even single paragraphs. |
| Approach: | They propose a neural model which integrates and reasons relying on information spread within documents and across multiple documents. |
| Outcome: | The proposed model achieves state-of-the-art on a multi-document question answering dataset, WikiHop. |
Global Context-enhanced Graph Convolutional Networks for Document-level Relation Extraction (2020.coling-main)
Copied to clipboard
| Challenge: | Existing approaches to document-level relation extraction are difficult to establish direct connections between distant entity pairs. |
| Approach: | They propose a global context-enhanced Graph Convolutional Network model which captures rich global context information of entities in a document. |
| Outcome: | The proposed model captures rich global context information of entities in a document. |
Every Document Owns Its Structure: Inductive Text Classification via Graph Neural Networks (2020.acl-main)
Copied to clipboard
| Challenge: | Existing graph-based methods for text classification cannot capture contextual word relationships within each document nor can they produce inductive learning of new words. |
| Approach: | They propose to use Graph Neural Networks to learn the local word representations and then aggregate the word nodes as the document embeddings. |
| Outcome: | The proposed method outperforms state-of-the-art methods on four benchmark datasets. |
Regularized Graph Convolutional Networks for Short Text Classification (2020.coling-industry)
Copied to clipboard
| Challenge: | Short text classification is a problem in natural language processing, social network analysis, and e-commerce. |
| Approach: | They propose a short text classification technique that incorporates label dependencies into the output space to overcome the limitations of short text. |
| Outcome: | The proposed model outperforms baseline methods on proprietary and external datasets and is more robust to noise in textual features. |
TwiRGCN: Temporally Weighted Graph Convolution for Question Answering over Temporal Knowledge Graphs (2023.eacl-main)
Copied to clipboard
| Challenge: | Recent years have witnessed interest in Temporal Question Answering over Knowledge Graphs (TKGQA) but these methods are highly engineered and do not automatically discover relevant parts of the KG during multi-hop reasoning. |
| Approach: | They propose a scheme to modulate the messages passed through a KG edge during convolution based on the relevance of its associated period to the question. |
| Outcome: | The proposed system outperforms state-of-the-art models on a recent challenging dataset for multi-hop complex temporal QA called TimeQuestions. |
A Neural Edge-Editing Approach for Document-Level Relation Graph Extraction (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to extract relation information from documents do not capture interactions between entities. |
| Approach: | They propose an iterative approach to extract relation information from a document . they initialize relation graphs using a pretrained transformer model and a graph convolutional neural network model . |
| Outcome: | The proposed method extracts relation information from a document using a rule-based system and empty graphs. |
Graph Convolutional Networks for Event Causality Identification with Rich Document-level Structures (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing models for document-level Event Causality Identification (ECI) are limited to intra-sentence contexts where event mention pairs are presented in the same sentences. |
| Approach: | They propose a deep learning model that accepts inter-sentence event mention pairs . they use interaction graphs to capture relevant connections between important objects . |
| Outcome: | The proposed model achieves state-of-the-art on two benchmark datasets. |