SIGN IN
SIGN UP
Parallel boosted regression trees for web search ranking
Full Text:
PDF
Buy this Article
Authors:
Stephen Tyree
Washington University in St. Louis, St. Louis, MO, USA
Kilian Q. Weinberger
Washington University in St. Louis, St. Louis, MO, USA
Kunal Agrawal
Washington University in St. Louis, St. Louis, MO, USA
Jennifer Paykin
Wesleyan University, Middletown, CT, USA
2011 Article
Bibliometrics
· Downloads (6 Weeks): 10
· Downloads (12 Months): 85
· Downloads (cumulative): 290
· Citation Count: 7
Published in:
· Proceeding
WWW '11
Proceedings of the 20th international conference on World wide web
Pages 387-396
ACM
New York, NY
, USA
©2011
table of contents
ISBN: 978-1-4503-0632-4
doi>
10.1145/1963405.1963461
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
boosted regression trees
boosting
distributed computing
general
machine learning
parallel computing
ranking
web search
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder