Information Extraction from Visually Rich Documents Using Directed Weighted Graph Neural Network
Hamza Gbada, Karim Kalti, Mohamed Ali Mahjoub
Code Available — Be the first to reproduce this paper.
ReproduceCode
- github.com/HamzaGbada/direct-neighbor-vrdOfficialpytorch★ 6
Abstract
This paper presents a novel approach to information extraction (IE) from visually rich documents (VRD) by employing a directed weighted graph representation to capture relationships among various VRD components. In contrast to conventional methods relying on spatial proximity through Euclidean distance, our approach aims to enhance performance by introducing a novel representation of relationships using directed weighted graphs. The information extraction task from VRD is treated as a node classification problem, leveraging graph convolutional networks that process the VRD graphs. We conducted evaluations on five real-world datasets, showcasing notable results and performances that align with established norms.