An iterated graph laplacian approach for ranking on manifolds
Xueyuan Zhou, Mikhail Belkin, Nathan Srebro
Abstract
Xueyuan Zhou, Mikhail Belkin, Nathan Srebro
Abstract
Ranking is one of the key problems in information retrieval. Recently, there has been significant interest in a class of ranking algorithms based on the assumption that data is sampled from a low dimensional manifold embedded in a higher dimensional Euclidean space.
OpenAlex reports 35 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Ranking is one of the key problems in information retrieval. Recently, there has been significant interest in a class of ranking algorithms based on the assumption that data is sampled from a low dimensional manifold embedded in a higher dimensional Euclidean space.
Key concepts: Euclidean space, Ranking (information retrieval), Iterated function, Computer science, Graph, Manifold (fluid mechanics), Nonlinear dimensionality reduction, Laplace operator