1854 search results - page 201 / 371 » On Kernel Methods for Relational Learning |
128
Voted
ICTAI
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper, we propose a novel stochastic framework for unsupervised manifold learning. The latent variables are introduced, and the latent processes are assumed to characteriz...
142
click to vote
DAGM
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. In this article we present EANT2, a method that creates neural networks (NNs) by evolutionary reinforcement learning. The structure of NNs is developed using mutation ope...
138
Voted
BIBE
2009
IEEE
15 years 7 months ago
2009
IEEE
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...
114
Voted
EMNLP
2008
15 years 5 months ago
2008
We consider a parsed text corpus as an instance of a labelled directed graph, where nodes represent words and weighted directed edges represent the syntactic relations between the...
154
Voted
JMLR
2010
14 years 10 months ago
2010
The problems of dimension reduction and inference of statistical dependence are addressed by the modeling framework of learning gradients. The models we propose hold for Euclidean...