{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T10:50:52Z","timestamp":1772362252268,"version":"3.50.1"},"reference-count":26,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2011,6,9]],"date-time":"2011-06-09T00:00:00Z","timestamp":1307577600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat. Lang. Eng."],"published-print":{"date-parts":[[2012,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Authorship attribution methods aim to determine the author of a document, by using information gathered from a set of documents with known authors. One method of performing this task is to create profiles containing distinctive features known to be used by each author. In this paper, a new method of creating an author or document profile is presented that detects features considered distinctive, compared to normal language usage. This<jats:italic>recentreing<\/jats:italic>approach creates more accurate profiles than previous methods, as demonstrated empirically using a known corpus of authorship problems. This method, named recentred local profiles, determines authorship accurately using a simple \u2018best matching author\u2019 approach to classification, compared to other methods in the literature. The proposed method is shown to be more stable than related methods as parameter values change. Using a weighted voting scheme, recentred local profiles is shown to outperform other methods in authorship attribution, with an overall accuracy of 69.9% on the<jats:italic>ad-hoc<\/jats:italic>authorship attribution competition corpus, representing a significant improvement over related methods.<\/jats:p>","DOI":"10.1017\/s1351324911000180","type":"journal-article","created":{"date-parts":[[2011,6,9]],"date-time":"2011-06-09T09:08:28Z","timestamp":1307610508000},"page":"293-312","source":"Crossref","is-referenced-by-count":25,"title":["Recentred local profiles for authorship attribution"],"prefix":"10.1017","volume":"18","author":[{"given":"ROBERT","family":"LAYTON","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"PAUL","family":"WATTERS","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"RICHARD","family":"DAZELEY","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2011,6,9]]},"reference":[{"key":"S1351324911000180_ref4","first-page":"1","article-title":"Who's at the keyboard? Authorship attribution in digital evidence investigations","volume":"4","author":"Chaski","year":"2005","journal-title":"International Journal of Digital Evidence"},{"key":"S1351324911000180_ref13","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20961"},{"key":"S1351324911000180_ref22","doi-asserted-by":"publisher","DOI":"10.1038\/163688a0"},{"key":"S1351324911000180_ref15","first-page":"1","volume-title":"eCrime Researchers Summit (eCRS)","author":"Layton","year":"2009"},{"key":"S1351324911000180_ref18","first-page":"275","article-title":"Inference in an authorship problem","volume":"58","author":"Mosteller","year":"1963","journal-title":"Journal of the American Statistical Association"},{"key":"S1351324911000180_ref14","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022859003006"},{"key":"S1351324911000180_ref1","volume-title":"Scientific and Engineering Problem-Solving with the Computer","author":"Bennett","year":"1976"},{"key":"S1351324911000180_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34224-9_59"},{"key":"S1351324911000180_ref12","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20428"},{"key":"S1351324911000180_ref6","article-title":"Identifying authorship by byte-level n-grams: the source code author profile (SCAP) method","volume":"6","author":"Frantzeskou","year":"2007","journal-title":"International Journal of Digital Evidence"},{"key":"S1351324911000180_ref9","doi-asserted-by":"crossref","unstructured":"Juola P. 2008. Authorship Attribution. Now Pub.","DOI":"10.1561\/9781601981196"},{"key":"S1351324911000180_ref10","volume-title":"Ad-hoc Authorship Attribution Competition. Proceedings 2004 Joint International Conference of the Association for Literary and Linguistic Computing and the Association for Computers and the Humanities (ALLC\/ACH 2004)","author":"Ke\u0161elj","year":"2004"},{"key":"S1351324911000180_ref23","doi-asserted-by":"publisher","DOI":"10.1002\/asi.21001"},{"key":"S1351324911000180_ref24","doi-asserted-by":"publisher","DOI":"10.1080\/09296170500055350"},{"key":"S1351324911000180_ref21","first-page":"542","article-title":"On a distribution law for word frequencies","volume":"70","author":"Sichel","year":"1975","journal-title":"Journal of the American Statistical Association"},{"key":"S1351324911000180_ref19","unstructured":"Raghavan S. , Kovashka A. and Mooney R. 2010. Authorship attribution using probabilistic context-free grammars. In Proceedings of the ACL 2010 Conference Short Papers. Association for Computational Linguistics, pp. 38\u201342."},{"key":"S1351324911000180_ref25","first-page":"363","article-title":"On sentence-length as a statistical characteristic of style in prose: with application to two cases of disputed authorship","volume":"30","author":"Yule","year":"1939","journal-title":"Biometrika"},{"key":"S1351324911000180_ref2","volume-title":"Le Vocabulaire de Jean Giraudoux : structure et evolution : statistique et informatique appliquees a l'etude des textes a partir des donnees du Tresor de la langue francaise\/Etienne Brunet","author":"Brunet","year":"1978"},{"key":"S1351324911000180_ref16","first-page":"1","article-title":"Authorship attribution for twitter in 140 characters or less","volume":"1","author":"Layton","year":"2010","journal-title":"Cybercrime and Trustworthy Computing (CTC) Workshop"},{"key":"S1351324911000180_ref26","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20316"},{"key":"S1351324911000180_ref20","doi-asserted-by":"publisher","DOI":"10.1023\/A:1001018624850"},{"key":"S1351324911000180_ref7","first-page":"172","article-title":"Some simple measures of richness of vocabulary","volume":"7","author":"Honor\u00e9","year":"1979","journal-title":"Association for Literary and Linguistic Computing Bulletin"},{"key":"S1351324911000180_ref8","volume-title":"Proceedings of 2004 Joint International Conference of the Association for Literary and Linguistic Computing and the Association for Computers and the Humanities (ALLC\/ACH 2004)","author":"Juola","year":"2004"},{"key":"S1351324911000180_ref11","first-page":"255","volume-title":"Proceedings of the Pacific Association for Computational Linguistics","author":"Ke\u0161elj","year":"2003"},{"key":"S1351324911000180_ref17","doi-asserted-by":"publisher","DOI":"10.1162\/coli.2009.35.4.35403"},{"key":"S1351324911000180_ref3","volume-title":"Overview of the Third Text REtrieval Conference (TREC-3)","author":"Cavnar","year":"1975"}],"container-title":["Natural Language Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1351324911000180","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,20]],"date-time":"2020-06-20T00:11:22Z","timestamp":1592611882000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1351324911000180\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,9]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["S1351324911000180"],"URL":"https:\/\/doi.org\/10.1017\/s1351324911000180","relation":{},"ISSN":["1351-3249","1469-8110"],"issn-type":[{"value":"1351-3249","type":"print"},{"value":"1469-8110","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,9]]}}}