Sciweavers

481 search results - page 56 / 97
» Learning relational probability trees
Sort
View
IJAR
2010
130views more  IJAR 2010»
13 years 6 months ago
Learning locally minimax optimal Bayesian networks
We consider the problem of learning Bayesian network models in a non-informative setting, where the only available information is a set of observational data, and no background kn...
Tomi Silander, Teemu Roos, Petri Myllymäki
UAI
2003
13 years 9 months ago
Learning Generative Models of Similarity Matrices
Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at finding irregularlyshaped clusters in data. The input to...
Rómer Rosales, Brendan J. Frey
IJCV
2007
196views more  IJCV 2007»
13 years 7 months ago
Weakly Supervised Scale-Invariant Learning of Models for Visual Recognition
We investigate a method for learning object categories in a weakly supervised manner. Given a set of images known to contain the target category from a similar viewpoint, learning...
Robert Fergus, Pietro Perona, Andrew Zisserman
WWW
2010
ACM
13 years 11 months ago
Diversifying landmark image search results by learning interested views from community photos
In this paper, we demonstrate a novel landmark photo search and browsing system, Agate, which ranks landmark image search results considering their relevance, diversity and qualit...
Yuheng Ren, Mo Yu, Xin-Jing Wang, Lei Zhang, Wei-Y...
SDM
2007
SIAM
198views Data Mining» more  SDM 2007»
13 years 9 months ago
Learning from Time-Changing Data with Adaptive Windowing
We present a new approach for dealing with distribution change and concept drift when learning from data sequences that may vary with time. We use sliding windows whose size, inst...
Albert Bifet, Ricard Gavaldà