AI Chat AI Image Generator AI Video Text to Speech

Phoneme discrimination using KS-algebra II

02/25/2013

∙

by Ondrej Such, et al.

∙

∙

KS-algebra consists of expressions constructed with four kinds operations, the minimum, maximum, difference and additively homogeneous generalized means. Five families of Z-classifiers are investigated on binary classification tasks between English phonemes. It is shown that the classifiers are able to reflect well known formant characteristics of vowels, while having very small Kolmogoroff's complexity.

Ondrej Such
4 publications
Lenka Mackovicova
1 publication

page 1

page 2

page 3

page 4

research

∙ 02/25/2013

Phoneme discrimination using KS algebra I

In our work we define a new algebra of operators as a substitute for fuz...

0 Ondrej Such, et al. ∙

research

∙ 02/26/2020

Computational Aspects of Geometric Algebra Products of Two Homogeneous Multivectors

Studies on time and memory costs of products in geometric algebra have b...

0 Stéphane Breuils, et al. ∙

research

∙ 05/21/2015

On the relation between accuracy and fairness in binary classification

Our study revisits the problem of accuracy-fairness tradeoff in binary c...

0 Indre Zliobaite, et al. ∙

research

∙ 06/14/2019

Binary Classification using Pairs of Minimum Spanning Trees or N-ary Trees

One-class classifiers are trained with target class only samples. Intuit...

0 Riccardo La Grassa, et al. ∙

research

∙ 08/25/2020

Evaluating Nonlinear Decision Trees for Binary Classification Tasks with Other Existing Methods

Classification of datasets into two or more distinct classes is an impor...

0 Yashesh Dhebar, et al. ∙

research

∙ 11/12/2018

Markov Property in Generative Classifiers

We show that, for generative classifiers, conditional independence corre...

0 Gherardo Varando, et al. ∙