2100 search results - page 78 / 420 » Learning to rank on graphs |
162
click to vote
COLT
1993
Springer
15 years 10 months ago
1993
Springer
We introducea new learningproblem: learninga graph by piecemeal search, in which the learner must return every so often to its starting point (for refueling, say). We present two l...
147
click to vote
ICTAI
2007
IEEE
16 years 14 days ago
2007
IEEE
Context-sensitive graph grammar construction tools have been used to develop and study interesting languages. However, the high dimensionality of graph grammars result in costly e...
159
click to vote
SIGIR
2002
ACM
15 years 5 months ago
2002
ACM
We describe a new family of topic-ranking algorithms for multi-labeled documents. The motivation for the algorithms stems from recent advances in online learning algorithms. The a...
163
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We reduce ranking, as measured by the Area Under the Receiver Operating Characteristic Curve (AUC), to binary classification. The core theorem shows that a binary classif...
142
click to vote
ICALT
2010
IEEE
15 years 4 months ago
2010
IEEE
—This paper introduces new metrics for course evaluation. It is also proposes a ranking algorithm that classifies courses based on the previous course evaluation metrics and sugg...