Kocher, M.; Savoy, J.: ¬A simple and efficient algorithm for authorship verification (2017)
0.00
0.0023673228 = product of:
0.0071019684 = sum of:
0.0071019684 = product of:
0.014203937 = sum of:
0.014203937 = weight(_text_:of in 3330) [ClassicSimilarity], result of:
0.014203937 = score(doc=3330,freq=8.0), product of:
0.06850986 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.043811057 = queryNorm
0.20732689 = fieldWeight in 3330, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.046875 = fieldNorm(doc=3330)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Abstract
- This paper describes and evaluates an unsupervised and effective authorship verification model called Spatium-L1. As features, we suggest using the 200 most frequent terms of the disputed text (isolated words and punctuation symbols). Applying a simple distance measure and a set of impostors, we can determine whether or not the disputed text was written by the proposed author. Moreover, based on a simple rule we can define when there is enough evidence to propose an answer or when the attribution scheme is unable to make a decision with a high degree of certainty. Evaluations based on 6 test collections (PAN CLEF 2014 evaluation campaign) indicate that Spatium-L1 usually appears in the top 3 best verification systems, and on an aggregate measure, presents the best performance. The suggested strategy can be adapted without any problem to different Indo-European languages (such as English, Dutch, Spanish, and Greek) or genres (essay, novel, review, and newspaper article).
- Source
- Journal of the Association for Information Science and Technology. 68(2017) no.1, S.259-269