arrow
返回

An efficient kernel matrix evaluation measure

delete2008-11-01
delete48
PRE
AI
C
Canh Hao Nguyen *
T
Tu Bao Ho
DOI:10.1016/j.patcog.2008.04.005delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

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.
Keyword:
classification
kernel methods
kernel matrix quality measure
kernel target alignment
class separability measure
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Pattern Recognition 封面图
Pattern Recognition
IF:
7.6
论文数:
1.3W
被引数:
4.5W

机构

J
japan advanced institute of science & technology (jaist)
学者数:
2.0K
论文数: 1.9K
被引数: 0
引用论文

引用论文

Kernels and distances for structured data
err2004-12-01
err97
errOAAI
errGärtner, T; Lloyd, JW; Flach, PA
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
Combined SVM-based feature selection and classification
err2005-07-11
err199
errOAAI
errNeumann, J; Schnörr, C; Steidl, G
err分享
err收藏