Sciweavers

4085 search results - page 765 / 817
» Benchmarking Data Mining Algorithms
Sort
View
99
Voted
ILP
2004
Springer
15 years 6 months ago
A Monte Carlo Study of Randomised Restarted Search in ILP
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
Filip Zelezný, Ashwin Srinivasan, David Pag...
97
Voted
BMCBI
2010
193views more  BMCBI 2010»
15 years 21 days ago
Probe set filtering increases correlation between Affymetrix GeneChip and qRT-PCR expression measurements
Background: Affymetrix GeneChip microarrays are popular platforms for expression profiling in two types of studies: detection of differential expression computed by p-values of t-...
Jakub Mieczkowski, Magdalena E. Tyburczy, Michal D...
ICML
2004
IEEE
16 years 1 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
127
Voted
ICPP
1993
IEEE
15 years 4 months ago
Scalability Study of the KSR-1
Scalability of parallel architectures is an interesting area of current research. Shared memory parallel programming is attractive stemming from its relative ease in transitioning...
Umakishore Ramachandran, Gautam Shah, Ravi Kumar, ...
SIGIR
2006
ACM
15 years 6 months ago
Large scale semi-supervised linear SVMs
Large scale learning is often realistic only in a semi-supervised setting where a small set of labeled examples is available together with a large collection of unlabeled data. In...
Vikas Sindhwani, S. Sathiya Keerthi