Sciweavers

1605 search results - page 85 / 321
» Metric Learning to Rank
Sort
View
CIKM
2010
Springer
13 years 8 months ago
Context modeling for ranking and tagging bursty features in text streams
Bursty features in text streams are very useful in many text mining applications. Most existing studies detect bursty features based purely on term frequency changes without takin...
Wayne Xin Zhao, Jing Jiang, Jing He, Dongdong Shan...
KDD
2012
ACM
254views Data Mining» more  KDD 2012»
12 years 14 days ago
Playlist prediction via metric embedding
Digital storage of personal music collections and cloud-based music services (e.g. Pandora, Spotify) have fundamentally changed how music is consumed. In particular, automatically...
Shuo Chen, Josh L. Moore, Douglas Turnbull, Thorst...
ICML
2006
IEEE
14 years 10 months ago
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
Pradeep D. Ravikumar, John D. Lafferty
AAAI
2004
13 years 11 months ago
A Correspondence Metric for Imitation
Abstract-- Learning by imitation and learning from demonstration have received considerable attention in robotics. However, very little research has been in the direction of provid...
R. Amit, Maja J. Mataric
CBSE
2005
Springer
14 years 3 months ago
Finding a Needle in the Haystack: A Technique for Ranking Matches Between Components
Abstract. Searching and subsequently selecting reusable components from component repositories has become a key impediment for not only component-based development but also for ach...
Naiyana Tansalarak, Kajal T. Claypool