Clustering of Argument Graphs Using Semantic Similarity Measures

Clustering of Argument Graphs Using Semantic Similarity Measures. Block, K., Trumm, S., Sahitaj, P., Ollinger, S., & Bergmann, R. In KI 2019: Advances in Artificial Intelligence: 42nd German Conference on AI, Kassel, Germany, September 23–26, 2019, Proceedings, 2019. Springer. Accepted for publication. The original publication will be available at www.springerlink.com

Paper abstract bibtex 4 downloads

Research on argumentation in Artificial Intelligence recently investigates new methods that contribute to the vision of developing robust argumentation machines. One line of research explores ways of reasoning with natural language arguments coming from information sources on the web as a foundation for the deliberation and synthesis of arguments in specific domains. This paper builds upon arguments represented as argument graphs in the standardized Argument Interchange Format. While previous work was focused on the development of semantic similarity measures used for the case-based retrieval of argument graphs, this paper addresses the problem of clustering argument graphs to explore structures that facilitate argumentation interpretation. We propose a k-medoid and an agglomerative clustering approach based on semantic similarity measures. We compare the clustering results based on a graph-based semantic measure that takes the structure of the argument into account with a semantic word2vec measure on the pure textual argument representation. Experiments based on the Microtext corpus show that the graph-based similarity is best on internal evaluation measures, while the pure textual measure performs very well for identifying topic-specific clusters.

@inproceedings{block_ArgGrapSimilarity_2019,
	title        = {{Clustering of Argument Graphs Using Semantic Similarity Measures}},
	author       = {Block, Karsten and Trumm, Simon and Sahitaj, Premtim and Ollinger, Stefan and Bergmann, Ralph},
	year         = 2019,
	booktitle    = {{KI} 2019: Advances in {Artificial Intelligence}: 42nd {German} {Conference} on {AI}, {Kassel}, {Germany}, {September} 23–26, 2019, {Proceedings}},
	publisher    = {Springer},
	url          = {http://www.wi2.uni-trier.de/shared/publications/2019_BlockTrummSahitajOllingerBergmann_KI.pdf},
	note         = {Accepted for publication. The original publication will be available at www.springerlink.com},
	keywords     = {{Argumentation, Argument graph similarity, Semantic textual similarity, Text clustering}},
	abstract     = {Research on argumentation in Artificial Intelligence recently investigates new methods that contribute to the vision of developing robust argumentation machines. One line of research explores ways of reasoning with natural language arguments coming from information sources on the web as a foundation for the deliberation and synthesis of arguments in specific domains. This paper builds upon arguments represented as argument graphs in the standardized Argument Interchange Format. While previous work was focused on the development of semantic similarity measures used for the case-based retrieval of argument graphs, this paper addresses the problem of clustering argument graphs to explore structures that facilitate argumentation interpretation. We propose a k-medoid and an agglomerative clustering approach based on semantic similarity measures. We compare the clustering results based on a graph-based semantic measure that takes the structure of the argument into account with a semantic word2vec measure on the pure textual argument representation. Experiments based on the Microtext corpus show that the graph-based similarity is best on internal evaluation measures, while the pure textual measure performs very well for identifying topic-specific clusters.}
}

Downloads: 4