Sciweavers

966 search results - page 148 / 194
» A Two-Level Learning Method for Generalized Multi-instance P...
Sort
View
139
Voted
AAAI
2011
14 years 2 months ago
Sparse Matrix-Variate t Process Blockmodels
We consider the problem of modeling network interactions and identifying latent groups of network nodes. This problem is challenging due to the facts i) that the network nodes are...
Zenglin Xu, Feng Yan, Yuan Qi
COLT
2006
Springer
15 years 6 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
149
Voted
SIGIR
2011
ACM
14 years 5 months ago
Functional matrix factorizations for cold-start recommendation
A key challenge in recommender system research is how to effectively profile new users, a problem generally known as cold-start recommendation. Recently the idea of progressivel...
Ke Zhou, Shuang-Hong Yang, Hongyuan Zha
109
Voted
CSDA
2007
105views more  CSDA 2007»
15 years 2 months ago
Model selection for support vector machines via uniform design
The problem of choosing a good parameter setting for a better generalization performance in a learning task is the so-called model selection. A nested uniform design (UD) methodol...
Chien-Ming Huang, Yuh-Jye Lee, Dennis K. J. Lin, S...
119
Voted
KDD
2006
ACM
167views Data Mining» more  KDD 2006»
16 years 2 months ago
Identifying "best bet" web search results by mining past user behavior
The top web search result is crucial for user satisfaction with the web search experience. We argue that the importance of the relevance at the top position necessitates special h...
Eugene Agichtein, Zijian Zheng