The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Boosting and Rocchio applied to text filtering
Abstract
We discuss two learning algorithms for text filtering: modified Rocchio and a boosting algorithm called AdaBoost. We show how both algorithms can be adapted to maximize any general utility matrix that associates cost (or gain) for each pair of machine prediction and correct label. We first show that AdaBoost significantly outperforms another highly effective text filtering algorithm. We then compare AdaBoost and Rocchio over three large text filtering tasks. Overall both algorithms are comparable and are quite effective. AdaBoost produces better classifiers than Rocchio when the training collection contains a very large number of relevant documents. However, on these tasks, Rocchio runs much faster than AdaBoost. 1 Introduction With the explosion in the amount of information available electronically, information filtering systems that automatically send articles of potential interest to a user are becoming increasingly important. If users indicate their interests to a filtering system...
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 decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
Self-citationIntroduction to Modern Information Retrieval
Salton, G., & McGill, M. J. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 11,392
Text categorization with Support Vector Machines: Learning with many relevant features
Joachims, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0026683 · Cited by 7,999
A vector space model for automatic indexing
Salton, G., Wong, A., & Yang, C. S. (1975) · Communications of the ACM · doi:10.1145/361219.361220 · Cited by 7,521
Automatic text processing: the transformation, analysis, and retrieval of information by computer
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0351 · Cited by 3,188
Relevance feedback in information retrieval
Rocchio, J. J. (1971) · Medical Entomology and Zoology · Cited by 2,680
The SMART Retrieval System—Experiments in Automatic Document Processing
Salton, G. (1971) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,252
An Evaluation of Statistical Approaches to Text Categorization
Yang, Y. (1999) · Information Retrieval · doi:10.1023/a:1009982220290 · Cited by 1,943
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
Quinlan, J. R. (1996) · National Conference on Artificial Intelligence · Cited by 1,586
Cited by
Machine learning in automated text categorization
Sebastiani, F. (2002) · ACM Computing Surveys · doi:10.1145/505282.505283 · Cited by 7,926
Selecting thresholds of occurrence in the prediction of species distributions
Liu, C., Berry, P. M., Dawson, T. P., & Pearson, R. G. (2005) · Ecography · doi:10.1111/j.0906-7590.2005.03957.x · Cited by 2,701
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
Exploratory Undersampling for Class-Imbalance Learning
Liu, X.-Y., Wu, J., & Zhou, Z.-H. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2008.2007853 · Cited by 2,465
The Boosting Approach to Machine Learning: An Overview
Schapire, R. E. (2003) · Lecture Notes in Statistics · doi:10.1007/978-0-387-21579-2_9 · Cited by 2,003
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
Machine learning: a review of classification and combining techniques
Kotsiantis, S. B., Zaharakis, I. D., & Pintelas, P. E. (2006) · Artificial Intelligence Review · doi:10.1007/s10462-007-9052-3 · Cited by 1,582
Support vector machines for spam categorization
Drucker, H., Wu, D., & Vapnik, V. N. (1999) · IEEE Transactions on Neural Networks · doi:10.1109/72.788645 · Cited by 1,471
A Survey of Text Classification Algorithms
Aggarwal, C. C., & Zhai, C. (2012) · Mining Text Data · doi:10.1007/978-1-4614-3223-4_6 · Cited by 842
A hidden Markov model information retrieval system
Miller, D. R. H., Leek, T., & Schwartz, R. M. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312680 · Cited by 469
Detection of Depression-Related Posts in Reddit Social Media Forum
Tadesse, M. M., Lin, H., Xu, B., & Yang, L. (2019) · IEEE Access · doi:10.1109/access.2019.2909180 · Cited by 463
An Introduction to Boosting and Leveraging
Meir, R., & Rätsch, G. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36434-x_4 · Cited by 447
The area under the precision‐recall curve as a performance metric for rare binary events
Sofaer, H. R., Hoeting, J. A., & Jarnevich, C. S. (2019) · Methods in Ecology and Evolution · doi:10.1111/2041-210x.13140 · Cited by 375
An information-theoretic approach to automatic query expansion
Carpineto, C., de Mori, R., Romano, G., & Bigi, B. (2001) · ACM Transactions on Information Systems · doi:10.1145/366836.366860 · Cited by 365
Context-sensitive learning methods for text categorization
Cohen, W. W., & Singer, Y. (1999) · ACM Transactions on Information Systems · doi:10.1145/306686.306688 · Cited by 360
Self-citationA study of thresholding strategies for text categorization
Yang, Y. (2001) · Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/383952.383975 · Cited by 358
Cost-sensitive learning methods for imbalanced data
Thai-Nghe, N., Gantner, Z., & Schmidt-Thieme, L. (2010) · The 2010 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2010.5596486 · Cited by 342
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
Information retrieval and text mining technologies for chemistry
Krallinger, M., Rabal, O., Lourenço, A., Oyarzabal, J., & Valencia, A. (2017) · Chemical Reviews · doi:10.1021/acs.chemrev.6b00851 · Cited by 281
The use of bigrams to enhance text categorization
Tan, C.-M., Wang, Y.-F., & Lee, C.-D. (2002) · Information Processing & Management · doi:10.1016/s0306-4573(01)00045-0 · Cited by 290
Automatic classification of literature in systematic reviews on food safety using machine learning
van den Bulk, L. M., Bouzembrak, Y., Gavai, A., Liu, N., van den Heuvel, L. J., & Marvin, H. J. P. (2022) · Current Research in Food Science · doi:10.1016/j.crfs.2021.12.010 · Cited by 38
“AB has been applied successfully on text classification tasks in previous research (Schapire et al., 1998; Bloehdorn and Hotho, 2004; Zhang et al., 2016).”
MethodA Balanced Ensemble Approach to Weighting Classifiers for Text Classification
Cheong Fung, G., Yu, J., Wang, H., Cheung, D., & Liu, H. (2006) · Sixth International Conference on Data Mining (ICDM'06) · doi:10.1109/icdm.2006.2 · Cited by 20
Metadata
- Authors
- Schapire, R. E., Singer, Y., & Singhal, A.
- Venue
- Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
- Publisher
- ACM
- Published
- 1998-08
- Pages
- 215-223
- OpenAlex
- W2040424159
- Cited by
- 301
- References
- 34
- FWCI
- 14.62
- Type
- conference paper
- 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.