1854 search results - page 57 / 371 » On Kernel Methods for Relational Learning |
ICDM
2010
IEEE
14 years 7 months ago
2010
IEEE
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
ML
2011
ACM
14 years 4 months ago
2011
ACM
In the last decade, connectionist models have been proposed that can process structured information directly. These methods, which are based on the use of graphs for the representa...
112
click to vote
ICPR
2006
IEEE
2006
IEEE
Regularized Locality Preserving Learning of Pre-Image Problem in Kernel Principal Component Analysis
15 years 3 months ago
In this paper, we address the pre-image problem in kernel principal component analysis (KPCA). The preimage problem finds a pattern as the pre-image of a feature vector defined in...
AAAI
1993
14 years 11 months ago
1993
learning (EBL) component. In this paper we provide a brief review of FOIL and FOCL, then discuss how operationalizing a domain theory can adversely affect the accuracy of a learned...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
We address the problem of feature selection in a kernel space to select the most discriminative and informative features for classification and data analysis. This is a difficult ...