Sciweavers

2100 search results - page 151 / 420
» Learning to rank on graphs
Sort
View
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 7 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
ICMLA
2009
15 years 4 months ago
Learning Probabilistic Structure Graphs for Classification and Detection of Object Structures
Abstract--This paper presents a novel and domainindependent approach for graph-based structure learning. The approach is based on solving the Maximum Common SubgraphIsomorphism pro...
Johannes Hartz
ICIP
2005
IEEE
16 years 8 months ago
Variable module graphs: a framework for inference and learning in modular vision systems
We present a novel and intuitive framework for building modular vision systems for complex tasks such as surveillance applications. Inspired by graphical models, especially factor...
Amit Sethi, Mandar Rahurkar, Thomas S. Huang
ICPR
2010
IEEE
15 years 10 months ago
Learning an Efficient and Robust Graph Matching Procedure for Specific Object Recognition
We present a fast and robust graph matching approach for 2D specific object recognition in images. From a small number of training images, a model graph of the object to learn is a...
Jerome Revaud, Guillaume Lavoue, Yasuo Ariki, Atil...
FLAIRS
2001
15 years 7 months ago
Graph-Based Concept Learning
We introduce the graph-based relational concept learner SubdueCL. We start with a brief description of other graph-based learning systems: the Galois lattice, Conceptual Graphs, a...
Jesus A. Gonzalez, Lawrence B. Holder, Diane J. Co...