Lens depth function and k-relative neighborhood graph: versatile tools for ordinal data analysis

23 February 2016

Papers citing "Lens depth function and k-relative neighborhood graph: versatile tools for ordinal data analysis"

11 / 11 papers shown

Title
Comparison Based Nearest Neighbor Search Siavash Haghiri Debarghya Ghoshdastidar U. V. Luxburg 38 33 0 05 Apr 2017
Low-dimensional Data Embedding via Robust Ranking Ehsan Amid Nikos Vlassis Manfred K. Warmuth 3DPC 34 5 0 30 Nov 2016
Finite Sample Prediction and Recovery Bounds for Ordinal Embedding Lalit P. Jain Kevin Jamieson Robert D. Nowak 56 69 0 22 Jun 2016
Some theory for ordinal embedding E. Arias-Castro 35 40 0 13 Jan 2015
Efficient Online Relative Comparison Kernel Learning Eric Heim M. Berger Lee M. Seversky Milos Hauskrecht 31 11 0 06 Jan 2015
Metric recovery from directed unweighted graphs Tatsunori B. Hashimoto Yi Sun Tommi Jaakkola 37 21 0 20 Nov 2014
Cost-Effective HITs for Relative Similarity Comparisons Michael J. Wilber Iljung S. Kwak Serge J. Belongie 40 81 0 12 Apr 2014
Depth statistics K. Mosler 94 107 0 20 Jul 2012
Adaptively Learning the Crowd Kernel Omer Tamuz Ce Liu Serge Belongie Ohad Shamir Adam Tauman Kalai 61 89 0 05 May 2011
Learning Multi-modal Similarity Brian McFee Gert R. G. Lanckriet 40 158 0 30 Aug 2010
A Tutorial on Spectral Clustering U. V. Luxburg 181 10,497 0 01 Nov 2007