AI Chat AI Image Generator AI Video Text to Speech

On Ranking Senators By Their Votes

09/08/2009

∙

by Mugizi Rwebangira, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 01/27/2023

Semi-Supervised Machine Learning: a Homological Approach

In this paper we describe the mathematical foundations of a new approach...

0 Adrián Inés, et al. ∙

research

∙ 08/04/2014

Estimating Maximally Probable Constrained Relations by Mathematical Programming

Estimating a constrained relation is a fundamental problem in machine le...

0 Lizhen Qu, et al. ∙

research

∙ 02/09/2020

Rough Set based Aggregate Rank Measure its Application to Supervised Multi Document Summarization

Most problems in Machine Learning cater to classification and the object...

0 Nidhika Yadav, et al. ∙

research

∙ 11/07/2008

Statistical ranking and combinatorial Hodge theory

We propose a number of techniques for obtaining a global ranking from da...

0 Xiaoye Jiang, et al. ∙

research

∙ 03/14/2022

A Supervised Learning Approach to Rankability

The rankability of data is a recently proposed problem that considers th...

0 Nathan McJames, et al. ∙

research

∙ 07/02/2013

Semi-supervised Ranking Pursuit

We propose a novel sparse preference learning/ranking algorithm. Our alg...

0 Evgeni Tsivtsivadze, et al. ∙

research

∙ 07/24/2019

Production Ranking Systems: A Review

The problem of ranking is a multi-billion dollar problem. In this paper ...

0 Murium Iqbal, et al. ∙