2252 search results - page 33 / 451 » Improving Random Forests |
TAMC
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
LREC
2008
13 years 9 months ago
2008
We present results from using Random Indexing for Latent Semantic Analysis to handle Singular Value Decomposition tractability issues. We compare Latent Semantic Analysis, Random ...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In this paper we perform an empirical evaluation of supervised learning on highdimensional data. We evaluate performance on three metrics: accuracy, AUC, and squared loss and stud...
DGCI
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Watershed segmentation of spectral images is typically achieved by first transforming the high-dimensional input data into a scalar boundary indicator map which is used ...
ESANN
2008
13 years 9 months ago
2008
In this paper we solve the problem of classifying chestnut plants according to their place of origin. We compare the results obtained by state of the art classifiers, among which,...