Latent Wishart Processes for Relational Kernel Learning

نویسندگان

  • Wu-Jun Li
  • Zhihua Zhang
  • Dit-Yan Yeung
چکیده

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 realworld data, such as web pages and proteinprotein 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 realworld applications, we demonstrate that our LWP model can give very promising performance in practice.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gaussian and Wishart Hyperkernels

We propose a new method for constructing hyperkenels and define two promising special cases that can be computed in closed form. These we call the Gaussian and Wishart hyperkernels. The former is especially attractive in that it has an interpretable regularization scheme reminiscent of that of the Gaussian RBF kernel. We discuss how kernel learning can be used not just for improving the perform...

متن کامل

Probabilistic Kernel Matrix Learning with a Mixture Model of Kernels

This paper addresses the kernel matrix learning problem in kernel methods. We model the kernel matrix as a random positive definite matrix following the Wishart distribution, with the parameter matrix of the Wishart distribution represented as a linear combination of mutually independent matrices with their own Wishart distributions. This defines a probabilistic mixture model of kernels that ca...

متن کامل

Filtering Effect in Supervised Classification of Polarimetric Ground Based SAR Images

We investigated the speckle filtering effect in supervised classification of the C-band polarimetric Ground Based SAR image data. Wishart classification method was used for the supervised classification of the polarimetric GB-SAR image data and total of 6 kinds of speckle filters were applied before supervised classification, which are boxcar, Gaussian, Lopez, IDAN, the refined Lee, and the ref...

متن کامل

Unsupervised Spatial, Temporal and Relational Models for Social Processes

This thesis addresses two challenges in extracting patterns from social data generated by modern sensor systems and electronic mechanisms. First, that such data often combine spatial, temporal, and relational evidence, requiring models that properly utilize the regularities of each domain. Second, that data from open-ended systems often contain a mixture between entities and relationships that ...

متن کامل

subgraph2vec: Learning Distributed Representations of Rooted Sub-graphs from Large Graphs

In this paper, we present subgraph2vec, a novel approach for learning latent representations of rooted subgraphs from large graphs inspired by recent advancements in Deep Learning and Graph Kernels. These latent representations encode semantic substructure dependencies in a continuous vector space, which is easily exploited by statistical models for tasks such as graph classification, clusterin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009