Sciweavers

2695 search results - page 133 / 539
» Learning Graph Matching
Sort
View
ICML
2006
IEEE
16 years 3 months ago
An analysis of graph cut size for transductive learning
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
Steve Hanneke
120
Voted
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
16 years 3 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...
102
Voted
ACL
2003
15 years 4 months ago
Finding Non-local Dependencies: Beyond Pattern Matching
We describe an algorithm for recovering non-local dependencies in syntactic dependency structures. The patternmatching approach proposed by Johnson (2002) for a similar task for p...
Valentin Jijkoun
118
Voted
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 4 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
116
Voted
ICMLA
2009
15 years 14 days 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