Sciweavers

483 search results - page 9 / 97
» Linear Ranking with Reachability
Sort
View
ECML
2007
Springer
14 years 1 months ago
An Unsupervised Learning Algorithm for Rank Aggregation
Many applications in information retrieval, natural language processing, data mining, and related fields require a ranking of instances with respect to a specified criteria as op...
Alexandre Klementiev, Dan Roth, Kevin Small
CONCUR
1997
Springer
13 years 11 months ago
Reachability Analysis of Pushdown Automata: Application to Model-Checking
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
Ahmed Bouajjani, Javier Esparza, Oded Maler
WAOA
2007
Springer
158views Algorithms» more  WAOA 2007»
14 years 1 months ago
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
Anke van Zuylen, David P. Williamson
MOR
2008
110views more  MOR 2008»
13 years 7 months ago
On the Low Rank Solutions for Linear Matrix Inequalities
In this paper we present a polynomial-time procedure to find a low rank solution for a system of Linear Matrix Inequalities (LMI). The existence of such a low rank solution was sh...
Wenbao Ai, Yongwei Huang, Shuzhong Zhang
IJCNN
2006
IEEE
14 years 1 months ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang