The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
A Deep-Learned Embedding Technique for Categorical Features Encoding
Open accessAbstract
Many machine learning algorithms and almost all deep learning architectures are incapable of processing plain texts in their raw form. This means that their input to the algorithms must be numerical in order to solve classification or regression problems. Hence, it is necessary to encode these categorical variables into numerical values using encoding techniques. Categorical features are common and often of high cardinality. One-hot encoding in such circumstances leads to very high dimensional vector representations, raising memory and computability concerns for machine learning models. This paper proposes a deep-learned embedding technique for categorical features encoding on categorical datasets. Our technique is a distributed representation for categorical features where each category is mapped to a distinct vector, and the properties of the vector are learned while training a neural network. First, we create a data vocabulary that includes only categorical data, and then we use word tokenization to make each categorical data a single word. After that, feature learning is introduced to map all of the categorical data from the vocabulary to word vectors. Three different datasets provided by the University of California Irvine (UCI) are used for training. The experimental results show that the proposed deep-learned embedding technique for categorical data provides a higher F1 score of 89% than 71% of one-hot encoding, in the case of the Long short-term memory (LSTM) model. Moreover, the deep-learned embedding technique uses less memory and generates fewer features than one-hot encoding.
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
Glove: Global Vectors for Word Representation
Pennington, J., Socher, R., & Manning, C. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1162 · Cited by 34,071
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
Distributed Representations of Words and Phrases and their Compositionality
Mikolov, T., Sutskever, I., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1310.4546 · Cited by 24,533
Applied Multiple Regression/Correlation Analysis for the Behavioral Sciences
Cohen, P., Cohen, P., West, S. G., & Aiken, L. S. (2014) · Psychology Press eBooks · doi:10.4324/9781410606266 · Cited by 20,737
Bidirectional recurrent neural networks
Schuster, M., & Paliwal, K. K. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.650093 · Cited by 10,172
Enriching Word Vectors with Subword Information
Bojanowski, P., Grave, E., Joulin, A., & Mikolov, T. (2017) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00051 · Cited by 9,645
Applied Multiple Regression/Correlation Analysis for the Behavioral Sciences
Kemp, F. (2003) · Journal of the Royal Statistical Society: Series D (The Statistician) · doi:10.1046/j.1467-9884.2003.t01-2-00383_4.x · Cited by 9,293
Natural Language Processing (almost) from Scratch
Collobert, R., Weston, J., Bottou, L., Karlen, M., Kavukcuoglu, K., & Kuksa, P. P. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1103.0398 · Cited by 4,962
Recent Trends in Deep Learning Based Natural Language Processing [Review Article]
Young, T., Hazarika, D., Poria, S., & Cambria, E. (2018) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2018.2840738 · Cited by 2,921
A neural probabilistic language model
BengioYoshua, DucharmeRéjean, VincentPascal, & JanvinChristian (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944966 · Cited by 2,644
Research works printed but not linked: 10
- sun, 2019, Supercaptioning: Image captioning using two-dimensional word embedding, CoRR, abs 1905 10515, 1
- garg, 2017, Word embeddings quantify 100 years of gender and ethnic stereotypes, CoRR, abs 1711 8412, 1
- sun, 2019, SuperTML: Two-dimensional word embedding and transfer learning using ImageNet pretrained CNN models for the classifications on tabular data, CoRR, abs 1903 6246, 1
- roy, 2020, Type of Categorical Encoding
- shao, 2017, Cross-lingual word segmentation and morpheme segmentation as sequence labelling, CoRR, abs 1709 3756, 1
- 10.1007/3-540-44989-2_43 · doi:10.1007/3-540-44989-2_43
- duch, 2000, Symbolic features in neural networks, Proc 5th Conf Neural Netw Appl, 180
- sethi, 2019, One-Hot Encoding vs Label Encoding Using Scikit-Learn
- chollet, 2017, Deep Learning with Python
- roy, 2020, All About Categorical Variable Encoding
Cited by
Temporal feature aggregation with attention for insider threat detection from activity logs
Pal, P., Chattopadhyay, P., & Swarnkar, M. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.119925 · Cited by 52
Lamaakal, I., Yahyati, C., Maleh, Y., El Makkaoui, K., Ouahbi, I., El-Latif, A. A. A., Zomorodi, M., & El-Rahiem, B. A. (2025) · Scientific Reports · doi:10.1038/s41598-025-26297-2 · Cited by 26
A unified privacy preserving model with AI at the edge for human-in-the-loop cyber-physical systems
Rivadeneira, J. E., Borges, G. A., Rodrigues, A., Boavida, F., & Sá Silva, J. (2024) · Internet of Things · doi:10.1016/j.iot.2023.101034 · Cited by 18
Metadata
- Authors
- Dahouda, M. K., & Joe, I.
- Venue
- IEEE Access
- Published
- 2021
- Volume
- 9
- Pages
- 114381-114391
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W3195971125
- Cited by
- 294
- References
- 29
- FWCI
- 13.59
- Type
- journal article
- Language
- en
- Open access
- gold
- Funders
- Institute for Information and Communication Technology Promotion (IITP) funded by Korea Government [Ministry of Science, ICT and Future Planning (MSIP)] (2020-0-00107)
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Deep-Learned Embedding Technique for Categorical Features Encoding. https://app.cochat.ai/papers/10.1109/access.2021.3104357
- The paper
- Dahouda, M. K., & Joe, I. (2021). A Deep-Learned Embedding Technique for Categorical Features Encoding. IEEE Access. https://doi.org/10.1109/access.2021.3104357
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.