Sciweavers

1376 search results - page 133 / 276
» Searching Trees: An Essay
Sort
View
KDD
2010
ACM
257views Data Mining» more  KDD 2010»
15 years 10 months ago
Multi-task learning for boosting with application to web search ranking
In this paper we propose a novel algorithm for multi-task learning with boosted decision trees. We learn several different learning tasks with a joint model, explicitly addressing...
Olivier Chapelle, Pannagadatta K. Shivaswamy, Srin...
CSB
2004
IEEE
126views Bioinformatics» more  CSB 2004»
15 years 10 months ago
Boosted PRIM with Application to Searching for Oncogenic Pathway of Lung Cancer
Boosted PRIM (Patient Rule Induction Method) is a new algorithm developed for two-class classification problems. PRIM is a variation of those Tree-Based methods ( [4] Ch9.3), seek...
Pei Wang, Young Kim, Jonathan R. Pollack, Robert T...
ICDE
2010
IEEE
174views Database» more  ICDE 2010»
15 years 4 months ago
Semantic flooding: Search over semantic links
Abstract-- Classification hierarchies are trees where links codify the fact that a node lower in the hierarchy contains documents whose contents are more specific than those one le...
Fausto Giunchiglia, Uladzimir Kharkevich, Alethia ...
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
16 years 6 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...
ICALP
2003
Springer
15 years 11 months ago
Quantum Search on Bounded-Error Inputs
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
Peter Høyer, Michele Mosca, Ronald de Wolf