Sciweavers

205 search results - page 12 / 41
» Decision trees do not generalize to new variations
Sort
View
SIGIR
2011
ACM
12 years 11 months ago
Functional matrix factorizations for cold-start recommendation
A key challenge in recommender system research is how to effectively profile new users, a problem generally known as cold-start recommendation. Recently the idea of progressivel...
Ke Zhou, Shuang-Hong Yang, Hongyuan Zha
DOLAP
2004
ACM
14 years 2 months ago
A new OLAP aggregation based on the AHC technique
Nowadays, decision support systems are evolving in order to handle complex data. Some recent works have shown the interest of combining on-line analysis processing (OLAP) and data...
Riadh Ben Messaoud, Omar Boussaid, Sabine Rabas&ea...
BMCBI
2006
137views more  BMCBI 2006»
13 years 8 months ago
A classification-based framework for predicting and analyzing gene regulatory response
Background: We have recently introduced a predictive framework for studying gene transcriptional regulation in simpler organisms using a novel supervised learning algorithm called...
Anshul Kundaje, Manuel Middendorf, Mihir Shah, Chr...
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
14 years 9 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle
CVPR
2010
IEEE
14 years 5 months ago
Covering Trees and Lower-bounds on Quadratic Assignment
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
Julian Yarkony, Charless Fowlkes, Alex Ihler