Sciweavers

137 search results - page 3 / 28
» Fast Committee-Based Structure Learning
Sort
View
ICML
2008
IEEE
14 years 6 months ago
Fast nearest neighbor retrieval for bregman divergences
We present a data structure enabling efficient nearest neighbor (NN) retrieval for bregman divergences. The family of bregman divergences includes many popular dissimilarity measu...
Lawrence Cayton
ICML
2003
IEEE
14 years 6 months ago
Finding Underlying Connections: A Fast Graph-Based Method for Link Analysis and Collaboration Queries
Many techniques in the social sciences and graph theory deal with the problem of examining and analyzing patterns found in the underlying structure and associations of a group of ...
Jeremy Kubica, Andrew W. Moore, David Cohn, Jeff G...
ISBI
2008
IEEE
14 years 6 months ago
Learning non-homogenous textures and the unlearning problem with application to drusen detection in retinal images
In this work we present a novel approach for learning nonhomogenous textures without facing the unlearning problem. Our learning method mimics the human behavior of selective lear...
Noah Lee, Andrew F. Laine, Theodore R. Smith
ACL
2007
13 years 7 months ago
Fast Unsupervised Incremental Parsing
This paper describes an incremental parser and an unsupervised learning algorithm for inducing this parser from plain text. The parser uses a representation for syntactic structur...
Yoav Seginer
ITRE
2005
IEEE
13 years 11 months ago
Structure learning of Bayesian networks using a semantic genetic algorithm-based approach
A Bayesian network model is a popular technique for data mining due to its intuitive interpretation. This paper presents a semantic genetic algorithm (SGA) to learn a complete qual...
Sachin Shetty, Min Song