HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Computer Science and Engineering >
CSE Conference Papers >

Please use this identifier to cite or link to this item:
Title: Latent Wishart processes for relational kernel learning
Authors: Li, Wu-Jun
Zhang, Zhihua
Yeung, Dit-Yan
Keywords: Latent Wishart processes
Kernel learning
Relational information
Issue Date: Apr-2009
Citation: Proceedings of the 12th International Conference on Artificial Intelligence and Statistics (AISTATS) 2009, Clearwater Beach, Florida, USA, 16-18 April 2009, v. 5, p. 336-343
Abstract: One main concern towards kernel classifiers is on their sensitivity to the choice of kernel function or kernel matrix which characterizes the similarity between instances. Many real-world data, such as web pages and protein-protein interaction data, are relational in nature in the sense that different instances are correlated (linked) with each other. The relational information available in such data often provides strong hints on the correlation (or similarity) between instances. In this paper, we propose a novel relational kernel learning model based on latent Wishart processes (LWP) to learn the kernel function for relational data. This is done by seamlessly integrating the relational information and the input attributes into the kernel learning process. Through extensive experiments on real-world applications, we demonstrate that our LWP model can give very promising performance in practice.
Rights: Reprinted with permission from MIT Press
Appears in Collections:CSE Conference Papers

Files in This Item:

File Description SizeFormat
latent.pdf768KbAdobe PDFView/Open

All items in this Repository are protected by copyright, with all rights reserved.