Sciweavers

3395 search results - page 263 / 679
» Learning to efficiently rank
Sort
View
WWW
2010
ACM
16 years 1 months ago
Factorizing personalized Markov chains for next-basket recommendation
Recommender systems are an important component of many websites. Two of the most popular approaches are based on matrix factorization (MF) and Markov chains (MC). MF methods learn...
Steffen Rendle, Christoph Freudenthaler, Lars Schm...
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
16 years 7 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
COMCOM
2008
127views more  COMCOM 2008»
15 years 6 months ago
A dynamic routing protocol for keyword search in unstructured peer-to-peer networks
The idea of building query-oriented routing indices has changed the way of improving keyword search efficiency from the basis as it can learn the content distribution from the que...
Cong Shi, Dingyi Han, Yuanjie Liu, Shicong Meng, Y...
ICML
2004
IEEE
16 years 7 months ago
Using relative novelty to identify useful temporal abstractions in reinforcement learning
lative Novelty to Identify Useful Temporal Abstractions in Reinforcement Learning ?Ozg?ur S?im?sek ozgur@cs.umass.edu Andrew G. Barto barto@cs.umass.edu Department of Computer Scie...
Özgür Simsek, Andrew G. Barto
ICML
2003
IEEE
16 years 7 months ago
Transductive Learning via Spectral Graph Partitioning
We present a new method for transductive learning, which can be seen as a transductive version of the k nearest-neighbor classifier. Unlike for many other transductive learning me...
Thorsten Joachims