Name
Abstract | ||
|---|---|---|
Kernel learning methods based on kernel alignment with semidefinite programming (SDP) are often memory intensive and computationally expensive, thus often impractical for problems with large-size dataset. We propose a method using label information to modify kernels based on SVD and a linear mapping. As a result, the new kernel matrix reflects the label-dependent separability of the data in a better way than the original kernel matrix. In addition, our experimental results on USPS handwritten digits and the SCOP dataset, show that the SVM classifier based on the improved kernels has better performance than the SVM classifier based on the original kernels; moreover, SVM based on the improved Profile kernel with pull-in homologs (see experiment section for explanations) produced the best results for remote homology detection on the SCOP dataset compared to the published results. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/ICMLA.2007.76 | ICMLA |
Keywords | Field | DocType |
svm classifier,improved kernel,new kernel matrix,large-size dataset,modifying kernels,original kernel matrix,improved profile kernel,label information improves svm,kernel alignment,original kernel,better performance,classification performance,scop dataset,support vector machines,kernel matrix,mathematical programming,linear mapping,semidefinite programming | Kernel (linear algebra),Singular value decomposition,Pattern recognition,Computer science,Support vector machine,Kernel alignment,Tree kernel,Artificial intelligence,Linear map,Svm classifier,Machine learning,Semidefinite programming | Conference |
ISBN | Citations | PageRank |
0-7695-3069-9 | 19 | 1.05 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Renqiang Min | 1 | 149 | 17.61 |
| Anthony J. Bonner | 2 | 733 | 422.63 |
| Zhaolei Zhang | 3 | 237 | 19.25 |