The DOI matches its Crossref record, with a small difference in title or year; 12 of the 12 references it cites were found in a registry or an index.
Feature reduction for neural network based text categorization
Abstract
In a text categorization model using an artificial neural network as the text classifier scalability is poor if the neural network is trained using the raw feature space since textural data has a very high-dimension feature space. We proposed and compared four dimensionality reduction techniques to reduce the feature space into an input space of much lower dimension for the neural network classifier. To test the effectiveness of the proposed model, experiments were conducted using a subset of the Reuters-22173 test collection for text categorization. The results showed that the proposed model was able to achieve high categorization effectiveness as measured by precision and recall. Among the four dimensionality reduction techniques proposed, principal component analysis was found to be the most effective in reducing the dimensionality of the feature space.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Furthermore, it becomes difficult to create a classifier for a large number of features [48] .”
From An efficient instance selection algorithm to reconstruct training set for support vector machine (2017) · cites this paper as [48]
Citations
Cites
Learning Internal Representations by Error Propagation
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1985) · doi:10.21236/ada164453 · Cited by 16,501
Parallel Distributed Processing: Explorations in the Microstructure of Cognition: Foundations
Rumelhart, D. E., McClelland, J. L., & AU (1986) · doi:10.7551/mitpress/5236.001.0001 · Cited by 15,686
Term-Weighting Approaches in Automatic Text Retrieval
Salton, G., & Buckley, C. (1988) · Information Processing & Management · doi:10.1016/0306-4573(88)90021-0 · Cited by 11,421
Goodall, C. R., & Jolliffe, I. T. (1988) · Technometrics · doi:10.2307/1270093 · Cited by 8,797
Jolliffe, I. T. (1986) · Springer series in statistics · doi:10.1007/978-1-4757-1904-8 · Cited by 8,521
An algorithm for suffix stripping
Porter, M. F. (1980) · Program · doi:10.1108/eb046814 · Cited by 8,096
What Size Net Gives Valid Generalization?
Baum, E. B., & Haussler, D. H. (1989) · Neural Computation · doi:10.1162/neco.1989.1.1.151 · Cited by 1,549
Connectionist learning procedures
Hinton, G. E. (1989) · Artificial Intelligence · doi:10.1016/0004-3702(89)90049-0 · Cited by 1,505
Hinton, G. E. (1990) · Elsevier eBooks · doi:10.1016/b978-0-08-051055-2.50029-8 · Cited by 524
The basic ideas in neural networks
Rumelhart, D. E., Widrow, B. C., & Lehr, M. A. (1994) · Communications of the ACM · doi:10.1145/175247.175256 · Cited by 460
Evaluating text categorization
Lewis, D. D. (1991) · DARPA Workshop on Speech and Natural Language (HLT) · doi:10.3115/112405.112471 · Cited by 232
Connectionist ideas and algorithms
Knight, K. K. (1990) · Communications of the ACM · doi:10.1145/92755.92764 · Cited by 115
Research works printed but not linked: 1
- 1992, MATLAB High-Performance Numeric Computation and Visualization Software
Cited by
Machine learning in automated text categorization
Sebastiani, F. (2002) · ACM Computing Surveys · doi:10.1145/505282.505283 · Cited by 8,091
The text mining handbook: advanced approaches in analyzing unstructured data
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5684 · Cited by 1,601
A Survey of Text Classification Algorithms
Aggarwal, C. C., & Zhai, C. (2012) · Springer eBooks · doi:10.1007/978-1-4614-3223-4_6 · Cited by 916
Aggarwal, C. C. (2015) · Springer eBooks · doi:10.1007/978-3-319-14142-8_13 · Cited by 626
Uğuz, H. (2011) · Knowledge-Based Systems · doi:10.1016/j.knosys.2011.04.014 · Cited by 468
Metadata
- Authors
- Lam, S. L. Y., & Lee, D. L.
- Affiliations
- Hong Kong University of Science and Technology (HK)
- ORCID
- Dik Lun Lee
- Venue
- Proceedings. 6th International Conference on Advanced Systems for Advanced Applications
- Publisher
- IEEE Comput. Soc
- Published
- 2003-01-20
- Pages
- 195-202
- OpenAlex
- W2101154521
- Cited by
- 148
- References
- 12
- Citations by year
- 2025: 1 · 2024: 1 · 2023: 6 · 2022: 3 · 2021: 4 · 2020: 3 · 2019: 4 · 2018: 15 · 2017: 10 · 2016: 3 · 2015: 4 · 2014: 7 · 2013: 10 · 2012: 4
- FWCI
- 4.90
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Database Systems for Advanced Applications (publishedVersion)
- Rare & Special e-Zone (The Hong Kong University of Science and Technology) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Text and Document Classification Technologies
- Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Face and Expression Recognition
- Keywords
- text classification, feature reduction, dimensionality reduction, artificial neural networks, principal component analysis, high-dimensional feature space, scalability
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
