.png){kind=icon}
.png){kind=icon}
Return
An efficient kernel matrix evaluation measure
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2008.04.005.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study the problem of evaluating the goodness of a kernel matrix for a classification task. As kernel matrix evaluation is usually used in other expensive procedures like feature and model selections, the goodness measure must be Calculated efficiently. Most previous approaches are not efficient except for kernel target alignment (KTA) that can be calculated in O(n(2)) time complexity. Although KTA is widely used, we show that it has some serious drawbacks. We propose an efficient surrogate measure to evaluate the goodness of a kernel matrix based on the data distributions of classes in the feature space. The measure not only overcomes the limitations of KTA but also possesses other properties like invariance, efficiency and an error bound guarantee. Comparative experiments show that the measure is a good indication of the goodness of a kernel matrix. (C) 2008 Elsevier Ltd. All rights reserved.
Keywords:
classification
kernel methods
kernel matrix quality measure
kernel target alignment
class separability measure
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W