Categorical Data

2000 ◽  
pp. 94-117
Author(s):  
Phillip Good
Keyword(s):  
Categorical Data

Analyzing sequential categorical data on dyadic interaction: A comment on Gottman.

1982 ◽  
Vol 91 (2) ◽  
pp. 393-403 ◽  
Author(s):  
Paul D. Allison ◽  
Jeffrey K. Liker
Keyword(s):  
Categorical Data ◽  
Dyadic Interaction

Non-Mode Clustering of Categorical Data with Attributes Weighting

2014 ◽  
Vol 24 (11) ◽  
pp. 2628-2641 ◽  
Author(s):  
Li-Fei CHEN ◽  
Gong-De GUO
Keyword(s):  
Categorical Data

Machine Learning Based Predictive Action on Categorical Non-Sequential Data

2020 ◽  
Vol 13 (5) ◽  
pp. 1020-1030
Author(s):  
Pradeep S. ◽  
Jagadish S. Kallimani
Keyword(s):  
Machine Learning ◽  
Data Analysis ◽  
Categorical Data ◽  
Numerical Data ◽  
Processing Technique ◽  
Machine Learning Algorithms ◽  
Sequential Data ◽  
Industry Standard ◽  
Robust Model ◽  
Future Work

Background: With the advent of data analysis and machine learning, there is a growing impetus of analyzing and generating models on historic data. The data comes in numerous forms and shapes with an abundance of challenges. The most sorted form of data for analysis is the numerical data. With the plethora of algorithms and tools it is quite manageable to deal with such data. Another form of data is of categorical nature, which is subdivided into, ordinal (order wise) and nominal (number wise). This data can be broadly classified as Sequential and Non-Sequential. Sequential data analysis is easier to preprocess using algorithms. Objective: The challenge of applying machine learning algorithms on categorical data of nonsequential nature is dealt in this paper. Methods: Upon implementing several data analysis algorithms on such data, we end up getting a biased result, which makes it impossible to generate a reliable predictive model. In this paper, we will address this problem by walking through a handful of techniques which during our research helped us in dealing with a large categorical data of non-sequential nature. In subsequent sections, we will discuss the possible implementable solutions and shortfalls of these techniques. Results: The methods are applied to sample datasets available in public domain and the results with respect to accuracy of classification are satisfactory. Conclusion: The best pre-processing technique we observed in our research is one hot encoding, which facilitates breaking down the categorical features into binary and feeding it into an Algorithm to predict the outcome. The example that we took is not abstract but it is a real – time production services dataset, which had many complex variations of categorical features. Our Future work includes creating a robust model on such data and deploying it into industry standard applications.

Categorical Data Analysis for Geographers and Environmental Scientists

1986 ◽  
Vol 62 (2) ◽  
pp. 192 ◽  
Author(s):  
Joel L. Horowitz ◽  
Neil Wrigley
Keyword(s):  
Data Analysis ◽  
Categorical Data ◽  
Categorical Data Analysis

scholarly journals Deep Neural Networks Classification via Binary Error-Detecting Output Codes

2021 ◽  
Vol 11 (8) ◽  
pp. 3563
Author(s):  
Martin Klimo ◽  
Peter Lukáč ◽  
Peter Tarábek
Keyword(s):  
Neural Networks ◽  
Categorical Data ◽  
Coding Theory ◽  
Hamming Distance ◽  
Activation Function ◽  
Block Codes ◽  
Ease Of Use ◽  
Linear Block Codes ◽  
Binary Coding ◽  
The One

One-hot encoding is the prevalent method used in neural networks to represent multi-class categorical data. Its success stems from its ease of use and interpretability as a probability distribution when accompanied by a softmax activation function. However, one-hot encoding leads to very high dimensional vector representations when the categorical data’s cardinality is high. The Hamming distance in one-hot encoding is equal to two from the coding theory perspective, which does not allow detection or error-correcting capabilities. Binary coding provides more possibilities for encoding categorical data into the output codes, which mitigates the limitations of the one-hot encoding mentioned above. We propose a novel method based on Zadeh fuzzy logic to train binary output codes holistically. We study linear block codes for their possibility of separating class information from the checksum part of the codeword, showing their ability not only to detect recognition errors by calculating non-zero syndrome, but also to evaluate the truth-value of the decision. Experimental results show that the proposed approach achieves similar results as one-hot encoding with a softmax function in terms of accuracy, reliability, and out-of-distribution performance. It suggests a good foundation for future applications, mainly classification tasks with a high number of classes.

Sign in / Sign up

Export Citation Format

Share Document