Context-sensitive learning methods for text categorization
Open accessThe DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Abstract
Two recently implemented machine-learning algorithms, RIPPER and sleeping-experts for phrases , are evaluated on a number of large text categorization problems. These algorithms both construct classifiers that allow the “context” of a word w to affect how (or even whether) the presence or absence of w will contribute to a classification. However, RIPPER and sleeping-experts differ radically in many other respects: differences include different notions as to what constitutes a context, different ways of combining contexts to construct a classifier, different methods to search for a combination of contexts, and different criteria as to what contexts should be included in such a combination. In spite of these differences, both RIPPER and sleeping-experts perform extremely well across a wide variety of categorization problems, generally outperforming previously applied learning methods. We view this result as a confirmation of the usefulness of classifiers that represent contextual information.
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
Proceedings of the 19th International Joint Conference on Artificial Intelligence
Pujol, J. M., Delgado, J., Ramon Sangüesa, A., & Flache, A. (2005) · International Joint Conference on Artificial Intelligence · Cited by 5,771
Proceedings of the 25th international conference on Machine learning
Cohen, W. W., McCallum, A., & Roweis, S. T. (2008) · Cited by 5,691
Self-citationCohen, W. W. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50023-2 · Cited by 3,787
Self-citationIrrelevant Features and the Subset Selection Problem
John, G. H., Kohavi, R., & Pfleger, K. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50023-4 · Cited by 2,368
The Weighted Majority Algorithm
Littlestone, N., & Warmuth, M. K. (1994) · Information and Computation · doi:10.1006/inco.1994.1009 · Cited by 1,975
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
Learning Logical Definitions from Relations
Quinlan, J. R. (1990) · Machine Learning · doi:10.1023/a:1022699322624 · Cited by 1,644
Heterogeneous Uncertainty Sampling for Supervised Learning
Lewis, D. D., & Catlett, J. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50026-x · Cited by 1,150
Automated learning of decision rules for text categorization
Apté, C., Damerau, F., & Weiss, S. M. (1994) · ACM Transactions on Information Systems · doi:10.1145/183422.183423 · Cited by 859
Cited by
SMOTE synthetic minority over-sampling technique
Chawla, N. V., Bowyer, K. W., Hall, L. O., & Kegelmeyer, W. P. (2002) · Journal of Artificial Intelligence Research · doi:10.1613/jair.953 · Cited by 32,865
“We also varied Ripper’s loss ratio ( Cohen & Singer, 1996; Lewis & Catlett, 1994)from 0.9 to 0.001 (as a means of varying misclassification cost)and compared the effect of this variation with the combination of SMOTE and under-sampling.”
MethodInfluentialMachine learning in automated text categorization
Sebastiani, F. (2002) · ACM Computing Surveys · doi:10.1145/505282.505283 · Cited by 7,926
Prediction, Learning, and Games
Cesa-Bianchi, N., & Lugosi, G. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546921 · Cited by 3,162
The text mining handbook: advanced approaches in analyzing unstructured data
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5684 · Cited by 1,598
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
Jumping NLP Curves: A Review of Natural Language Processing Research [Review Article]
Cambria, E., & White, B. (2014) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2014.2307227 · Cited by 1,102
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
Aggarwal, C. C. (2015) · Data Mining · doi:10.1007/978-3-319-14142-8_13 · Cited by 606
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
Feature selection, perception learning, and a usability case study for text categorization
Ng, H. T., Goh, W. B., & Low, K. L. (1997) · Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '97 · doi:10.1145/258525.258537 · Cited by 450
Machine Learning for Information Extraction in Informal Domains
Freitag, D. (2000) · Machine Learning · doi:10.1023/a:1007601113994 · Cited by 350
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
Competitive On‐line Statistics
Vovk, V. (2001) · International Statistical Review · doi:10.1111/j.1751-5823.2001.tb00457.x · Cited by 216
“[31], Cohen and Singer [16]), boosting, game theory and linear programming (Freund and Schapire [29, 28, 30]), pruning decision trees (Helmbold and Schapire [35], Pereira and Singer [46], Takimoto et al.”
BackgroundAdaptive personalization using social networks
Chung, T. S., Wedel, M., & Rust, R. T. (2016) · Journal of the Academy of Marketing Science · doi:10.1007/s11747-015-0441-x · Cited by 184
“The measure F 1 ¼ 2 ⋅ precision ⋅ recall precision þ recall , combines precision and recall in a single quantity as a weighted average (Cohen and Singer 1999).”
A 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
- Cohen, W. W., & Singer, Y.
- Venue
- ACM Transactions on Information Systems
- Published
- 1999-04
- Volume
- 17
- Issue
- 2
- Pages
- 141-173
- ISSN
- 1046-8188 (ISSN-L)
- 1558-2868
- OpenAlex
- W1969572066
- Cited by
- 360
- References
- 39
- FWCI
- 17.50
- Type
- journal article
- 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.