Sciweavers

51 search results - page 4 / 11
» Discovering bucket orders from full rankings
Sort
View
ICML
2010
IEEE
13 years 8 months ago
On the Consistency of Ranking Algorithms
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
John Duchi, Lester W. Mackey, Michael I. Jordan
IMC
2007
ACM
13 years 9 months ago
Network loss inference with second order statistics of end-to-end flows
We address the problem of calculating link loss rates from end-to-end measurements. Contrary to existing works that use only the average end-to-end loss rates or strict temporal c...
Hung Xuan Nguyen, Patrick Thiran
RECSYS
2009
ACM
14 years 2 months ago
Ordering innovators and laggards for product categorization and recommendation
Different buyers exhibit different purchasing behaviors. Some rush to purchase new products while others tend to be more cautious, waiting for reviews from people they trust. In...
Sarah K. Tyler, Shenghuo Zhu, Yun Chi, Yi Zhang
PKDD
1999
Springer
106views Data Mining» more  PKDD 1999»
13 years 11 months ago
Heuristic Measures of Interestingness
When mining a large database, the number of patterns discovered can easily exceed the capabilities of a human user to identify interesting results. To address this problem, variou...
Robert J. Hilderman, Howard J. Hamilton
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
14 years 8 months ago
Learning optimal ranking with tensor factorization for tag recommendation
Tag recommendation is the task of predicting a personalized list of tags for a user given an item. This is important for many websites with tagging capabilities like last.fm or de...
Steffen Rendle, Leandro Balby Marinho, Alexandros ...