The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Research of Text Classification Based on Improved TF-IDF Algorithm
Abstract
In recent years, with the rapid development of Internet Technology, text data is growing rapidly every day. Users need to filter out the information they need from a large amount of text. Therefore, automatic text classification technology can help users find information. In order to address problems, such as ignoring contextual semantic links and different vocabulary importance in traditional text classification techniques, this paper presents a vector representation of feature words based on the deep learning tool Word2vec, and the weight of the feature words is calculated by the improved TF-IDF algorithm. By multiplying the weight of the word and the word vector, the vector representation of the word is realized. Finally, each text is represented by accumulating all the word vectors. Thus, text classification is carried out.
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
Efficient Estimation of Word Representations in Vector Space
Mikolov, T., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1301.3781 · Cited by 26,568
Cited by
Text Mining: Use of TF-IDF to Examine the Relevance of Words to Documents
Qaiser, S., & Ali, R. (2018) · International Journal of Computer Applications · doi:10.5120/ijca2018917395 · Cited by 827
Classification of online grooming on chat logs using two term weighting schemes
Sulaiman, N. R., & Md. Siraj, M. (2019) · International Journal of Innovative Computing · doi:10.11113/ijic.v9n2.239 · Cited by 5
“Because of the evergrowing Internet and new features of the internet, such as diverse data and extensive sources, an in-depth research on related technologies of text classification still need to be carried out [17].”
Background
Metadata
- Authors
- Liu, C.-Z., Sheng, Y.-X., Wei, Z.-Q., & Yang, Y.-Q.
- Venue
- 2018 IEEE International Conference of Intelligent Robotic and Control Engineering (IRCE)
- Publisher
- IEEE
- Published
- 2018-08
- Pages
- 218-222
- OpenAlex
- W2898041880
- Cited by
- 160
- References
- 1
- FWCI
- 3.43
- Type
- conference paper
- 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.