Graph kernels methods are based on an implicit embedding of graphs within a vector space of large dimension. This implicit embedding allows to apply to graphs methods which where u...
In many pattern recognition applications, high-dimensional feature vectors impose a high computational cost as well as the risk of "overfitting". Feature Selection addre...
Abstract. We evaluated methods of protein classification that use kernels built from BLAST output parameters. Protein sequences were represented as vectors of parameters (e.g. simi...
This paper presents a novel dimension reduction algorithm for kernel based classification. In the feature space, the proposed algorithm maximizes the ratio of the squared between-c...
Senjian An, Wanquan Liu, Svetha Venkatesh, Ronny T...
We extend multiclass SVM to multiple prototypes per class. For this framework, we give a compact constrained quadratic problem and we suggest an efficient algorithm for its optimi...