Fast ranking algorithm for very large data
Dohy Hong

TL;DR
This paper introduces a novel ranking algorithm inspired by diffusion methods, demonstrating potential computational advantages over existing models like PageRank through theoretical and experimental analysis.
Contribution
The paper presents a new mathematical formulation for a ranking algorithm based on diffusion principles, offering computational improvements over traditional methods.
Findings
Shows potential computational gains over PageRank
Provides new mathematical equations for the ranking method
Demonstrates effectiveness through experimental results
Abstract
In this paper, we propose a new ranking method inspired from previous results on the diffusion approach to solve linear equation. We describe new mathematical equations corresponding to this method and show through experimental results the potential computational gain. This ranking method is also compared to the well known PageRank model.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
