The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Evaluating and optimizing autonomous text classification systems
Open accessAbstract
Text retrieval systems typically produce a ranking of documents and let a user decide how far down that ranking to go.In contrast, programs that filter text streams, software that categorizes documents, agents which alert users, and many other IR systems must make decisions without human input or supervision.It is important to define what constitutes good effectiveness for these autonomous systems, tune the systems to achieve the highest possible effectiveness, and estimate how the effectiveness changes as new data is processed.We show how to do this for binary text classification systems, emphasizing that different goals for the system lead to different optimal behaviors.Optimizing and estimating effectiveness is greatly aided if classifiers that explicitly estimate the probability of class membership are used.
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
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
An Introduction to the Theory of Statistics
(1911) · Nature · doi:10.1038/087345a0 · Cited by 4,394
A sequential algorithm for training text classifiers
Lewis, D., & Gale, W. A. (1994) · arXiv (Cornell University) · doi:10.5555/188490.188495 · Cited by 1,731
Self-citationTHE PROBABILITY RANKING PRINCIPLE IN IR
ROBERTSON, S. E. (1977) · Journal of Documentation · doi:10.1108/eb026647 · Cited by 1,103
RELEVANCE: A review of and a framework for the thinking on the notion in information science
Saracevic, T. (1975) · Journal of the American Society for Information Science · doi:10.1002/asi.4630260604 · Cited by 863
Mathematical Theory of Probability and Statistics
(1964) · Elsevier eBooks · doi:10.1016/c2013-0-12460-9 · Cited by 623
An Introduction to the Theory of Statistics
Robinson, J., & Plackett, R. L. (1974) · Biometrics · doi:10.2307/2529637 · Cited by 558
Overview of the Second Text Retrieval Conference (TREC-2)
Harman, D. (1995) · Information Processing & Management · doi:10.1016/0306-4573(94)00047-7 · Cited by 306
On selecting a measure of retrieval effectiveness
Cooper, W. S. (1973) · Journal of the American Society for Information Science · doi:10.1002/asi.4630240204 · Cited by 224
Mathematical Theory of Probability and Statistics
Bergström, H., von Mises, R., Geiringer, H., & Bergstrom, H. (1966) · Technometrics · doi:10.2307/1266701 · Cited by 180
Cited by
Machine learning in automated text categorization
Sebastiani, F. (2002) · ACM Computing Surveys · doi:10.1145/505282.505283 · Cited by 7,926
RCV1: A New Benchmark Collection for Text Categorization Research
Lewis, D., Yang, Y., Rose, T. G., & Li, F. (2004) · Goldsmiths (University of London) · doi:10.5555/1005332.1005345 · Cited by 2,503
Self-citationNaive (Bayes) at forty: The independence assumption in information retrieval
Lewis, D. D. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0026666 · Cited by 2,104
Self-citationThe text mining handbook: advanced approaches in analyzing unstructured data
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5684 · Cited by 1,598
Large-Scale Bayesian Logistic Regression for Text Categorization
Genkin, A., Lewis, D. D., & Madigan, D. (2007) · Technometrics · doi:10.1198/004017007000000245 · Cited by 808
Self-citationA support vector method for multivariate performance measures
Joachims, T. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102399 · Cited by 786
Optimal Thresholding of Classifiers to Maximize F1 Measure
Lipton, Z. C., Elkan, C., & Naryanaswamy, B. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-44851-9_15 · Cited by 596
Evaluating Evaluation Measure Stability
Buckley, C., & Voorhees, E. M. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130373 · Cited by 559
Training algorithms for linear text classifiers
Lewis, D. D., Schapire, R. E., Callan, J. P., & Papka, R. (1996) · Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '96 · doi:10.1145/243199.243277 · Cited by 520
Self-citationCombining classifiers in text categorization
Larkey, L. S., & Croft, W. B. (1996) · Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '96 · doi:10.1145/243199.243276 · Cited by 410
Evaluating evaluation measure stability
Buckley, C., & Voorhees, E. M. (2000) · Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/345508.345543 · Cited by 399
On learning algorithm selection for classification
Ali, S., & Smith, K. A. (2006) · Applied Soft Computing · doi:10.1016/j.asoc.2004.12.002 · Cited by 374
Supervised term weighting for automated text categorization
Debole, F., & Sebastiani, F. (2003) · Proceedings of the 2003 ACM symposium on Applied computing · doi:10.1145/952532.952688 · Cited by 352
Boosting Trees for Anti-Spam Email Filtering
Carreras, X., & Màrquez, L. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0109015 · Cited by 342
Effective Pattern Discovery for Text Mining
Zhong, N., Li, Y., & Wu, S.-T. (2012) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.211 · Cited by 340
An evaluation of statistical spam filtering techniques
Zhang, L., Zhu, J., & Yao, T. (2004) · ACM Transactions on Asian Language Information Processing · doi:10.1145/1039621.1039625 · Cited by 315
Boosting and Rocchio applied to text filtering
Schapire, R. E., Singer, Y., & Singhal, A. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.290996 · Cited by 301
Mining the Biomedical Literature in the Genomic Era: An Overview
Shatkay, H., & Feldman, R. (2003) · Journal of Computational Biology · doi:10.1089/106652703322756104 · Cited by 263
A review of the F-measure: its history, properties, criticism, and alternatives
Christen, P., Hand, D. J., & Kirielle, N. (2024) · ACM Computing Surveys · doi:10.1145/3606367 · Cited by 236
Active learning for biomedical citation screening
Wallace, B. C., Small, K., Brodley, C. E., & Trikalinos, T. A. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835829 · Cited by 123
From classification to quantification in tweet sentiment analysis
Gao, W., & Sebastiani, F. (2016) · Social Network Analysis and Mining · doi:10.1007/s13278-016-0327-z · Cited by 75
Automatically Identifying Health Outcome Information in MEDLINE Records
Demner-Fushman, D., Few, B., Hauser, S. E., & Thoma, G. (2006) · Journal of the American Medical Informatics Association · doi:10.1197/jamia.m1911 · Cited by 35
Metadata
- Authors
- Lewis, D. D.
- Venue
- Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '95
- Publisher
- ACM Press
- Published
- 1995
- Pages
- 246-254
- OpenAlex
- W2153962014
- Cited by
- 308
- References
- 12
- FWCI
- 4.08
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.