.png){kind=icon}
Return
Generalized RBF kernel for incomplete data
.png){kind=icon}
OA
AI
DOI：10.1016/j.knosys.2019.02.034.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We construct genRBF kernel, which generalizes standard Gaussian RBF kernel to the case of incomplete data. Instead of using typical imputation techniques, which fill missing attributes by single values, we model possible outcomes at missing coordinates using data distribution. This allows to derive analytical formula for the expected value of RBF kernel taken over all possible imputations, which is a basic idea behind our method. In particular, for complete observations genRBF reduces to standard RBF kernel. Experiments show that introduced kernel applied to SVM classifier and regressor gives better results than state-of-the-art methods, especially in the case when large number of features is missing. Moreover, genRBF is easy to implement and can be used together with any kernel approach without any additional modifications. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
Incomplete data
Missing values
SVM
Kernel methods
RBF
Journal
K
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
Cited Papers
ShareSaveAdjusted weight voting algorithm for random forests in handling missing values.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
ShareSaveSelection-fusion approach for classification of datasets with missing valuesPATTERN RECOGNITIONOAAI
PATTERN RECOGNITIONIF7.6
OAAIShareSaveAdaptive imputation of missing values for incomplete pattern classificationPATTERN RECOGNITIONOAAI
PATTERN RECOGNITIONIF7.6
OAAIShareSaveShareSaveShareSaveShareSave
ShareSave no more
no more