Skip navigation
Skip navigation

Non-Parametric Kernel Learning with robust pairwise constraints

Chen, Changyou; Zhang, Junping; He, Xuefang; Zhou, Zhi-Hua


For existing kernel learning based semi-supervised clustering algorithms, it is generally difficult to scale well with large scale datasets and robust pairwise constraints. In this paper, we propose a new Non-Parametric Kernel Learning (NPKL) framework to deal with these problems. We generalize the graph embedding framework into kernel learning, by reforming it as a semi-definitive programming (SDP) problem, smoothing and avoiding over-smoothing the functional Hilbert space with Laplacian...[Show more]

CollectionsANU Research Publications
Date published: 2012
Type: Journal article
Source: International Journal of Machine Learning and Cybernetics
DOI: 10.1007/s13042-011-0048-6


File Description SizeFormat Image
01_Chen_Non-Parametric_Kernel_Learning_2012.pdf1.07 MBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator