SIGN IN
SIGN UP
A general magnitude-preserving boosting algorithm for search ranking
Full Text:
PDF
Buy this Article
Authors:
Chenguang Zhu
Tsinghua University, Beijing, China
Weizhu Chen
Microsoft Research Asia, Beijing, China
Zeyuan Allen Zhu
Tsinghua University, Beijing, China
Gang Wang
Microsoft Research Asia, Beijing, China
Dong Wang
Tsinghua University, Beijing, China
Zheng Chen
Microsoft Research Asia, Beijing, China
2009 Article
Bibliometrics
· Downloads (6 Weeks): 10
· Downloads (12 Months): 42
· Downloads (cumulative): 215
· Citation Count: 0
Published in:
· Proceeding
CIKM '09
Proceedings of the 18th ACM conference on Information and knowledge management
Pages 817-826
ACM
New York, NY
, USA
©2009
table of contents
ISBN: 978-1-60558-512-3
doi>
10.1145/1645953.1646057
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
CIKM'13
Share:
|
Tags:
algorithms
directed distance function
experimentation
information search and retrieval
learning
magnitude-preserving
pairwise-preference
performance
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