ACM Home Page
Please provide us with feedback. Feedback
Semi-supervised ranking aggregation
Full text PdfPdf (103 KB)
Source
Conference on Information and Knowledge Management archive
Proceeding of the 17th ACM conference on Information and knowledge management table of contents
Napa Valley, California, USA
POSTER SESSION: Poster session 2/information retrieval table of contents
Pages 1427-1428  
Year of Publication: 2008
ISBN:978-1-59593-991-3
Authors
Shouchun Chen  Tsinghua University, Beijing, China
Fei Wang  Tsinghua University, Beijing, China
Yaangqiu Song  Tsinghua University, Beijing, China
Changshui Zhang  Tsinghua University, Beijing, China
Sponsors
ACM: Association for Computing Machinery
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 133,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1458082.1458315
What is a DOI?

ABSTRACT

Ranking aggregation is important in data mining and information retrieval. In this paper, we proposed a semi-supervised ranking aggregation method, in which the order of several item pairs are labeled as side information. The core idea is to learn a ranking function based on the ordering agreement of different rankers. The ranking scores assigned by this ranking function on the labeled data are consistent with the given pairwise order constraints while the ranking scores on the unlabeled data obey the intrinsic manifold structure of the rank items. The experiment results show our method work well.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
 
4
M. Belkin, I. Matveeva and P. Niyogi. Regularization and Semi-supervised Learning on Large Graphs. Proceeding of the 17th Annual Conference on Learning Theory, 2004.
 
5
 
6
 
7
T. Y. Liu, T. Qin, J. Xu, W. Y. Xiong and H. Li. Letor: Benchmark Dataset for Research on Learning to Rank for Information Retrieval. SIGIR, 2007.
8
 
9
V. Vapnik. Statistical Learning Theory. Wiley and Sons Inc, 1998.

Collaborative Colleagues:
Shouchun Chen: colleagues
Fei Wang: colleagues
Yaangqiu Song: colleagues
Changshui Zhang: colleagues