Sciweavers

2645 search results - page 166 / 529
» time 2003
Sort
View
ICML
2003
IEEE
16 years 7 months ago
Tractable Bayesian Learning of Tree Augmented Naive Bayes Models
Bayesian classifiers such as Naive Bayes or Tree Augmented Naive Bayes (TAN) have shown excellent performance given their simplicity and heavy underlying independence assumptions....
Jesús Cerquides, Ramon López de M&aa...
ICML
2003
IEEE
16 years 7 months ago
Online Feature Selection using Grafting
In the standard feature selection problem, we are given a fixed set of candidate features for use in a learning problem, and must select a subset that will be used to train a mode...
Simon Perkins, James Theiler
STOC
2003
ACM
122views Algorithms» more  STOC 2003»
16 years 6 months ago
Learning juntas
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
STOC
2003
ACM
140views Algorithms» more  STOC 2003»
16 years 6 months ago
Approximation schemes for clustering problems
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...
PODS
2003
ACM
104views Database» more  PODS 2003»
16 years 6 months ago
Maintaining time-decaying stream aggregates
We formalize the problem of maintaining time-decaying aggregates and statistics of a data stream: the relative contribution of each data item to the aggregate is scaled down by a ...
Edith Cohen, Martin Strauss