Classification of ternary data using the ternary Allen–Cahn system for small datasets

In this study, we present a classification method for ternary small data using the modified ternary Allen–Cahn (tAC) system. The governing system is the tAC equation with the fidelity term, which keeps the solution as close as possible to the given data. To solve the tAC system with the fidelity ter...

Full description

Saved in:
Bibliographic Details
Published inAIP advances Vol. 12; no. 6; pp. 065324 - 065324-7
Main Authors Lee, Donghun, Kim, Sangkwon, Lee, Hyun Geun, Kwak, Soobin, Wang, Jian, Kim, Junseok
Format Journal Article
LanguageEnglish
Published Melville American Institute of Physics 01.06.2022
AIP Publishing LLC
Subjects
Accuracy
Algorithms
Artificial neural networks
Classification
Datasets
Decision trees
Finite difference method
Numerical analysis
Robustness (mathematics)
Support vector machines
Online AccessGet full text

Cover

More Information
Summary:In this study, we present a classification method for ternary small data using the modified ternary Allen–Cahn (tAC) system. The governing system is the tAC equation with the fidelity term, which keeps the solution as close as possible to the given data. To solve the tAC system with the fidelity term, we apply an operator splitting method. We use an implicit-explicit finite difference method for solving the split equations. To validate the robust and superior performance of the proposed numerical algorithm, we perform the comparison tests with other widely used classifiers such as logistic regression, decision tree, support vector machine, random forest, and artificial neural network for small datasets.
ISSN:2158-3226
2158-3226
DOI:10.1063/5.0094551