2252 search results - page 67 / 451 » Improving Random Forests |
JACM
2010
13 years 6 months ago
2010
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic f...
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. Particle swarm optimization (PSO) is a new evolutionary computation technique. Although PSO algorithm possesses many attractive properties, the methods of selecting inert...
ESANN
2006
13 years 9 months ago
2006
Currently the best algorithms for transcription factor binding site prediction are severely limited in accuracy. In previous work we combine random selection under-sampling with th...
BMCBI
2010
13 years 8 months ago
2010
Background: Biological processes in cells are carried out by means of protein-protein interactions. Determining whether a pair of proteins interacts by wet-lab experiments is reso...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...