2011Unpublished venueRequires access

An iterated graph laplacian approach for ranking on manifolds

Xueyuan Zhou, Mikhail Belkin, Nathan Srebro

Open publisher page 35 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 35 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Euclidean space, Ranking (information retrieval), Iterated function, Computer science, Graph, Manifold (fluid mechanics), Nonlinear dimensionality reduction, Laplace operator

Related papers

Back to paper searchBrowse research topicsOriginal source
An iterated graph laplacian approach for ranking on manifolds — Research Paper | ScholarLens