142 search results - page 8 / 29 » Generalizing Graphs Using Amalgamation and Selection |
103
click to vote
CIKM
2011
Springer
13 years 11 months ago
2011
Springer
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
UAI
2004
15 years 1 months ago
2004
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property ...
ICIP
2001
IEEE
16 years 1 months ago
2001
IEEE
Optimal mode selection for video coding is important in minimizing visual distortion given a rate constraint, and it has been studied in the literature using a single previous mac...
107
click to vote
SIGMOD
2010
ACM
14 years 11 months ago
2010
ACM
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
118
click to vote
COLT
2010
Springer
14 years 9 months ago
2010
Springer
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...