Graph theory and its applications
Graph theory and its applications
Modern Information Retrieval
Mining e-mail content for author identification forensics
ACM SIGMOD Record
Authorship Attribution with Support Vector Machines
Applied Intelligence
Gender-Preferential Text Mining of E-mail Discourse
ACSAC '02 Proceedings of the 18th Annual Computer Security Applications Conference
Relational matching with dynamic graph structures
ICCV '95 Proceedings of the Fifth International Conference on Computer Vision
Graph matching by relaxation of fuzzy assignments
IEEE Transactions on Fuzzy Systems
Learning metadata from the evidence in an on-line citation matching scheme
Proceedings of the 6th ACM/IEEE-CS joint conference on Digital libraries
Authorship attribution with thousands of candidate authors
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Single- versus double-blind reviewing: an analysis of the literature
ACM SIGMOD Record
Using position, fonts and cited references to retrieve scientific documents
Journal of Information Science
SS'07 Proceedings of 16th USENIX Security Symposium on USENIX Security Symposium
Double-blind reviewing: more placebo than miracle cure?
ACM SIGCOMM Computer Communication Review
Audience selection for on-line brand advertising: privacy-friendly social network targeting
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
SNARE: a link analytic system for graph labeling and risk detection
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
A Quantitative Assessment of Requirements Engineering Publications --- 1963-2008
REFSQ '09 Proceedings of the 15th International Working Conference on Requirements Engineering: Foundation for Software Quality
Person identification from text and speech genre samples
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
SocialSearch: enhancing entity search with social network matching
Proceedings of the 14th International Conference on Extending Database Technology
HotSec'11 Proceedings of the 6th USENIX conference on Hot topics in security
Citation-based bootstrapping for large-scale author disambiguation
Journal of the American Society for Information Science and Technology
Stylometric analysis of scientific articles
NAACL HLT '12 Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies
SocialSearch+: enriching social network with web evidences
World Wide Web
Hi-index | 0.00 |
Prior studies have questioned the degree of anonymity of the double-blind review process for scholarly research articles. For example, one study based on a survey of reviewers concluded that authors often could be identified by reviewers using a combination of the author's reference list and the referee's personal background knowledge. For the KDD Cup 2003 competition's "Open Task," we examined how well various automatic matching techniques could identify authors within the competition's very large archive of research papers. This paper describes the issues surrounding author identification, how these issues motivated our study, and the results we obtained. The best method, based on discriminative self-citations, identified authors correctly 40--45% of the time. One main motivation for double-blind review is to eliminate bias in favor of well-known authors. However, identification accuracy for authors with substantial publication history is even better (60% accuracy for the top-10% most prolific authors, 85% for authors with 100 or more prior papers).