Parametric embedding for class visualization

Neural Computation

Volumn 19, Issue 9, 2007, Pages 2536-2556

  Iwata, Tomoharu ^a   Saito, Kazumi ^a   Ueda, Naonori ^a   Stromsten, Sean ^b   Griffiths, Thomas L ^c   Tenenbaum, Joshua B ^d  

^a NTT Corporation   (Japan)

^b BAE SYSTEMS   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; EMBEDDINGS; STATISTICS; WEBSITES;

CLASS STRUCTURES; CONDITIONAL PROBABILITIES; DATAPOINTS; EMBEDDING ALGORITHMS; EMBEDDINGS; GAUSSIAN-MIXTURES; INPUT DATAS; KULLBACK LEIBLER DIVERGENCE; LOW DIMENSIONAL; SEMI-SUPERVISED;

VISUALIZATION;

EID: 34548617417     PISSN: 08997667     EISSN: 1530888X     Source Type: Journal    
DOI: 10.1162/neco.2007.19.9.2536     Document Type: Article

References (20)

1. Baudat, G., & Anouar, F. (2000). Generalized discriminant analysis using a kernel approach. Neural Computation, 22,2385-2404.
2. Belhumeur, P., Hespanha, P., & Kriegman, D. (1997). Eigenfaces vs. Fisherfaces: Recognition using class specific linear projection. IEEE Trans. Pattern Analysis and Machine Intelligence, 19, 711-720.
3. Blei, D., Ng, A., & Jordan, M. (2003). Latent Dirichlet allocation. Journal of Machine Learning Research, 3, 993-1022.
4. de Silva, V., & Tenenbaum, J. (2003). Global versus local methods in nonlinear dimensionality reduction. In S. Becker, S. Thrun, & K. Obermayer (Eds.), Advances in mural information processing systems, 15 (pp. 705-712). Cambridge, MA: MIT Press.
5. Fisher, R. (1950). The use of multiple measurements in taxonomic problem. Annuals of Eugenics, 7, 179-188.
6. Fukunaga, K. (1990). Introduction to statistical pattern recognition. New York: Academic Press.
7. Gilks, W. R., Richardson, S., & Spiegelhalter, D. J. (1996). Markov chain Monte Carlo in practice. New York: Chapman & Hall.
8. Globerson, A., Chechik, G., Pereira, F., & Tishby, N. (2005). Euclidean embedding of co-occurrence data. In L. K. Saul, Y Weiss, & L. Bottou (Eds.), Advances in neural information processing systems, 17 (pp. 497-504). Cambridge, MA: MIT Press.
9. Golub, G., & Van Loan, C (1996). Matrix computation (3rd ed.). Baltimore, MD: John Hopkins University Press.
10. Griffiths, T., & Steyvers, M. (2004). Finding scientific topics. Proceedings of the National Academy of Sciences, 101, 5228-5235.
11. Hinton, G., & Roweis, S. (2002). Stochastic neighbor embedding. In S. Becker, S. Thrun, & K. Obermayer (Eds.), Advances in neural information processing systems, 15 (pp. 833-840). Cambridge, MA: MIT Press.
12. Jolliffe, I. (1980). Principal component analysis. New York: Springer-Verlag.
13. McCallum, A., & Nigam, K. (1998). A comparison of event models for naive Bayes text classification. In Proceedings of the AAAI workshop on Learning for Text Categorizatbn (pp. 41-48). New York: AAAI Press.
14. Mei, G., & Shelton, C. (2006). Visualization of collaborative data. In Proceedings of the International Conference on Uncertainty in Artificial Intelligence, (pp. 341-348). Cambridge, MA: AUAI Press.
15. Mika, S., Ratsch, G., Weston, J., Schölkopf, B., & Müller, K.-R. (1999). Fisher discriminant analysis with kernels. In Proceedings of the IEEE Neural Networks for Signal Processing IX (pp. 41-48). Piscataway, NJ: IEEE Press.
16. Roweis, S., & Saul, L. (2000). Nonlinear dimensionality reduction by local linear embedding. Science, 290, 2323-2326.
17. Saito, K., & Nakano, R. (1997). Partial BFGS update and efficient step-length calculation for three-layer neural networks. Neural Computation, 9, 123-141.
18. Tenenbaum, J., de Silva, V., & Langford, J. (2000). A global geometric framework for nonlinear dimensionality reduction. Science, 290, 2319-2323.
19. Torgerson, W. (1958). Theory and methods of scaling. New York: Wiley.
20. Yamada, T., Saito, K., & Ueda, N. (2003). Cross-entropy directed embedding of network data. In Proceedings of the International Conference on Machine Learning (pp. 832-839). New York: AAAI Press.