Sciweavers

1068 search results - page 130 / 214
» Extremely randomized trees
Sort
View
AAAI
2012
12 years 14 days ago
A Sequential Decision Approach to Ordinal Preferences in Recommender Systems
We propose a novel sequential decision approach to modeling ordinal ratings in collaborative filtering problems. The rating process is assumed to start from the lowest level, eva...
Truyen Tran, Dinh Q. Phung, Svetha Venkatesh
ESEM
2007
ACM
14 years 2 months ago
The Effects of Over and Under Sampling on Fault-prone Module Detection
The goal of this paper is to improve the prediction performance of fault-prone module prediction models (fault-proneness models) by employing over/under sampling methods, which ar...
Yasutaka Kamei, Akito Monden, Shinsuke Matsumoto, ...
CIE
2006
Springer
14 years 1 months ago
Lower Bounds Using Kolmogorov Complexity
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Sophie Laplante
ICRA
2000
IEEE
176views Robotics» more  ICRA 2000»
14 years 1 months ago
RRT-Connect: An Efficient Approach to Single-Query Path Planning
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
James J. Kuffner Jr., Steven M. LaValle
ML
2012
ACM
413views Machine Learning» more  ML 2012»
12 years 5 months ago
Gradient-based boosting for statistical relational learning: The relational dependency network case
Dependency networks approximate a joint probability distribution over multiple random variables as a product of conditional distributions. Relational Dependency Networks (RDNs) are...
Sriraam Natarajan, Tushar Khot, Kristian Kersting,...