Sciweavers

5329 search results - page 13 / 1066
» The Weighted Majority Algorithm
Sort
View
FCT
2005
Springer
14 years 1 months ago
A Simple and Fast Min-cut Algorithm
We present an algorithm which calculates a minimum cut and its weight in an undirected graph with nonnegative real edge weights, n vertices and m edges, in time O( ` max (log n, mi...
Michael Brinkmeier
RECOMB
2008
Springer
14 years 7 months ago
CompostBin: A DNA Composition-Based Algorithm for Binning Environmental Shotgun Reads
A major hindrance to studies of microbial diversity has been that the vast majority of microbes cannot be cultured in the laboratory and thus are not amenable to traditional method...
Sourav Chatterji, Ichitaro Yamazaki, Zhaojun Bai, ...
SIGIR
2010
ACM
13 years 2 months ago
Temporally-aware algorithms for document classification
Automatic Document Classification (ADC) is still one of the major information retrieval problems. It usually employs a supervised learning strategy, where we first build a classif...
Thiago Salles, Leonardo C. da Rocha, Gisele L. Pap...
ICPR
2008
IEEE
14 years 8 months ago
Incremental learning in non-stationary environments with concept drift using a multiple classifier based approach
We outline an incremental learning algorithm designed for nonstationary environments where the underlying data distribution changes over time. With each dataset drawn from a new e...
Matthew T. Karnick, Michael Muhlbaier, Robi Polika...
FLAIRS
2008
13 years 9 months ago
Extending Nearest Neighbor Classification with Spheres of Confidence
The standard kNN algorithm suffers from two major drawbacks: sensitivity to the parameter value k, i.e., the number of neighbors, and the use of k as a global constant that is ind...
Ulf Johansson, Henrik Boström, Rikard Kö...