Given a sample of reference documents from a restricted and finite set of candidate authors, the task is to determine the most likely author of a previously unseen document of unknown authorship. Documents of known and unknown authorship belong to different domains (fandoms). More specifically, all documents of unknown authorship are fics of the same fandom (target fandom) while the documents of known authorship by the candidate authors are fics of several fandoms (other than the target-fandom). The participants are asked to prepare a method that can handle multiple cross-fandom attribution problems.
Task results
System | MacroF1 Sort ascending |
---|---|
Custdio and Paraboni | 0.8560 |
Halvani and Graner | 0.7510 |
Murauer et al. | 0.7340 |
Mosavat | 0.7310 |
Martn dCR et al. | 0.7050 |