Semi-supervised classification with Laplacian multiple kernel learning

详细信息    查看全文

• 作者：Tao Yang ; ^{yang_taoustb@126.com" class="auth_mail}Author Vitae ; Dongmei FuAuthor Vitae
• 关键词：Semi-supervised classification ; Graph-based regularizer ; Multiple kernel learning
• 刊名：Neurocomputing
• 出版年：22 September 2014
• 年：2014
• 卷：140
• 期：Complete
• 页码：19-26
• 全文大小：606 K

文摘

Laplacian Support Vector Machine (lapSVM) is a SVM with an additional graph-based regularization for semi-supervised learning (SSL). As its base classifier is a single kernel SVM, it may be inefficient to deal with multi-source or multi-attribute complex datasets. Instead of one single kernel, we know that multiple kernels could correspond to different notions of similarity or information from multiple sources and represent differences between features. Therefore, we extend lapSVM to multiple kernel occasion, namely Laplacian Multiple Kernel Learning (lapMKL), improving the ability of processing more complex data in semi-supervised classification task. The proposed lapMKL is solved by Level Method, which was used in multiple kernel learning (MKL) and showed relatively high efficiency. Experiments on several data sets and comparisons with state of the art methods show that the proposed lapMKL is competitive and even better.