337 search results - page 17 / 68 » Efficient algorithms for ranking with SVMs |
ICML
2008
IEEE
16 years 16 days ago
2008
IEEE
This paper aims to conduct a study on the listwise approach to learning to rank. The listwise approach learns a ranking function by taking individual lists as instances and minimi...
WINE
2010
Springer
14 years 9 months ago
2010
Springer
Trust propagation is a fundamental topic of study in the theory and practice of ranking and recommendation systems on networks. The Page Rank [9] algorithm ranks web pages by propa...
132
click to vote
ACIIDS
2010
IEEE
14 years 9 months ago
2010
IEEE
Microarray data usually contains a high level of noisy gene data, the noisy gene data include incorrect, noise and irrelevant genes. Before Microarray data classification takes pla...
102
click to vote
FAW
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...
WWW
2004
ACM
16 years 12 days ago
2004
ACM
The celebrated PageRank algorithm has proved to be a very effective paradigm for ranking results of web search algorithms. In this paper we refine this basic paradigm to take into...