The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Automated learning of decision rules for text categorization
Open accessAbstract
We describe the results of extensive experiments using optimized rule-based induction methods on large document collections. The goal of these methods is to discover automatically classification patterns that can be used for general document categorization or personalized filtering of free text. Previous reports indicate that human-engineered rule-based systems, requiring many man-years of developmental efforts, have been successfully built to “read” documents and assign topics to them. We show that machine-generated decision rules appear comparable to human performance, while using the identical rule-based representation. In comparison with other machine-learning techniques, results on a key benchmark from the Reuters collection show a large gain in performance, from a previously reported 67% recall/precision breakeven point to 80.5%. In the context of a very high-dimensional feature space, several methodological alternatives are examined, including universal versus local dictionaries, and binary versus frequency-related features.
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
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Lin, S., & Kernighan, B. W. (1973) · Operations Research · doi:10.1287/opre.21.2.498 · Cited by 3,821
Word association norms, mutual information, and lexicography
Church, K., & Hanks, P. (1990) · doi:10.5555/89086.89095 · Cited by 3,590
Quinlan, J. R. (1987) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(87)80053-6 · Cited by 2,553
Clark, P., & Niblett, T. (1989) · Machine Learning · doi:10.1007/bf00116835 · Cited by 2,267
Word association norms, mutual information, and lexicography
Church, K. W., & Hanks, P. (1989) · Proceedings of the 27th annual meeting on Association for Computational Linguistics - · doi:10.3115/981623.981633 · Cited by 1,094
Weiss, S. M. (1990) · Cited by 1,058
Self-citationMichalski, R. S., Mozetič, I., Hong, J., & Nada Lavrač, A. (1986) · National Conference on Artificial Intelligence · Cited by 747
Feature selection and feature extraction for text categorization
Lewis, D. D. (1992) · Proceedings of the workshop on Speech and Natural Language - HLT '91 · doi:10.3115/1075527.1075574 · Cited by 578
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
Classifying news stories using memory based reasoning
Masand, B. M., Linoff, G. S., & Waltz, D. L. (1992) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/133160.133177 · Cited by 260
Evolving agents for personalized information filtering
Sheth, B., & Maes, P. (2002) · Proceedings of 9th IEEE Conference on Artificial Intelligence for Applications · doi:10.1109/caia.1993.366590 · Cited by 231
The Design and Analysis of Pattern Recognition Experiments
Highleyman, W. H. (1962) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1962.tb02426.x · Cited by 134
Weiss, S. M., & Indurkhya, N. (1993) · IEEE Expert · doi:10.1109/64.248354 · Cited by 79
Self-citationIndividual Differences in Organizing, Searching and Retrieving Information.
Saračević, T. (1991) · Proceedings of the American Society for Information Science and Technology · Cited by 76
Maximizing the predictive value of production rules
Weiss, S. M., Galen, R. S., & Tadepalli, P. V. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90037-z · Cited by 74
Self-citationThe automatic indexing system AIR/PHYS - from research to applications
Biebricher, P., Fuhr, N., Lustig, G., Schwantner, M., & Knorz, G. (1988) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/62437.62470 · Cited by 59
Combining model-oriented and description-oriented approaches for probabilistic indexing
Fuhr, N., & Pfeifer, U. (1991) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/122860.122865 · Cited by 24
Cited by
Machine learning in automated text categorization
Sebastiani, F. (2002) · ACM Computing Surveys · doi:10.1145/505282.505283 · Cited by 7,926
Shuman, D. I., Narang, S. K., Frossard, P., Ortega, A., & Vandergheynst, P. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2235192 · Cited by 4,421
“phs. Weighted graphs are also commonly used to represent similarities between data points in statistical learning problems for applications such as machine vision [2] and automatic text classification [3]. In fact, much of the literature on graph-based data analysis techniques emanates from the statistical learning com…”
MethodWavelets on graphs via spectral graph theory
Hammond, D. K., Vandergheynst, P., & Gribonval, R. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.04.005 · Cited by 2,171
The text mining handbook: advanced approaches in analyzing unstructured data
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5684 · Cited by 1,598
Inductive learning algorithms and representations for text categorization
Dumais, S., Platt, J., Heckerman, D., & Sahami, M. (1998) · Proceedings of the seventh international conference on Information and knowledge management · doi:10.1145/288627.288651 · Cited by 1,461
Metadata
- Authors
- Apté, C., Damerau, F., & Weiss, S. M.
- Venue
- ACM Transactions on Information Systems
- Published
- 1994-07
- Volume
- 12
- Issue
- 3
- Pages
- 233-251
- ISSN
- 1046-8188 (ISSN-L)
- 1558-2868
- OpenAlex
- W2094934653
- Cited by
- 859
- References
- 17
- FWCI
- 18.33
- 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.