Polynomial Representation of Classifiers with Independent Discrete-Valued Features

Research output: Contribution to journalArticlepeer-review

Abstract

It is shown that for n-valued conditionally independent features a large family of classifiers can be expressed as an (n—list-degree polynomial discriminant function. The usefulness of the polynomial expansion is discussed and demonstrated by considering the first-order Minkowski metric, the Euclidean distance, and Bayes’ classifiers for the ternary-feature case. Finally, some interesting side observations on the classifiers are made with respect to optimality and computational requirements.

Original languageEnglish (US)
Pages (from-to)205-208
Number of pages4
JournalIEEE Transactions on Computers
VolumeC-21
Issue number2
DOIs
StatePublished - Feb 1972

Keywords

  • Bayes’
  • classifier Euclidean distance classifier Minkowski metric classifier polynomial discriminant functions

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Polynomial Representation of Classifiers with Independent Discrete-Valued Features'. Together they form a unique fingerprint.

Cite this