Sciweavers

2463 search results - page 323 / 493
» Rankings of Directed Graphs
Sort
View
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
12 years 4 days ago
Fast bregman divergence NMF using taylor expansion and coordinate descent
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
Liangda Li, Guy Lebanon, Haesun Park
SIGIR
2012
ACM
12 years 4 days ago
TFMAP: optimizing MAP for top-n context-aware recommendation
In this paper, we tackle the problem of top-N context-aware recommendation for implicit feedback scenarios. We frame this challenge as a ranking problem in collaborative filterin...
Yue Shi, Alexandros Karatzoglou, Linas Baltrunas, ...
JSAC
2010
153views more  JSAC 2010»
13 years 4 months ago
Autonomic traffic engineering for network robustness
Abstract--The continuously increasing complexity of communication networks and the increasing diversity and unpredictability of traffic demand has led to a consensus view that the ...
Ali Tizghadam, Alberto Leon-Garcia
CVPR
2009
IEEE
15 years 4 months ago
What's It Going to Cost You?: Predicting Effort vs. Informativeness for Multi-Label Image Annotations
Active learning strategies can be useful when manual labeling effort is scarce, as they select the most informative examples to be annotated first. However, for visual category ...
Sudheendra Vijayanarasimhan (University of Texas a...
ICCV
2009
IEEE
15 years 2 months ago
TagProp: Discriminative Metric Learning in Nearest Neighbor Models for Image Auto-Annotation
Image auto-annotation is an important open problem in computer vision. For this task we propose TagProp, a discriminatively trained nearest neighbor model. Tags of test images a...
Matthieu Guillaumin, Thomas Mensink, Jakob Verbeek...