Sciweavers

2100 search results - page 6 / 420
» Learning to rank on graphs
Sort
View
ML
2008
ACM
146views Machine Learning» more  ML 2008»
14 years 11 months ago
Improving maximum margin matrix factorization
Abstract. Collaborative filtering is a popular method for personalizing product recommendations. Maximum Margin Matrix Factorization (MMMF) has been proposed as one successful lear...
Markus Weimer, Alexandros Karatzoglou, Alex J. Smo...
MIR
2006
ACM
200views Multimedia» more  MIR 2006»
15 years 5 months ago
An adaptive graph model for automatic image annotation
Automatic keyword annotation is a promising solution to enable more effective image search by using keywords. In this paper, we propose a novel automatic image annotation method b...
Jing Liu, Mingjing Li, Wei-Ying Ma, Qingshan Liu, ...
ILP
2003
Springer
15 years 4 months ago
Graph Kernels and Gaussian Processes for Relational Reinforcement Learning
RRL is a relational reinforcement learning system based on Q-learning in relational state-action spaces. It aims to enable agents to learn how to act in an environment that has no ...
Thomas Gärtner, Kurt Driessens, Jan Ramon
ACL
2008
15 years 1 months ago
Semantic Class Learning from the Web with Hyponym Pattern Linkage Graphs
We present a novel approach to weakly supervised semantic class learning from the web, using a single powerful hyponym pattern combined with graph structures, which capture two pr...
Zornitsa Kozareva, Ellen Riloff, Eduard H. Hovy
ICML
2008
IEEE
16 years 14 days ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash