EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

On authorship attribution: document’s length may not matter

Flavio Bertini, Simone Branchetti, Gabriele Calarota, Danilo Montesi

it - Information Technology · 24.08.2026 · 67 (4-6) · 131-141

DOI: 10.1515/itit-2024-0099 ↗

Kurz gefasst

Fachartikel in der Zeitschrift it - Information Technology, online erschienen am 30.04.2026. Verfasst von Flavio Bertini und 3 weiteren Autor:innen. Die Arbeit nennt 38 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The task of authorship attribution is a classification problem where a given text is analyzed by a machine learning algorithm with the goal of verifying its author. This task has great application in the world of forensic analysis and intellectual property problems. In this work, we propose to use Support Vector Machines paired with Term Frequency – Inverse Term Frequency to solve authorship attribution in cases where the author is part of a predetermined set of authors, called a closed set. This method could also be applied to large language models in order to find out if those have a “style” of writing. In the end, we show how we compared our results with related works and how we managed to improve the results on a well known benchmark dataset by 6.4 %.

Zitieren

APA

Bertini, F., Branchetti, S., Calarota, G., & Montesi, D. (2026). On authorship attribution: document’s length may not matter. it - Information Technology, 67(4-6), 131-141. https://doi.org/10.1515/itit-2024-0099

Vancouver

Bertini F, Branchetti S, Calarota G, Montesi D. On authorship attribution: document’s length may not matter. it - Information Technology. 2026;67(4-6):131-141. doi:10.1515/itit-2024-0099

BibTeX
@article{Bertini2026,
  author = {Bertini, Flavio and Branchetti, Simone and Calarota, Gabriele and Montesi, Danilo},
  title = {On authorship attribution: document’s length may not matter},
  journal = {it - Information Technology},
  year = {2026},
  volume = {67},
  number = {4-6},
  pages = {131--141},
  doi = {10.1515/itit-2024-0099}
}
Kostenlos starten →