144 search results - page 9 / 29 » An Efficient Reduction of Ranking to Classification |
KDD
2004
ACM
14 years 7 months ago
2004
ACM
Dimension reduction is a critical data preprocessing step for many database and data mining applications, such as efficient storage and retrieval of high-dimensional data. In the ...
UAI
2004
13 years 8 months ago
2004
In this paper we define conditional random fields in reproducing kernel Hilbert spaces and show connections to Gaussian Process classification. More specifically, we prove decompo...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
AAAI
2008
13 years 9 months ago
2008
This paper addresses the problem of plan recognition for multi-agent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. ...
SIAMJO
2000
13 years 7 months ago
2000
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...