Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

UAI
2008

favoriteEmaildiscussreport

293views Artificial Intelligence» more UAI 2008»

Estimation and clustering with infinite rankings

13 years 5 months ago

Estimation and clustering with infinite rankings

Download uai2008.cs.helsinki.fi

This paper presents a natural extension of stagewise ranking to the the case of infinitely many items. We introduce the infinite generalized Mallows model (IGM), describe its properties and give procedures to estimate it from data. For estimation of multimodal distributions we introduce the ExponentialBlurring-Mean-Shift nonparametric clustering algorithm. The experiments highlight the properties of the new model and demonstrate that infinite models can be simple, elegant and practical.

Marina Meila, Le Bao

Real-time Traffic

Artificial Intelligence | Infinite Generalized Mallows | Multimodal Distributions | Nonparametric Clustering Algorithm | UAI 2008 |

claim paper

Related Content

» An Exponential Model for Infinite Rankings

» Cluster analysis of heterogeneous rank data

» Clustering through ranking on manifolds

» Random Factors in IOI 2005 Test Case Scoring

» Motion Segmentation from Feature Trajectories with Missing Data

» A Closed Form Solution to Robust Subspace Estimation and Clustering

» Smoothing clickthrough data for web search ranking

» A Metasearch Method with Clustering and Term Correlation

» Moving in Stereo Efficient Structure and Motion Using Lines

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2008
Where	UAI
Authors	Marina Meila, Le Bao

Comments (0)