Stochastic neighbor compression

31st International Conference on Machine Learning, ICML 2014

Volumn 3, Issue , 2014, Pages 2051-2059

  Kusner, Matt J ^a   Tyree, Stephen ^a   Weinberger, Kilian ^a   Agrawal, Kunal ^a  

^a WASHINGTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DATA COMPRESSION; LEARNING SYSTEMS; STOCHASTIC SYSTEMS; TREES (MATHEMATICS);

1-NEAREST NEIGHBOR; CLASSIFICATION ERRORS; DIMENSIONALITY REDUCTION; NEAREST NEIGHBORS; ORDERS OF MAGNITUDE; STATE-OF-THE-ART ALGORITHMS; SYNTHETIC DATASETS; TREE DATA STRUCTURES;

CLASSIFICATION (OF INFORMATION);

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

References (36)

1. Aly, Mohamed, Munich, Mario, and Perona, Pietro. Indexing in large scale image collections: Scaling properties and benchmark. In WACV, pp. 418-425. IEEE, 2011.
2. Andoni, Alexandr and Indyk, Piotr. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In FOCS, pp. SM45-SM68. IEEE, 2006.
3. Angiulli, F. Fast condensed nearest neighbor rule. In ICML, pp. 25-32, 2005.
4. Bandyopadhyay, S. and Maulik, U. Efficient prototype reordering in nearest neighbor classification. Pattern Recognition, 35(12): 2791-2799, 2002.
5. Belongie, S., Malik, J., and Puzicha, J. Shape matching and object recognition using shape contexts. PAMI, 24(4):509-522, 2002.
6. Bentley, J.L. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9):509- 517, 1975.
7. Bermejo, S. and Cabestany, J. Adaptive soft k-nearest-neighbor classifiers. Pattern Recognition, 32:2077-2979, 1999.
8. Beygelzimer, A., Kakade, S., and Langford, J. Cover trees for nearest neighbor. In ICML, pp. 97-104, 2006.
9. Bishop, C.M. Pattern recognition and machine learning. Springer New York, 2006.
10. Chandrasekhar, Vijay, Takacs, Gabriel, Chen, David, Tsai, Sam S, Singh, Jatinder, and Girod, Bernd. Transform coding of image feature descriptors. In IS&T/SPIE Electronic Imaging, 2009.
11. Chang, C.L. Finding prototypes for nearest neighbor classifiers. IEEE Transactions on Computers, 100(11):1179-1184, 1974.
12. Cover, T. and Hart, P. Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13(1):21-27, 1967.
13. Davis, J.V., Kulis, B., Jain, P., Sra, S., and Dhillon, I.S. Information-theoretic metric learning. In ICML, pp. 209-216, 2007.
14. Decaestecker, C. Finding prototypes for nearest neighbour classification by means of gradient descent and deterministic annealing. Pattern Recognition, 30(2):281-288, 1997.
15. Devi, V.S. and Murty, M.N. An incremental prototype set building technique. Pattern Recognition, 35(2):505-513, 2002.
16. Gates, G.W. The reduced nearest neighbor rule. IEEE Transactions on Information Theory, 18:431-433, 1972.
17. Georghiades, A.S., Belhumeur, P.N., and Kriegman, D.J. From few to many: Illumination cone models for face recognition under variable lighting and pose. PAMI, 23(6):643-660, 2001.
18. Gionis, Aristides, Indyk, Piotr, Motwani, Rajeev, et al. Similarity search in high dimensions via hashing. In VLDB, volume 99, pp. 518-529, 1999.
19. Goldberger, J., Hinton, G.E., Roweis, S.T., and Salakhutdinov, R. Neighbourhood components analysis. In NIPS, pp. 513-520. 2004.
20. Hart, P.E. The condensed nearest neighbor rule. IEEE Transactions on Information Theory, 14:515-516, 1968.
21. Hinton, G.E. and Roweis, S.T. Stochastic neighbor embedding. In NIPS, pp. 833-840. MIT Press, 2002.
22. Kohonen, T. Improved versions of learning vector quantization. In IJCNN, pp. 545-550. IEEE, 1990a.
23. Kohonen, T. The self-organizing map. Proceedings of the IEEE, 78(9):1464-1480, 1990b.
24. Liu, C. L. and Nakagawa, M. Prototype learning algorithms for nearest neighbor classifier with application to handwritten character recognition. In ICDAR, pp. 378-381. IEEE, 1999.
25. Mollineda, R.A., Ferri, F.J., and Vidal, E. An efficient prototype merging strategy for the condensed 1-nn rule through class- conditional hierarchical clustering. Pattern Recognition, 35 (12):2771-2782, 2002.
26. Omohundro, S.M. Five balltree construction algorithms. International Computer Science Institute, Berkeley, 1989.
27. Salzberg, S., Delcher, A.L., Heath, D., and Kasif, S. Best-case results for nearest-neighbor learning. PAMI, 17(6):599-608, 1995.
28. Sarwar, B., Karypis, G., Konstan, J., and Riedl, J. Application of dimensionality reduction in recommender system-a case study. Technical report, DTIC Document, 2000.
29. Simard, P., LeCun, Y., and Denker, J.S. Efficient pattern recognition using a new transformation distance. In NIPS, pp. 50-58, 1992.
30. Tarlow, D., Swersky, K., Charlin, L., Sutskever, I., and Zemel, R. Stochastic k-neighborhood selection for supervised and unsupervised learning. In ICML, pp. 199-207, 2013.
31. Tomek, I. Two modifications of cnn. IEEE Trans, on Systems, Man, and Cybernetics, (11):769-772, 1976.
32. Toussaint, G.T. Proximity graphs for nearest neighbor decision rules: recent progress. Interface, 34, 2002.
33. Tran, D. and Sorokin, A. Human activity recognition with metric learning. In ECCV, pp. 548-561. Springer, 2008.
34. Van der Maaten, L. and Hinton, G. Visualizing data using t-sne. JMLR, 9(2579-2605):85, 2008.
35. Weinberger, K.Q. and Saul, L.K. Fast solvers and efficient implementations for distance metric learning. In ICML, pp. 1160- 1167, 2008.
36. Weinberger, K.Q. and Saul, L.K. Distance metric learning for large margin nearest neighbor classification. JMLR, 10:207- 244, 2009.