Scalable optimization of neighbor embedding for visualization

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 1, 2013, Pages 786-794

  Yang, Zhirong ^a   Peltonen, Jaakko ^a   Kaski, Samuel ^a,b  

^a AALTO UNIVERSITY   (Finland)

^b UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LEARNING SYSTEMS; OPTIMIZATION; THREE DIMENSIONAL COMPUTER GRAPHICS; VISUALIZATION;

BIG DATUM; CENTER OF MASS; DATA SAMPLE; FORCE CALCULATION; GRADIENT BASED; NEIGHBOR EMBEDDING; OPTIMIZATION TECHNIQUES; RECURSIVE DECOMPOSITION;

DATA VISUALIZATION;

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

References (18)

1. Barnes, J. and Hut, P. A hierarchical O(N log N) force-calculation algorithm. Nature, 324(4):446-449, 1986.
2. Beygelzimer, A., Kakade, S., and Langford, J. Cover trees for nearest neighbor. In International Conference on Machine Learning (ICML), pp. 97-104, 2006.
3. Carreira-Perpiñán, M. The elastic embedding algorithm for dimensionality reduction. In International Conference on Machine Learning (ICML), pp. 167-174, 2010.
4. Gray, A. and Moore, A. N-body problems in statistical learning. In Advances in Neural Information Processing Systems (NIPS), pp. 521-527, 2001.
5. Gray, A. and Moore, A. Rapid evaluation of multiple density models. In International Conference on Artificial Intelligence and Statistics (AISTATS), 2003a.
6. Gray, A. and Moore, A. Nonparametric density estimation: toward computational tractability. In In SIAM International Conference on Data Mining (ICDM), 2003b.
7. Greengard, L. and Rokhlin, V. A fast algorithm for particle simulations. Journal of Computational Physics, 73(2):325-348, 1987.
8. Hinton, G.E. and Roweis, S.T. Stochastic neighbor embedding. In Advances in Neural Information Processing Systems (NIPS), pp. 833-840, 2002.
9. Liu, T., Moore, A., Gray, A., and Yang, K. An investigation of practical approximate nearest neighbor algorithms. In Advances in Neural Information Processing Systems (NIPS), pp. 825-832, 2004.
10. Miller, F.P., Vandome, A.F., and McBrewster, J. Distributed Hash Table. Alphascript Publishing, 2010.
11. Noack, A. Energy models for graph clustering. Journal of Graph Algorithms and Applications, 11(2):453-480, 2007.
12. van der Maaten, L. and Hinton, G. Visualizing data using t-SNE. Journal of Machine Learning Research, 9:2579-2605, 2008.
13. Venna, J. and Kaski, S. Nonlinear dimensionality reduction as information retrieval. Journal of Machine Learning Research - Proceedings Track, 2:572-579, 2007.
14. Venna, J., Peltonen, J., Nybo, K., Aidos, H., and Kaski, S. Information retrieval perspective to nonlinear dimensionality reduction for data visualization. Journal of Machine Learning Research, 11:451-490, 2010.
15. Vladymyrov, M. and Carreira-Perpinan, M. Partial-hessian strategies for fast learning of nonlinear embeddings. In International Conference on Machine Learning (ICML), pp. 167-174, 2010.
16. Wang, J., Yang, J., Yu, K., Lv, F., Huang, T., and Gong, Y. Locality-constrained linear coding for image classification. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 3360-3367, 2010.
17. Yang, Z., King, I., Xu, Z., and Oja, E. Heavy-tailed symmetric stochastic neighbor embedding. In Advances in Neural Information Processing Systems (NIPS), volume 22, pp. 2169-2177, 2009.
18. Yianilos, P. Data structures and algorithms for nearest neighbor search in general metric spaces. In Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 311-321, 1993.