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.
- classifier Euclidean distance classifier Minkowski metric classifier polynomial discriminant functions
ASJC Scopus subject areas
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics