Sciweavers

69 search results - page 4 / 14
» Parallel Induction Algorithms for Large Samples
Sort
View
BMCBI
2010
139views more  BMCBI 2010»
13 years 7 months ago
A highly efficient multi-core algorithm for clustering extremely large datasets
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...
Johann M. Kraus, Hans A. Kestler
ICDAR
2003
IEEE
14 years 28 days ago
A Low-Cost Parallel K-Means VQ Algorithm Using Cluster Computing
In this paper we propose a parallel approach for the Kmeans Vector Quantization (VQ) algorithm used in a twostage Hidden Markov Model (HMM)-based system for recognizing handwritte...
Alceu de Souza Britto Jr., Paulo Sergio Lopes de S...
TSMC
1998
97views more  TSMC 1998»
13 years 7 months ago
Parallel algorithms for modules of learning automata
— Parallel algorithms are presented for modules of learning automata with the objective of improving their speed of convergence without compromising accuracy. A general procedure...
M. A. L. Thathachar, M. T. Arvind
CORR
2011
Springer
183views Education» more  CORR 2011»
12 years 11 months ago
Learning When Training Data are Costly: The Effect of Class Distribution on Tree Induction
For large, real-world inductive learning problems, the number of training examples often must be limited due to the costs associated with procuring, preparing, and storing the tra...
Foster J. Provost, Gary M. Weiss
PDCN
2004
13 years 9 months ago
K-Means VQ algorithm using a low-cost parallel cluster computing
It is well-known that the time and memory necessary to create a codebook from large training databases have hindered the vector quantization based systems for real applications. T...
Paulo Sergio Lopes de Souza, Alceu de Souza Britto...