Sciweavers

661 search results - page 110 / 133
» Generalized clustering, supervised learning, and data assign...
Sort
View
UAI
2003
13 years 9 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
ROBOCUP
2004
Springer
138views Robotics» more  ROBOCUP 2004»
14 years 1 months ago
An Algorithm That Recognizes and Reproduces Distinct Types of Humanoid Motion Based on Periodically-Constrained Nonlinear PCA
Abstract. This paper proposes a new algorithm for the automatic segmentation of motion data from a humanoid soccer playing robot that allows feedforward neural networks to generali...
Rawichote Chalodhorn, Karl F. MacDorman, Minoru As...
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
14 years 10 days ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
CORR
2006
Springer
153views Education» more  CORR 2006»
13 years 8 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...
PAMI
2011
13 years 3 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams