.png){kind=icon}
.png){kind=icon}
Return
A regularization framework for multiclass classification: A deterministic annealing approach
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2010.02.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose a general regularization framework for multiclass classification based on discriminant functions. Since the objective function in the primal optimization problem of this framework is always not differentiable, the optimal solution cannot be obtained directly. With the aid of the deterministic annealing approach, a differentiable objective function is derived subject to a constraint on the randomness of the solution. The problem can be approximated by solving a sequence of differentiable optimization problems, and such approximation converges to the original problem asymptotically. Based on this approach, class-conditional posterior probabilities can be calculated directly without assuming the underlying probabilistic model. We also notice that there is a connection between our approach and some existing statistical models, such as Fisher discriminant analysis and logistic regression. (C) 2010 Elsevier Ltd. All rights reserved.
Keywords:
Multiclass classification
Deterministic annealing
Maximum entropy
Fisher discriminant analysis
Logistic regression
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.