Back
Ranking on Data Manifolds
The Google search engine has enjoyed a huge success with its web page ranking algorithm, which exploits global, rather than local, hyperlink structure of the web using random walks. Here we propose a simple universal ranking algorithm for data lying in the Euclidean space, such as text or image data. The core idea of our method is to rank the data with respect to the intrinsic manifold structure collectively revealed by a great amount of data. Encouraging experimental results from synthetic, image, and text data illustrate the validity of our method.
@inproceedings{2334, title = {Ranking on Data Manifolds}, journal = {Advances in Neural Information Processing Systems}, booktitle = {Advances in neural information processing systems 16}, abstract = {The Google search engine has enjoyed a huge success with its web page ranking algorithm, which exploits global, rather than local, hyperlink structure of the web using random walks. Here we propose a simple universal ranking algorithm for data lying in the Euclidean space, such as text or image data. The core idea of our method is to rank the data with respect to the intrinsic manifold structure collectively revealed by a great amount of data. Encouraging experimental results from synthetic, image, and text data illustrate the validity of our method.}, pages = {169-176}, editors = {S Thrun and L Saul and B Sch{\"o}lkopf}, publisher = {MIT Press}, organization = {Max-Planck-Gesellschaft}, institution = {Max Planck Institute for Biological Cybernetics}, school = {Biologische Kybernetik}, address = {Cambridge, MA, USA}, month = jun, year = {2004}, slug = {2334}, author = {Zhou, D. and Weston, J. and Gretton, A. and Bousquet, O. and Sch{\"o}lkopf, B.}, month_numeric = {6} }