Sciweavers

528 search results - page 10 / 106
» Structure learning with independent non-identically distribu...
Sort
View
ICML
2006
IEEE
14 years 8 months ago
Estimating relatedness via data compression
We show that it is possible to use data compression on independently obtained hypotheses from various tasks to algorithmically provide guarantees that the tasks are sufficiently r...
Brendan Juba
ICPR
2008
IEEE
14 years 9 months ago
Supervised learning of a generative model for edge-weighted graphs
This paper addresses the problem of learning archetypal structural models from examples. To this end we define a generative model for graphs where the distribution of observed nod...
Andrea Torsello, David L. Dowe
JMLR
2008
159views more  JMLR 2008»
13 years 7 months ago
Dynamic Hierarchical Markov Random Fields for Integrated Web Data Extraction
Existing template-independent web data extraction approaches adopt highly ineffective decoupled strategies--attempting to do data record detection and attribute labeling in two se...
Jun Zhu, Zaiqing Nie, Bo Zhang, Ji-Rong Wen
CIDM
2009
IEEE
14 years 2 months ago
A new hybrid method for Bayesian network learning With dependency constraints
Abstract— A Bayes net has qualitative and quantitative aspects: The qualitative aspect is its graphical structure that corresponds to correlations among the variables in the Baye...
Oliver Schulte, Gustavo Frigo, Russell Greiner, We...
TNN
2010
155views Management» more  TNN 2010»
13 years 2 months ago
Incorporating the loss function into discriminative clustering of structured outputs
Clustering using the Hilbert Schmidt independence criterion (CLUHSIC) is a recent clustering algorithm that maximizes the dependence between cluster labels and data observations ac...
Wenliang Zhong, Weike Pan, James T. Kwok, Ivor W. ...