Concept

Random forest

Related publications (195)

When does roving disrupt perceptual learning?

Michael Herzog, Elisa Tartaglia, Carl Kristoffer Aberg

Training with one type of a visual stimulus usually improves performance. When observers train with two or more stimulus types presented in random order (so-called roving), performance improves for certain stimulus types but not for others. To understand w ...

2008

Sampling Bounds for Sparse Support Recovery in the Presence of Noise

Michael Christoph Gastpar

It is well known that the support of a sparse signal can be recovered from a small number of random projections. However, in the presence of noise all known sufficient conditions require that the per-sample signal-to-noise ratio (SNR) grows without bound w ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

On the estimation of geodesic paths on sampled manifolds after random projections

Pierre Vandergheynst, Matteo Sorci

In this paper, we focus on the use of random projections as a dimensionality reduction tool for sampled manifolds in high-dimensional Euclidean spaces. We show that geodesic paths approximations from nearest neighbors Euclidean distances are well-preserved ...

2008

Discrete choice modelling of combined mode and departure time

Edward Chung

Typical daily decision-making process of individuals regarding use of transport system involves mainly three types of decisions: mode choice, departure time choice and route choice. This paper focuses on the mode and departure time choice processes and stu ...

2008

Approximating connected facility location problems via Random facility sampling and core detouring

Friedrich Eisenbrand, Thomas Rothvoss

We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unconnected facility location problem, randomly sample the clients, and open the ...

2008

A heuristic for nonlinear global optimization

Michel Bierlaire, Michaël Clément Louis Ghislain Thémans, Nicolas Zufferey

We propose a new heuristic for nonlinear global optimization combining a variable neighborhood search framework with a modified trust-region algorithm as local search. The proposed method presents the capability to prematurely interrupt the local search if ...

2008

A heuristic for nonlinear global optimization

Michel Bierlaire, Michaël Clément Louis Ghislain Thémans, Nicolas Zufferey

We propose a new heuristic for nonlinear global optimization combining a variable neighbourhood search framework with a modified trust-region algorithm as local search. The proposed method presents the capability to prematurely interrupt the local search i ...

2008

Mode and Carrier Choice in the Quebec City - Windsor Corridor: A Random Parameters Approach

The Quebec City-Windsor corridor is the busiest and most important trade and transportation corridor in Canada. The transportation sector is the second largest contributor to greenhouse gas (GHG) emissions in the country. Governments around the world, incl ...

2007

Mode and Carrier Choice in the Quebec City - A Random Parameters Approach

2007

Mode and Carrier Choice in the Quebec City - Windsor Corridor: A Random Parameters Approach

2007

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.