Sciweavers

2878 search results - page 109 / 576
» Learning the Common Structure of Data
Sort
View
ALT
2008
Springer
16 years 16 days ago
Exploiting Cluster-Structure to Predict the Labeling of a Graph
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...
Mark Herbster
130
Voted
IJCAI
2007
15 years 5 months ago
Incremental Construction of Structured Hidden Markov Models
This paper presents an algorithm for inferring a Structured Hidden Markov Model (S-HMM) from a set of sequences. The S-HMMs are a sub-class of the Hierarchical Hidden Markov Model...
Ugo Galassi, Attilio Giordana, Lorenza Saitta
AAAI
2011
14 years 3 months ago
Heterogeneous Transfer Learning with RBMs
A common approach in machine learning is to use a large amount of labeled data to train a model. Usually this model can then only be used to classify data in the same feature spac...
Bin Wei, Christopher Pal
137
Voted
NIPS
2003
15 years 5 months ago
Learning with Local and Global Consistency
We consider the general problem of learning from labeled and unlabeled data, which is often called semi-supervised learning or transductive inference. A principled approach to sem...
Dengyong Zhou, Olivier Bousquet, Thomas Navin Lal,...
131
Voted
ML
2008
ACM
15 years 3 months ago
Inductive process modeling
In this paper, we pose a novel research problem for machine learning that involves constructing a process model from continuous data. We claim that casting learned knowledge in ter...
Will Bridewell, Pat Langley, Ljupco Todorovski, Sa...