Sciweavers

2100 search results - page 2 / 420
» Learning to rank on graphs
Sort
View
CVPR
2012
IEEE
11 years 8 months ago
Non-negative low rank and sparse graph for semi-supervised learning
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
Liansheng Zhuang, Haoyuan Gao, Zhouchen Lin, Yi Ma...
ICML
2007
IEEE
14 years 6 months ago
Learning random walks to rank nodes in graphs
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...
Alekh Agarwal, Soumen Chakrabarti
ALT
2010
Springer
13 years 19 days ago
PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
Balázs Csanád Csáji, Rapha&eu...
IJCAI
2003
13 years 7 months ago
A Learning Algorithm for Web Page Scoring Systems
Hyperlink analysis is a successful approach to define algorithms which compute the relevance of a document on the basis of the citation graph. In this paper we propose a technique...
Michelangelo Diligenti, Marco Gori, Marco Maggini
WWW
2007
ACM
14 years 6 months ago
Measuring credibility of users in an e-learning environment
Learning Villages (LV) is an E-learning platform for people's online discussions and frequently citing postings of one another. In this paper, we propose a novel method to ra...
Wei Wei, Jimmy Ho-Man Lee, Irwin King