Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 294

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 access
Dahouda, Mwamba Kasongo, Joe, Inwhee · 2021 · IEEE Access

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/access.2021.3104357

Cites

29 of 29 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 29 references

Research works printed but not linked: 10

  1. sun, 2019, Supercaptioning: Image captioning using two-dimensional word embedding, CoRR, abs 1905 10515, 1
  2. garg, 2017, Word embeddings quantify 100 years of gender and ethnic stereotypes, CoRR, abs 1711 8412, 1
  3. 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
  4. roy, 2020, Type of Categorical Encoding
  5. shao, 2017, Cross-lingual word segmentation and morpheme segmentation as sequence labelling, CoRR, abs 1709 3756, 1
  6. 10.1007/3-540-44989-2_43 · doi:10.1007/3-540-44989-2_43
  7. duch, 2000, Symbolic features in neural networks, Proc 5th Conf Neural Netw Appl, 180
  8. sethi, 2019, One-Hot Encoding vs Label Encoding Using Scikit-Learn
  9. chollet, 2017, Deep Learning with Python
  10. roy, 2020, All About Categorical Variable Encoding

Cited by

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

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.