7 search results - page 1 / 2 » Large linear classification when data cannot fit in memory |
KDD
2010
ACM
13 years 6 months ago
2010
ACM
Recent advances in linear classification have shown that for applications such as document classification, the training can be extremely efficient. However, most of the existing t...
BMCBI
2008
13 years 4 months ago
2008
Background: With the advent of high throughput biotechnology data acquisition platforms such as micro arrays, SNP chips and mass spectrometers, data sets with many more variables ...
KDD
2001
ACM
14 years 4 months ago
2001
ACM
In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneo...
BMCBI
2010
13 years 4 months ago
2010
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
KDD
2004
ACM
14 years 4 months ago
2004
ACM
Dimension reduction is a critical data preprocessing step for many database and data mining applications, such as efficient storage and retrieval of high-dimensional data. In the ...