Sciweavers

2252 search results - page 30 / 451
» Improving Random Forests
Sort
View
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 9 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
GRC
2009
IEEE
13 years 11 months ago
A step toward code granulation space
This paper proposes a code granulation space which can be applied to program construction and processing. Each granule in the space is defined as an improvement to the seed progra...
Yinliang Zhao
NIPS
2001
13 years 9 months ago
A Parallel Mixture of SVMs for Very Large Scale Problems
Support Vector Machines (SVMs) are currently the state-of-the-art models for many classication problems but they suer from the complexity of their training algorithm which is at l...
Ronan Collobert, Samy Bengio, Yoshua Bengio
BMCBI
2006
100views more  BMCBI 2006»
13 years 8 months ago
Using the nucleotide substitution rate matrix to detect horizontal gene transfer
Background: Horizontal gene transfer (HGT) has allowed bacteria to evolve many new capabilities. Because transferred genes perform many medically important functions, such as conf...
Micah Hamady, M. D. Betterton, Rob Knight
CSDA
2008
128views more  CSDA 2008»
13 years 8 months ago
Classification tree analysis using TARGET
Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness,...
J. Brian Gray, Guangzhe Fan