Exploring Key Point Analysis with Pairwise Generation and Graph Partitioning

• URL: http://arxiv.org/abs/2404.11384v1
• Date: Wed, 17 Apr 2024 13:44:29 GMT
• Title: Exploring Key Point Analysis with Pairwise Generation and Graph Partitioning
• Authors: Xiao Li, Yong Jiang, Shen Huang, Pengjun Xie, Gong Cheng, Fei Huang,
• Abstract summary: Key Point Analysis (KPA) continues to be a significant and unresolved issue within the field of argument mining. We propose a novel approach for KPA with pairwise generation and graph partitioning.
• Score: 61.73411954056032
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Key Point Analysis (KPA), the summarization of multiple arguments into a concise collection of key points, continues to be a significant and unresolved issue within the field of argument mining. Existing models adapt a two-stage pipeline of clustering arguments or generating key points for argument clusters. This approach rely on semantic similarity instead of measuring the existence of shared key points among arguments. Additionally, it only models the intra-cluster relationship among arguments, disregarding the inter-cluster relationship between arguments that do not share key points. To address these limitations, we propose a novel approach for KPA with pairwise generation and graph partitioning. Our objective is to train a generative model that can simultaneously provide a score indicating the presence of shared key point between a pair of arguments and generate the shared key point. Subsequently, to map generated redundant key points to a concise set of key points, we proceed to construct an arguments graph by considering the arguments as vertices, the generated key points as edges, and the scores as edge weights. We then propose a graph partitioning algorithm to partition all arguments sharing the same key points to the same subgraph. Notably, our experimental findings demonstrate that our proposed model surpasses previous models when evaluated on both the ArgKP and QAM datasets.

Related papers

• Enhancing Argument Summarization: Prioritizing Exhaustiveness in Key Point Generation and Introducing an Automatic Coverage Evaluation Metric [3.0754290232284562]
  Key Point Analysis (KPA) task formulates argument summarization as representing the summary of a large collection of arguments. A sub-task of KPA, called Key Point Generation (KPG), focuses on generating these key points given the arguments. This paper introduces a novel extractive approach for key point generation, that outperforms previous state-of-the-art methods for the task.
  arXiv  Detail & Related papers  (2024-04-17T23:00:29Z)
• Learning Feature Matching via Matchable Keypoint-Assisted Graph Neural Network [52.29330138835208]
  Accurately matching local features between a pair of images is a challenging computer vision task. Previous studies typically use attention based graph neural networks (GNNs) with fully-connected graphs over keypoints within/across images. We propose MaKeGNN, a sparse attention-based GNN architecture which bypasses non-repeatable keypoints and leverages matchable ones to guide message passing.
  arXiv  Detail & Related papers  (2023-07-04T02:50:44Z)
• From Key Points to Key Point Hierarchy: Structured and Expressive Opinion Summarization [9.567280503274226]
  Key Point Analysis (KPA) has been recently proposed for deriving fine-grained insights from collections of textual comments. We introduce the task of organizing a given set of key points into a hierarchy, according to their specificity. We develop ThinkP, a high quality benchmark dataset of key point hierarchies for business and product reviews.
  arXiv  Detail & Related papers  (2023-06-06T16:45:44Z)
• Key Point Analysis via Contrastive Learning and Extractive Argument Summarization [26.104816072770305]
  This paper presents our proposed approach to the Key Point Analysis shared task, collocated with the 8th Workshop on Argument Mining. One component employs contrastive learning via a siamese neural network for matching arguments to key points; the other is a graph-based extractive summarization model for generating key points. In both automatic and manual evaluation, our approach was ranked best among all submissions to the shared task.
  arXiv  Detail & Related papers  (2021-09-30T12:54:26Z)
• Determinantal consensus clustering [77.34726150561087]
  We propose the use of determinantal point processes or DPP for the random restart of clustering algorithms. DPPs favor diversity of the center points within subsets. We show through simulations that, contrary to DPP, this technique fails both to ensure diversity, and to obtain a good coverage of all data facets.
  arXiv  Detail & Related papers  (2021-02-07T23:48:24Z)
• Quantitative Argument Summarization and Beyond: Cross-Domain Key Point Analysis [17.875273745811775]
  We develop a method for automatic extraction of key points, which enables fully automatic analysis. We demonstrate that the applicability of key point analysis goes well beyond argumentation data. An additional contribution is an in-depth evaluation of argument-to-key point matching models.
  arXiv  Detail & Related papers  (2020-10-11T23:01:51Z)
• Differentiable Hierarchical Graph Grouping for Multi-Person Pose Estimation [95.72606536493548]
  Multi-person pose estimation is challenging because it localizes body keypoints for multiple persons simultaneously. We propose a novel differentiable Hierarchical Graph Grouping (HGG) method to learn the graph grouping in bottom-up multi-person pose estimation task.
  arXiv  Detail & Related papers  (2020-07-23T08:46:22Z)
• Point-Set Anchors for Object Detection, Instance Segmentation and Pose Estimation [85.96410825961966]
  We argue that the image features extracted at a central point contain limited information for predicting distant keypoints or bounding box boundaries. To facilitate inference, we propose to instead perform regression from a set of points placed at more advantageous positions. We apply this proposed framework, called Point-Set Anchors, to object detection, instance segmentation, and human pose estimation.
  arXiv  Detail & Related papers  (2020-07-06T15:59:56Z)
• From Arguments to Key Points: Towards Automatic Argument Summarization [17.875273745811775]
  We show that a small number of key points per topic is typically sufficient for covering the vast majority of the arguments. Furthermore, we found that a domain expert can often predict these key points in advance.
  arXiv  Detail & Related papers  (2020-05-04T16:24:21Z)
• Deep Affinity Net: Instance Segmentation via Affinity [48.498706304017674]
  Deep Affinity Net is an effective affinity-based approach accompanied with a new graph partitioning algorithm Cascade-GAEC. It achieves the best single-shot result as well as the fastest running time among all affinity-based models. It also outperforms the region-based method Mask R-CNN.
  arXiv  Detail & Related papers  (2020-03-15T15:22:56Z)

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.