EconStor >
Humboldt-Universität zu Berlin >
Sonderforschungsbereich 649: Ökonomisches Risiko, Humboldt-Universität Berlin >
SFB 649 Discussion Papers, HU Berlin >

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10419/25229
  
Title:Conditional complexity of compression for authorship attribution PDF Logo
Authors:Malyutov, Mikhail B.
Wickramasinghe, Chammi Irosha
Li, Sufeng
Issue Date:2007
Series/Report no.:SFB 649 discussion paper 2007,057
Abstract:We introduce new stylometry tools based on the sliced conditional compression complexity of literary texts which are inspired by the nearly optimal application of the incomputable Kolmogorov conditional complexity (and presumably approximates it). Whereas other stylometry tools can occasionally be very close for different authors, our statistic is apparently strictly minimal for the true author, if the query and training texts are sufficiently large, compressor is sufficiently good and sampling bias is avoided (as in the poll samplings). We tune it and test its performance on attributing the Federalist papers (Madison vs. Hamilton). Our results confirm the previous attribution of Federalist papers by Mosteller and Wallace (1964) to Madison using the Naive Bayes classifier and the same attribution based on alternative classifiers such as SVM, and the second order Markov model of language. Then we apply our method for studying the attribution of the early poems from the Shakespeare Canon and the continuation of Marlowe's poem 'Hero and Leander' ascribed to G. Chapman.
Subjects:compression complexity
authorship attribution
JEL:C12
C15
C63
Document Type:Working Paper
Appears in Collections:SFB 649 Discussion Papers, HU Berlin

Files in This Item:
File Description SizeFormat
558616682.PDF1.82 MBAdobe PDF
No. of Downloads: Counter Stats
Download bibliographical data as: BibTeX
Share on:http://hdl.handle.net/10419/25229

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.