CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2008 vol.30 Issue No.04 - April
Issue No.04 - April (2008 vol.30)
This paper presents a deterministic solution to an approximated classification-error based objectivefunction. In the formulation, we propose a quadratic approximation as the function for achieving smootherror counting. The solution is subsequently found to be related to the weighted least-squares wherebya robust tuning process can be incorporated. The tuning traverses between the least-squares estimateand the approximated total-error-rate estimate to cater for various situations of unbalanced attributedistributions. By adopting a linear parametric classifier model, the proposed classification-error basedlearning formulation is empirically shown to be superior to that using the original least-squares-errorcost function. Finally, it will be seen that the performance of the proposed formulation is comparableto other classification-error based and state-of-the-art classifiers without sacrificing the computationalsimplicity.
Pattern Classification, Classification Error Rate, Discriminant Functions, Polynomials andMachine Learning
Kar-Ann Toh, How-Lung Eng, "Between Classification-Error Approximation and Weighted Least-Squares Learning", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.30, no. 4, pp. 658-669, April 2008, doi:10.1109/TPAMI.2007.70730