Multiclass penalized likelihood pattern classification algorithm

Publication Type:
Conference Proceeding
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, 7665 LNCS (PART 3), pp. 141 - 148
Issue Date:
Filename Description Size
Thumbnail2012001565OK.pdf406.14 kB
Adobe PDF
Full metadata record
Penalized likelihood is a general approach whereby an objective function is defined, consisting of the log likelihood of the data minus some term penalizing non-smooth solutions. Subsequently, this objective function is maximized, yielding a solution that achieves some sort of trade-off between the faithfulness and the smoothness of the fit. In this paper we extend the penalized likelihood classification that we proposed in earlier work to the multi class case. The algorithms are based on using a penalty term based on the K-nearest neighbors and the likelihood of the training patterns' classifications. The algorithms are simple to implement, and result in a performance competitive with leading classifiers. © 2012 Springer-Verlag.
Please use this identifier to cite or link to this item: