3718 search results - page 317 / 744 » On learning with dissimilarity functions |
195
Voted
ICML
2006
IEEE
16 years 8 months ago
2006
IEEE
We extend tree-based methods to the prediction of structured outputs using a kernelization of the algorithm that allows one to grow trees as soon as a kernel can be defined on the...
211
click to vote
ICML
2005
IEEE
16 years 8 months ago
2005
IEEE
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...
184
Voted
ECML
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We consider a new discriminative learning approach to sequence labeling based on the statistical concept of the Z-score. Given a training set of pairs of hidden-observed ...
212
click to vote
PAKDD
2005
ACM
16 years 29 days ago
2005
ACM
Abstract. In this paper we present a novel and general framework based on concepts of relational algebra for kernel-based learning over relational schema. We exploit the notion of ...
196
Voted
ILP
2004
Springer
16 years 25 days ago
2004
Springer
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...