Sciweavers

829 search results - page 29 / 166
» Bandit Algorithms for Tree Search
Sort
View
148
Voted
FCT
2003
Springer
15 years 8 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
WWW
2010
ACM
15 years 10 months ago
The paths more taken: matching DOM trees to search logs for accurate webpage clustering
An unsupervised clustering of the webpages on a website is a primary requirement for most wrapper induction and automated data extraction methods. Since page content can vary dras...
Deepayan Chakrabarti, Rupesh R. Mehta
157
Voted
WWW
2011
ACM
14 years 10 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...
142
Voted
WEA
2007
Springer
114views Algorithms» more  WEA 2007»
15 years 9 months ago
Improving Tree Search in Phylogenetic Reconstruction from Genome Rearrangement Data
Abstract. A major task in evolutionary biology is to determine the ancestral relationships among the known species, a process generally referred as phylogenetic reconstruction. In ...
Fei Ye, Yan Guo, Andrew Lawson, Jijun Tang
108
Voted
COLING
1996
15 years 4 months ago
Error-tolerant Tree Matching
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...
Kemal Oflazer