Sciweavers

1658 search results - page 63 / 332
» Learning Unknown Graphs
Sort
View
CVPR
2008
IEEE
16 years 7 months ago
Manifold learning using robust Graph Laplacian for interactive image search
Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in partially labeling a ...
Hichem Sahbi, Patrick Etyngier, Jean-Yves Audibert...
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
16 years 5 months ago
Unsupervised learning on k-partite graphs
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip...
135
Voted
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 6 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 2 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 6 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