Sciweavers

3607 search results - page 230 / 722
» Learning with structured sparsity
Sort
View
ISCI
2007
170views more  ISCI 2007»
15 years 4 months ago
Automatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
Michel Neuhaus, Horst Bunke
ECCV
2002
Springer
16 years 6 months ago
Dynamic Trees: Learning to Model Outdoor Scenes
Abstract. This paper considers the dynamic tree (DT) model, first introduced in [1]. A dynamic tree specifies a prior over structures of trees, each of which is a forest of one or ...
Nicholas J. Adams, Christopher K. I. Williams
ICML
2005
IEEE
16 years 5 months ago
Learning class-discriminative dynamic Bayesian networks
In many domains, a Bayesian network's topological structure is not known a priori and must be inferred from data. This requires a scoring function to measure how well a propo...
John Burge, Terran Lane
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
15 years 11 months ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
122
Voted
ECAI
2004
Springer
15 years 10 months ago
Learning Techniques for Automatic Algorithm Portfolio Selection
The purpose of this paper is to show that a well known machine learning technique based on Decision Trees can be effectively used to select the best approach (in terms of efficien...
Alessio Guerri, Michela Milano