The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Text Categorization with Support Vector Machines. How to Represent Texts in Input Space?
Open accessOverview
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
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
Introduction to Modern Information Retrieval
Salton, G., & McGill, M. J. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 11,390
Foundations of statistical natural language processing
Manning, C. D., & Schütze, H. (1999) · Cited by 9,816
An algorithm for suffix stripping
Porter, M. F. (1980) · Program · doi:10.1108/eb046814 · Cited by 8,096
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
Introduction to modern information retrieval
Dillon, M. (1983) · Information Processing & Management · doi:10.1016/0306-4573(83)90062-6 · Cited by 5,909
Text classification from labeled and unlabeled documents using EM
Nigam, K., Mccallum, A. K., Thrun, S., & Mitchell, T. (2000) · Machine Learning · doi:10.1023/a:1007692713085 · Cited by 2,736
Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology
Chao, Y. R., & Zipf, G. K. (1950) · Language · doi:10.2307/409735 · Cited by 2,193
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
Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology.
Hollingshead, A. B., & Zipf, G. K. (1949) · American Sociological Review · doi:10.2307/2086695 · Cited by 1,355
Baayen, R. H. (2001) · Text, Speech and Language Technology · doi:10.1007/978-94-010-0844-0 · Cited by 978
Harter, S. P. (1975) · Journal of the American Society for Information Science · doi:10.1002/asi.4630260402 · Cited by 195
Probabilistic models for automatic indexing
Bookstein, A., & Swanson, D. R. (1974) · Journal of the American Society for Information Science · doi:10.1002/asi.4630250505 · Cited by 181
A probabilistic approach to automatic keyword indexing
Harter, S. P. (1974) · Journal of the American Society for Information Science and Technology · Cited by 147
Quantitative linguistics and complex system studies*
Balasubrahmanyan, V. K., & Naranan, S. (1996) · Journal of Quantitative Linguistics · doi:10.1080/09296179608599629 · Cited by 41
Modelling documents with multiple poisson distributions
Margulis, E. L. (1993) · Information Processing & Management · doi:10.1016/0306-4573(93)90005-x · Cited by 20
Semiotics and Computational Linguistics
Rieger, B. B. (1999) · Studies in fuzziness and soft computing · doi:10.1007/978-3-7908-1873-4_5 · Cited by 9
Semiotics and Computational Linguistics On Semiotic Cognitive Information Processing
Rieger, B. B. (1999) · Cited by 9
(1998)
Cited by
Toward integrating feature selection algorithms for classification and clustering
Liu, H., & Yu, L. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.66 · Cited by 2,706
A comprehensive survey on support vector machine classification: Applications, challenges and trends
Cervantes, J., Garcia-Lamont, F., Rodríguez-Mazahua, L., & Lopez, A. (2020) · Neurocomputing · doi:10.1016/j.neucom.2019.10.118 · Cited by 2,381
The text mining handbook: advanced approaches in analyzing unstructured data
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5684 · Cited by 1,598
Hotho, A., Nürnberger, A., & Paaß, G. (2005) · Journal for Language Technology and Computational Linguistics · doi:10.21248/jlcl.20.2005.68 · Cited by 893
A comparative study of TF*IDF, LSI and multi-words for text classification
Zhang, W., Yoshida, T., & Tang, X. (2011) · Expert Systems with Applications · doi:10.1016/j.eswa.2010.08.066 · Cited by 676
Metadata
- Authors
- Leopold, E., & Kindermann, J.
- Venue
- Machine Learning
- Published
- 2002-01
- Volume
- 46
- Issue
- 1-3
- Pages
- 423-444
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W1493036841
- Cited by
- 403
- References
- 19
- FWCI
- 14.39
- 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.