English

On Ranking Senators By Their Votes

Machine Learning 2009-09-09 v1 Applications

Abstract

The problem of ranking a set of objects given some measure of similarity is one of the most basic in machine learning. Recently Agarwal proposed a method based on techniques in semi-supervised learning utilizing the graph Laplacian. In this work we consider a novel application of this technique to ranking binary choice data and apply it specifically to ranking US Senators by their ideology.

Keywords

Cite

@article{arxiv.0909.1418,
  title  = {On Ranking Senators By Their Votes},
  author = {Mugizi Rwebangira},
  journal= {arXiv preprint arXiv:0909.1418},
  year   = {2009}
}

Comments

6 pages

R2 v1 2026-06-21T13:43:48.576Z