10.7 Bipartite ranking. Suppose that we use a binary classi er for ranking in the bipartite setting....
Question:
10.7 Bipartite ranking. Suppose that we use a binary classier for ranking in the bipartite setting. Prove that if the error of the binary classier is , then that of the ranking it induces is also at most . Show that the converse does not hold.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Foundations Of Machine Learning
ISBN: 9780262351362
2nd Edition
Authors: Mehryar Mohri, Afshin Rostamizadeh
Question Posted: