93 search results - page 18 / 19 » Making k-means Even Faster |
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
Selective sampling is a form of active learning which can reduce the cost of training by only drawing informative data points into the training set. This selected training set is ...
BMCBI
2010
13 years 5 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
BMCBI
2008
13 years 5 months ago
2008
Background: Structural analysis of biochemical networks is a growing field in bioinformatics and systems biology. The availability of an increasing amount of biological data from ...
JMLR
2008
13 years 5 months ago
2008
Ensemble learning algorithms such as boosting can achieve better performance by averaging over the predictions of some base hypotheses. Nevertheless, most existing algorithms are ...
KAIS
2008
13 years 5 months ago
2008
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...