Polynomial expansion of the binary classification function

03/26/2012

∙

This paper describes a novel method to approximate the polynomial coefficients of regression functions, with particular interest on multi-dimensional classification. The derivation is simple, and offers a fast, robust classification technique that is resistant to over-fitting.

READ FULL TEXT

Polynomial expansion of the binary classification function

Estimating Probability Distributions using "Dirac" Kernels (via Rademacher-Walsh Polynomial Basis Functions)

Optimal designs for estimating individual coefficients in polynomial regression with no intercept

Supervised Hierarchical Classification for Student Answer Scoring

Asymmetric Impurity Functions, Class Weighting, and Optimal Splits for Binary Classification Trees

Near-Linear Time Local Polynomial Nonparametric Estimation

Binary Classification as a Phase Separation Process

On the exact minimization of saturated loss functions for robust regression and subspace estimation

Polynomial expansion of the binary classification function

Related Research

Estimating Probability Distributions using "Dirac" Kernels (via Rademacher-Walsh Polynomial Basis Functions)

Optimal designs for estimating individual coefficients in polynomial regression with no intercept

Supervised Hierarchical Classification for Student Answer Scoring

Asymmetric Impurity Functions, Class Weighting, and Optimal Splits for Binary Classification Trees

Near-Linear Time Local Polynomial Nonparametric Estimation

Binary Classification as a Phase Separation Process

On the exact minimization of saturated loss functions for robust regression and subspace estimation