Sciweavers

113 search results - page 11 / 23
» Structural Machine Learning with Galois Lattice and Graphs
Sort
View
ICML
2004
IEEE
15 years 10 months ago
Semi-supervised learning using randomized mincuts
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...
ICML
2002
IEEE
15 years 10 months ago
Diffusion Kernels on Graphs and Other Discrete Input Spaces
The application of kernel-based learning algorithms has, so far, largely been confined to realvalued data and a few special data types, such as strings. In this paper we propose a...
Risi Imre Kondor, John D. Lafferty
ICML
1996
IEEE
15 years 10 months ago
Learning Relational Concepts with Decision Trees
In this paper, we describe two di erent learning tasks for relational structures. When learning a classi er for structures, the relational structures in the training sets are clas...
Peter Geibel, Fritz Wysotzki
CVPR
2010
IEEE
15 years 6 months ago
Unified Graph Matching in Euclidean Spaces
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
Julian McAuley, Teofilo de Campos, Tiberio Caetano
88
Voted
CIKM
2011
Springer
13 years 9 months ago
Semi-supervised multi-task learning of structured prediction models for web information extraction
Extracting information from web pages is an important problem; it has several applications such as providing improved search results and construction of databases to serve user qu...
Paramveer S. Dhillon, Sundararajan Sellamanickam, ...