The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Context-sensitive learning methods for text categorization
Open accessAbstract
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
Learning with many irrelevant features
Almuallim, H., & Dietterich, T. G. (1991) · Cited by 623
Developments in Automatic Text Retrieval
Salton, G. (1991) · Science · doi:10.1126/science.253.5023.974 · Cited by 619
Vovk, V. G. (1990) · Conference on Learning Theory · doi:10.5555/92571.92672 · Cited by 551
An evaluation of phrasal and clustered representations on a text categorization task
Lewis, D. D. (1992) · Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '92 · doi:10.1145/133160.133172 · Cited by 544
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
WebWatcher: A Learning Apprentice for the World Wide Web
Armstrong, R., Freitag, D., Joachims, T., & Mitchell, T. (1995) · doi:10.21236/ada640219 · Cited by 500
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
Littlestone, N. (1988) · Machine Learning · doi:10.1007/bf00116827 · Cited by 497
A comparison of classifiers and document representations for the routing problem
Schütze, H., Hull, D. A., & Pedersen, J. O. (1995) · Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '95 · doi:10.1145/215206.215365 · Cited by 453
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
Incremental Reduced Error Pruning
Fürnkranz, J., & Widmer, G. (1994) · Elsevier eBooks · doi:10.1016/b978-1-55860-335-6.50017-9 · Cited by 439
Learning Rules that Classify E-Mail
Cohen, W. W. (1996) · Cited by 406
Self-citationAn example-based mapping method for text categorization and retrieval
Yang, Y., & Chute, C. G. (1994) · ACM Transactions on Information Systems · doi:10.1145/183422.183424 · Cited by 404
Boolean Feature Discovery in Empirical Learning
Pagallo, G., & Haussler, D. (1990) · Machine Learning · doi:10.1023/a:1022611825350 · Cited by 390
Stemming algorithms: A case study for detailed evaluation
Hull, D. A. (1996) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199601)47:1<70::aid-asi7>3.3.co;2-q · Cited by 369
The Effect of Adding Relevance Information in a Relevance Feedback Environment
Buckley, C., Salton, G., & Allan, J. (1994) · SIGIR ’94 · doi:10.1007/978-1-4471-2099-5_30 · Cited by 302
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
Self-citationLearning Trees an ules with Set-val ed Features
Cohen, W. W. (1996) · Cited by 247
Self-citationUsing and combining predictors that specialize
Freund, Y., Schapire, R. E., Singer, Y., & Warmuth, M. K. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258616 · Cited by 234
Self-citationChurch, K. W., & Gale, W. A. (1995) · Natural Language Engineering · doi:10.1017/s1351324900000139 · Cited by 215
Optimization of relevance feedback weights
Buckley, C., & Salton, G. (1995) · Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '95 · doi:10.1145/215206.215383 · Cited by 185
Cesa‐Bianchi, N., Freund, Y., Helmbold, D. P., Haussler, D. H., Schapire, R. E., & Warmuth, M. K. (1993) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/167088.167198 · Cited by 143
Method combination for document filtering
Hull, D. A., Pedersen, J., & Schütze, H. (1996) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/243199.243275 · Cited by 103
MDL and Categorical Theories (Continued)
Quinlan, J. R. (1995) · Elsevier eBooks · doi:10.1016/b978-1-55860-377-6.50064-5 · Cited by 86
Efficient Pruning Methods for Separate-and-Conquer Rule Learning Systems.
Cohen, W. W. (1993) · Cited by 83
Self-citationBlum, A. L. (1995) · Elsevier eBooks · doi:10.1016/b978-1-55860-377-6.50017-7 · Cited by 72
Text Categorization and Relational Learning
Cohen, W. W. (1995) · Elsevier eBooks · doi:10.1016/b978-1-55860-377-6.50024-4 · Cited by 67
Self-citationHYDRA: A Noise-tolerant Relational Concept Learning Algorithm.
Ali, K., & Pazzani, M. J. (1993) · eScholarship (California Digital Library) · Cited by 59
Cohen, W. W., & Singer, Y. (1996) · Cited by 33
Self-citation
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
Machine 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
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.