The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Some Effective Techniques for Naive Bayes Text Classification
Abstract
While naive Bayes is quite effective in various data mining tasks, it shows a disappointing result in the automatic text classification problem. Based on the observation of naive Bayes for the natural language text, we found a serious problem in the parameter estimation process, which causes poor results in text classification domain. In this paper, we propose two empirical heuristics: per-document text normalization and feature weighting method. While these are somewhat ad hoc methods, our proposed naive Bayes text classifier performs very well in the standard benchmark collections, competing with state-of-the-art text classifiers based on a highly complex learning method such as SVM.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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 Comparative Study on Feature Selection in Text Categorization
Yang, Y., & Pedersen, J. (1997) · Cited by 4,790
Zhang, J., & Yu, K. F. (1998) · JAMA · doi:10.1001/jama.280.19.1690 · Cited by 4,138
On the Optimality of the Simple Bayesian Classifier under Zero-One Loss
Domingos, P., & Pazzani, M. (1997) · Machine Learning · doi:10.1023/a:1007413511361 · Cited by 3,101
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
A re-examination of text categorization methods
Yang, Y., & Liu, X. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312647 · Cited by 2,652
BoosTexter: A Boosting-based System for Text Categorization
Schapire, R. E., & Singer, Y. (2000) · Machine Learning · doi:10.1023/a:1007649029923 · Cited by 2,188
Naive (Bayes) at forty: The independence assumption in information retrieval
Lewis, D. D. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0026666 · Cited by 2,104
Toward optimal feature selection
Koller, D., & Sahami, M. (1996) · Cited by 1,482
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
A Probabilistic Analysis of the Rocchio Algorithm with TFIDF for Text Categorization
Joachims, T. (1997) · Cited by 1,262
Employing EM and Pool-Based Active Learning for Text Classification
McCallum, A., & Nigam, K. (1998) · Cited by 689
An 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
Okapi at TREC-7: Automatic Ad Hoc, Filtering, VLC and Interactive.
Robertson, S. E., Walker, S., & Hancock‐Beaulieu, M. (1998) · Text REtrieval Conference · Cited by 341
Feature subset selection in text-learning
Mladenić, D. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0026677 · Cited by 171
Cited by
Content-based Recommender Systems: State of the Art and Trends
Lops, P., de Gemmis, M., & Semeraro, G. (2011) · Recommender Systems Handbook · doi:10.1007/978-0-387-85820-3_3 · Cited by 1,898
Text Classification Algorithms: A Survey
Kowsari, K., Jafari Meimandi, K., Heidarysafa, M., Mendu, S., Barnes, L., & Brown, D. (2019) · Information · doi:10.3390/info10040150 · Cited by 1,312
A Review of Machine Learning Algorithms for Text-Documents Classification
Baharudin, B., Lee, L. H., & Khan, K. (2010) · Journal of Advances in Information Technology · doi:10.4304/jait.1.1.4-20 · Cited by 653
Feature selection for text classification with Naïve Bayes
Chen, J., Huang, H., Tian, S., & Qu, Y. (2009) · Expert Systems with Applications · doi:10.1016/j.eswa.2008.06.054 · Cited by 576
A brief survey on sequence classification
Xing, Z., Pei, J., & Keogh, E. (2010) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1882471.1882478 · Cited by 553
Metadata
- Authors
- Kim, S.-B., Han, K.-S., Rim, H.-C., & Myaeng, S. H.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2006-11
- Volume
- 18
- Issue
- 11
- Pages
- 1457-1466
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2135813353
- Cited by
- 576
- References
- 15
- FWCI
- 10.33
- Type
- journal article
- 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.