MLMar 26, 2012
Polynomial expansion of the binary classification function
arXiv:1203.5647v11.71 citations
Originality Synthesis-oriented
AI Analysis
This addresses classification challenges for users needing efficient and reliable methods, though it appears incremental as it builds on existing polynomial expansion approaches.
The paper tackles the problem of approximating polynomial coefficients for regression functions in multi-dimensional classification, resulting in a fast and robust classification technique that resists over-fitting.
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.