92 search results - page 4 / 19 » Learning valued preference structures for solving classifica... |
115
click to vote
CVPR
2010
IEEE
15 years 22 days ago
2010
IEEE
A clustering framework within the sparse modeling and dictionary learning setting is introduced in this work. Instead of searching for the set of centroid that best fit the data, ...
71
Voted
PODC
2010
ACM
14 years 11 months ago
2010
ACM
Low overhead analysis of large distributed data sets is necessary for current data centers and for future sensor networks. In such systems, each node holds some data value, e.g., ...
ICML
1998
IEEE
15 years 10 months ago
1998
IEEE
Predicting items a user would like on the basis of other users' ratings for these items has become a well-established strategy adopted by many recommendation services on the ...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
NIPS
2008
14 years 11 months ago
2008
Ranking is at the heart of many information retrieval applications. Unlike standard regression or classification in which we predict outputs independently, in ranking we are inter...