Density estimation from unweighted k-nearest neighbor graphs: A roadmap

Advances in Neural Information Processing Systems

Volumn , Issue , 2013, Pages

  Von Luxburg, Ulrike ^a   Alamgir, Morteza ^a  

^a UNIVERSITY OF HAMBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENCY MATRICES; DENSITY ESTIMATION; K-NEAREST NEIGHBOR GRAPHS; LOCAL FUNCTIONS; ROADMAP; SHORTEST PATH; SIMILARITY SCORES;

ESTIMATION;

EID: 84898933731     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. S. Agarwal, J. Wills, L. Cayton, G. Lanckriet, D. Kriegman, and S. Belongie. Generalized nonmetric multidimensional scaling. In AISTATS, 2007.
2. M. Alamgir and U. von Luxburg. Shortest path distance in random k-nearest neighbor graphs. In International Conference on Machine Learning (ICML), 2012.
3. N. Alon, M. Bǎdoiu, E. Demaine, M. Farach-Colton, M. Hajiaghayi, and A. Sidiropoulos. Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics. ACM Transactions on Algorithms, 4(4):46, 2008.
4. M. Bǎdoiu, E. Demaine, M. Hajiaghayi, A. Sidiropoulos, and M. Zadimoghaddam. Ordinal embedding: approximation algorithms and dimensionality reduction. In Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. Springer, 2008.
5. Y. Bilu and N. Linial. Monotone maps, sphericity and bounded second eigenvalue. Journal of Combinatorial Theory, Series B, 95(2):283-299, 2005.
6. I. Borg and P. Groenen. Modern multidimensional scaling: Theory and applications. Springer, 2005.
7. D. Burago, Y. Burago, and S. Ivanov. A course in metric geometry. American Mathematical Society, 2001.
8. G. Gutin, E. Kim, M. Mnich, and A. Yeo. Ordinal embedding relaxations parameterized above tight lower bound. arXiv preprint arXiv:0907.5427, 2009.
9. K. Jamieson and R. Nowak. Low-dimensional embedding using adaptively selected ordinal data. In Conference on Communication, Control, and Computing, pages 1077-1084, 2011.
10. B. McFee and G. Lanckriet. Partial order embedding with multiple kernels. In International Conference on Machine Learning (ICML), 2009.
11. H. Ouyang and A. Gray. Learning dissimilarities by ranking: from SDP to QP. In International Conference on Machine Learning (ICML), pages 728-735, 2008.
12. M. Schultz and T. Joachims. Learning a distance metric from relative comparisons. In Neural Information Processing Systems (NIPS), 2004.
13. B. Shaw and T. Jebara. Structure preserving embedding. In International Conference on Machine Learning (ICML), 2009.
14. B. Shaw, B. Huang, and T. Jebara. Learning a distance metric from a network. Neural Information Processing Systems (NIPS), 2011.
15. R. Shepard. Metric structures in ordinal data. Journal of Mathematical Psychology, 3(2):287-315, 1966.