Learning Hierarchical Document Graphs from Multilevel Sentence Relations

9Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Organizing the implicit topology of a document as a graph, and further performing feature extraction via the graph convolutional network (GCN), has proven effective in document analysis. However, existing document graphs are often restricted to expressing single-level relations, which are predefined and independent of downstream learning. A set of learnable hierarchical graphs are built to explore multilevel sentence relations, assisted by a hierarchical probabilistic topic model. Based on these graphs, multiple parallel GCNs are used to extract multilevel semantic features, which are aggregated by an attention mechanism for different document-comprehension tasks. Equipped with variational inference, the graph construction and GCN are learned jointly, allowing the graphs to evolve dynamically to better match the downstream task. The effectiveness and efficiency of the proposed multilevel sentence relation graph convolutional network (MuserGCN) is demonstrated via experiments on document classification, abstractive summarization, and matching.

Cite

CITATION STYLE

APA

Zhang, H., Wang, C., Wang, Z., Duan, Z., Chen, B., Zhou, M., … Carin, L. (2023). Learning Hierarchical Document Graphs from Multilevel Sentence Relations. IEEE Transactions on Neural Networks and Learning Systems, 34(8), 4273–4285. https://doi.org/10.1109/TNNLS.2021.3113297

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free