Efficient Mind-Map Generation via Sequence-to-Graph and Reinforced Graph Refinement

• URL: http://arxiv.org/abs/2109.02457v1
• Date: Mon, 6 Sep 2021 13:41:19 GMT
• Title: Efficient Mind-Map Generation via Sequence-to-Graph and Reinforced Graph Refinement
• Authors: Mengting Hu, Honglei Guo, Shiwan Zhao, Hang Gao, Zhong Su
• Abstract summary: A mind-map is a diagram that represents the central concept and key ideas in a hierarchical way. The existing automatic mind-map generation method extracts the relationships of every sentence pair to generate the directed semantic graph. We propose an efficient mind-map generation network that converts a document into a graph via sequence-to-graph.
• Score: 21.580450836713577
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A mind-map is a diagram that represents the central concept and key ideas in a hierarchical way. Converting plain text into a mind-map will reveal its key semantic structure and be easier to understand. Given a document, the existing automatic mind-map generation method extracts the relationships of every sentence pair to generate the directed semantic graph for this document. The computation complexity increases exponentially with the length of the document. Moreover, it is difficult to capture the overall semantics. To deal with the above challenges, we propose an efficient mind-map generation network that converts a document into a graph via sequence-to-graph. To guarantee a meaningful mind-map, we design a graph refinement module to adjust the relation graph in a reinforcement learning manner. Extensive experimental results demonstrate that the proposed approach is more effective and efficient than the existing methods. The inference time is reduced by thousands of times compared with the existing methods. The case studies verify that the generated mind-maps better reveal the underlying semantic structures of the document.

Related papers

• GraphKD: Exploring Knowledge Distillation Towards Document Object Detection with Structured Graph Creation [14.511401955827875]
  Object detection in documents is a key step to automate the structural elements identification process. We present a graph-based knowledge distillation framework to correctly identify and localize the document objects in a document image.
  arXiv  Detail & Related papers  (2024-02-17T23:08:32Z)
• Coreference Graph Guidance for Mind-Map Generation [5.289044688419791]
  Recently, a state-of-the-art method encodes the sentences of a document sequentially and converts them to a relation graph via sequence-to-graph. We propose a coreference-guided mind-map generation network (CMGN) to incorporate external structure knowledge.
  arXiv  Detail & Related papers  (2023-12-19T09:39:27Z)
• NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classification [70.51126383984555]
  We introduce a novel all-pair message passing scheme for efficiently propagating node signals between arbitrary nodes. The efficient computation is enabled by a kernerlized Gumbel-Softmax operator. Experiments demonstrate the promising efficacy of the method in various tasks including node classification on graphs.
  arXiv  Detail & Related papers  (2023-06-14T09:21:15Z)
• Conversational Semantic Parsing using Dynamic Context Graphs [68.72121830563906]
  We consider the task of conversational semantic parsing over general purpose knowledge graphs (KGs) with millions of entities, and thousands of relation-types. We focus on models which are capable of interactively mapping user utterances into executable logical forms.
  arXiv  Detail & Related papers  (2023-05-04T16:04:41Z)
• FORBID: Fast Overlap Removal By stochastic gradIent Descent for Graph Drawing [1.1470070927586014]
  Overlaps between nodes can hinder graph visualization readability. Overlap Removal (OR) algorithms have been proposed as layout post-processing. We propose a novel gradient models OR as a joint stress and scaling optimization problem.
  arXiv  Detail & Related papers  (2022-08-19T13:51:44Z)
• Primitive Graph Learning for Unified Vector Mapping [14.20286798139897]
  GraphMapper is a unified framework for end-to-end vector map extraction from satellite images. We convert vector shape prediction, regularization, and topology reconstruction into a unique primitive graph learning problem. Our model outperforms state-of-the-art methods by 8-10% in both tasks on public benchmarks.
  arXiv  Detail & Related papers  (2022-06-28T12:33:18Z)
• FactGraph: Evaluating Factuality in Summarization with Semantic Graph Representations [114.94628499698096]
  We propose FactGraph, a method that decomposes the document and the summary into structured meaning representations (MRs) MRs describe core semantic concepts and their relations, aggregating the main content in both document and summary in a canonical form, and reducing data sparsity. Experiments on different benchmarks for evaluating factuality show that FactGraph outperforms previous approaches by up to 15%.
  arXiv  Detail & Related papers  (2022-04-13T16:45:33Z)
• Joint Graph Learning and Matching for Semantic Feature Correspondence [69.71998282148762]
  We propose a joint emphgraph learning and matching network, named GLAM, to explore reliable graph structures for boosting graph matching. The proposed method is evaluated on three popular visual matching benchmarks (Pascal VOC, Willow Object and SPair-71k) It outperforms previous state-of-the-art graph matching methods by significant margins on all benchmarks.
  arXiv  Detail & Related papers  (2021-09-01T08:24:02Z)
• Accurate Learning of Graph Representations with Graph Multiset Pooling [45.72542969364438]
  We propose a Graph Multiset Transformer (GMT) that captures the interaction between nodes according to their structural dependencies. Our experimental results show that GMT significantly outperforms state-of-the-art graph pooling methods on graph classification benchmarks.
  arXiv  Detail & Related papers  (2021-02-23T07:45:58Z)
• Learning the Implicit Semantic Representation on Graph-Structured Data [57.670106959061634]
  Existing representation learning methods in graph convolutional networks are mainly designed by describing the neighborhood of each node as a perceptual whole. We propose a Semantic Graph Convolutional Networks (SGCN) that explores the implicit semantics by learning latent semantic-paths in graphs.
  arXiv  Detail & Related papers  (2021-01-16T16:18:43Z)
• Heterogeneous Graph Neural Networks for Extractive Document Summarization [101.17980994606836]
  Cross-sentence relations are a crucial step in extractive document summarization. We present a graph-based neural network for extractive summarization (HeterSumGraph) We introduce different types of nodes into graph-based neural networks for extractive document summarization.
  arXiv  Detail & Related papers  (2020-04-26T14:38:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.