Year: 2025
Type: conference-paper
Abstract: Through manual annotation or automated argument mining processes, arguments can be represented not only as text, but also in structured formats like graphs.When searching for relevant arguments, this additional information about the relationship between their elementary units allows for the formulation of finegrained structural constraints by using graphs as queries.Then, a retrieval can be performed by computing the similarity between the query and all available arguments.Previous works employed Graph Edit Distance (GED) algorithms such as A* search to compute mappings between nodes and edges for determining the similarity, which is rather expensive.In this paper, we propose an alternative based on Vision Transformers where arguments are rendered as images to obtain dense embeddings.We propose multiple space-filling visualizations and evaluate the retrieval performance of the visionbased approach against an existing A* searchbased method.We find that our technique runs orders of magnitude faster than A* search and scales well on larger argument graphs while achieving competitive results.
Authors: Kilian Bartz, Mirko Lenz, Ralph Bergmann
Language: English
Topic: Graph Theory and Algorithms
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
OpenAlex ID: W4412889297