% pubman genre = article
@article{item_3581545,
title = {{Computational thematics: comparing algorithms for clustering the genres of literary fiction}},
author = {Sobchuk, Oleg and {\v{S}}e{\c{l}}a, Artjoms},
language = {eng},
issn = {2055-1045; 2662-9992},
doi = {10.1057/s41599-024-02933-6},
publisher = {Springer Nature ; Palgrave Macmillan},
address = {London ; USA},
year = {2024},
date = {2024-03},
abstract = {{What are the best methods of capturing thematic similarity between literary texts? Knowing the answer to this question would be useful for automatic clustering of book genres, or any other thematic grouping. This paper compares a variety of algorithms for unsupervised learning of thematic similarities between texts, which we call {\textquotedblleft}computational thematics{\textquotedblright}. These algorithms belong to three steps of analysis: text pre-processing, extraction of text features, and measuring distances between the lists of features. Each of these steps includes a variety of options. We test all the possible combinations of these options. Every combination of algorithms is given a task to cluster a corpus of books belonging to four pre-tagged genres of fiction. This clustering is then validated against the {\textquotedblleft}ground truth{\textquotedblright} genre labels. Such comparison of algorithms allows us to learn the best and the worst combinations for computational thematic analysis. To illustrate the difference between the best and the worst methods, we then cluster 5000 random novels from the HathiTrust corpus of fiction.}},
journal = {{Humanities and Social Sciences Communications}},
volume = {11},
eid = {438},
}