Determining if two documents are written by the same author
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
Almost any conceivable authorship attribution problem can be reduced to one fundamental problem: whether a pair of (possibly short) documents were written by the same author. In this article, we offer an (almost) unsupervised method for solving this problem with surprisingly high accuracy. The main idea is to use repeated feature subsampling methods to determine if one document of the pair allows us to select the other from among a background set of “impostors” in a sufficiently robust manner.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A survey of modern authorship attribution methods
Stamatatos, E. (2009) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.21001 · Cited by 1,176 · cited 2×
“In such cases, similarity-based methods are more natural than machine-learning methods (Stamatatos, 2009).”
BackgroundMethodDelta: A Measure of Stylistic Difference and a Guide to Likely Authorship
Burrows, J. (2002) · Literary and Linguistic Computing · doi:10.1093/llc/17.3.267 · Cited by 627
Computational methods in authorship attribution
Koppel, M., Schler, J., & Argamon, S. (2009) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20961 · Cited by 528 · cited 1×
“…the known writings of each candidate author (considered as a set of distinct training documents) are used to construct a classifier that can then be used to classify anonymous documents (Abbasi & Chen, 2008; Koppel, Schler, & Argamon, 2008; Zhao & Zobel, 2005; Zheng, Li, Chen, & Huang, 2006).”
MethodSelf-citationZheng, R., Li, J., Chen, H., & Huang, Z. (2006) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20316 · Cited by 519 · cited 2×
“) Because this is a binary learning problem and support vector machine (SVM) has often been found to perform well for binary authorship problems (Abbasi & Chen, 2008; Zheng et al., 2006), we chose SVM as our learning algorithm.”
MethodOn the Feasibility of Internet-Scale Author Identification
Narayanan, A., Paskov, H., Gong, N. Z., Bethencourt, J., Stefanov, E., Shin, E. C. R., & Song, D. (2012) · 2012 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2012.46 · Cited by 261
Plagiarism Detection Without Reference Collections
Meyer zu Eissen, S., Stein, B., & Kulig, M. (2007) · Studies in Classification, Data Analysis, and Knowledge Organization · doi:10.1007/978-3-540-70981-7_40 · Cited by 106
Research works printed but not linked: 24
- 10.1145/1344411.1344413 · DOI · Paper page
- 10.1093/llc/fqn003 · DOI · Paper page
- Brennan M. &Greenstadt R.(2009).Practical attacks on authorship recognition techniques. InProceedings of the Twenty First Conference on Innovative Applications of Artificial Intelligence (IAAI) Pasadena CA.
- 10.1016/S0031-3203(02)00121-8 · DOI · Paper page
- Escalante H.J. Solorio T. &Montes M.(2011).Local histograms of character n‐grams for authorship attribution.In Proceedings of the 49h Annual Meeting of the Association for Computational Linguistic (ACL 2011)(pp.288–298).Portland OR:ACL.
- 10.1093/llc/fqm020 · DOI · Paper page
- 10.1093/llc/18.4.341 · DOI · Paper page
- Houvardas J. &Stamatatos E.(2006).N‐gram feature selection for author identification.In Proceedings of the 12th International Conference on Artificial Intelligence: Methodology Systems and Applications(ICAI 2006) (pp.77–86).Varna Bulgaria:ICAI. · DOI · Paper page
- 10.1561/1500000005 · DOI · Paper page
- 10.1093/llc/fqi024 · DOI · Paper page
- Keselj V. Peng F. Cercone N. &Thomas C.(2003).N‐gram‐based author profiles for authorship attribution.In Proceeding of PACLING'03(pp.255–264).Halifax Canada:PACLING.
- Koppel M. &Schler J.(2004).Authorship verification as a one‐class classification problem.In Proceedings of 21st International Conference on Machine Learning(ICML 2004) (pp.489–495).Banff Canada:ICML. · DOI · Paper page
- 10.1007/s10579-009-9111-2 · DOI · Paper page
- Luyckx K. &Daelemans W.(2008).Authorship attribution and verification with many authors and limited data.In Proceedings of the 22nd International Conference on Computational Linguistics(COLING 2008) (pp.513–520).Manchester UK:CONLING. · DOI · Paper page
- Luyckx K., 2010, The effect of author set size and data size in authorship attribution, Literary and Linguistic Computing, 1
- Madigan D. Genkin A. Lewis D.D. Argamon S. Fradkin D. &Ye L.(2005).Author identification on the large scale.In Proceedings of the Meeting of the Classification Society of North America 2005.
- Novak J. Raghavan P. &Tomkins A.(2004).Anti‐aliasing on the web.In Proceedings of the 13th International Conference on World Wide Web(ACM 2004).New York:ACM. · DOI · Paper page
- Plakias S. &Stamatatos E.(2008).Author identification using a tensor space representation.In Proceedings of the 18th European Conference on Artificial Intelligence(ECAI) (pp.833–834).Greece:ECAI.
- 10.1016/0167-6393(95)00009-D · DOI · Paper page
- Sanderson C. &Guenter S.(2006).Short text authorship attribution via sequence kernels Markov chains and author unmasking: An investigation.In Proceedings of Int'l Conference on Empirical Methods in Natural Language Processing(EMNLP 2006) (pp.482–491).Sydney Australia:EMNLP. · DOI · Paper page
- 10.1007/11562214_84 · DOI
- Winter Y.(2012).Determining whether two anonymous short documents are by the same author. Unpublished M.Sc. dissertation Dept. of Computer Science Bar‐Ilan University.
- 10.1007/s10791-006-9004-6 · doi:10.1007/s10791-006-9004-6
- Zhao Y. &Zobel J.(2005).Effective authorship attribution using function word. InProceedings of the 2nd Asian Information Retrieval Symposium (AIRS 2005)(pp.174–190). New York. · DOI · Paper page
Cited by
Academic Plagiarism Detection: A Systematic Literature Review
Foltýnek, T., Meuschke, N., & Gipp, B. (2020) · ACM Computing Surveys · doi:10.1145/3345317 · Cited by 238
Authorship Attribution for Social Media Forensics
Rocha, A., Scheirer, W. J., Forstall, C. W., Cavalcante, T., Theophilo, A., Shen, B., Carvalho, A. R. B., & Stamatatos, E. (2017) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2016.2603960 · Cited by 222
“Some of the strategies we discussed above, such as similarity measures [27], [109] and SVM [113], [152] apply directly, but better performance can be achieved with features and classification approaches custom-tailored for attribution problems with small samples of texts.”
BackgroundMethodSurveying Stylometry Techniques and Applications
Neal, T., Sundararajan, K., Fatima, A., Yan, Y., Xiang, Y., & Woodard, D. (2018) · ACM Computing Surveys · doi:10.1145/3132039 · Cited by 222
Reducing plagiarism through academic misconduct education
Perkins, M., Gezgin, U. B., & Roe, J. (2020) · International Journal for Educational Integrity · doi:10.1007/s40979-020-00052-8 · Cited by 134
“Koppel and Winter (2014) demonstrate how computational linguistic methods can be used to determine whether the author of two documents is the same.”
BackgroundAuthorship of Pauline Epistles Revisited
Savoy, J. (2019) · Journal of the Association for Information Science and Technology · doi:10.1002/asi.24176 · Cited by 26
Metadata
- Authors
- Koppel, M., & Winter, Y.
- Venue
- Journal of the Association for Information Science and Technology
- Publisher
- Wiley
- Published
- 2013-10-23
- Volume
- 65
- Issue
- 1
- Pages
- 178-187
- ISSN
- 2330-1635 (ISSN-L)
- 2330-1643
- OpenAlex
- W1548374273
- Cited by
- 227
- References
- 6
- FWCI
- 14.72
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.