Skip to main content

m-SNE: Multiview Stochastic Neighbor Embedding

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6443))

Abstract

In many real world applications, different features (or multiview data) can be obtained and how to duly utilize them in dimension reduction is a challenge. Simply concatenating them into a long vector is not appropriate because each view has its specific statistical property and physical interpretation. In this paper, we propose a multiview stochastic neighbor embedding (m-SNE) that systematically integrates heterogeneous features into a unified representation for subsequent processing based on a probabilistic framework. Compared with conventional strategies, our approach can automatically learn a combination coefficient for each view adapted to its contribution to the data embedding. Also, our algorithm for learning the combination coefficient converges at a rate of \(O\left(1/k^2\right)\), which is the optimal rate for smooth problems. Experiments on synthetic and real datasets suggest the effectiveness and robustness of m-SNE for data visualization and image retrieval.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Xia, T., Tao, D., Mei, T., Zhang, Y.: Multiview spectral embedding. IEEE Transactions on Systems, Man, and Cybernetics, Part B (2010)

    Google Scholar 

  2. Zhou, T., Tao, D., Wu, X.: Manifold elastic net: a unified framework for sparse dimension reduction. Data Mining and Knowledge Discovery, 1–32 (2010)

    Google Scholar 

  3. Si, S., Tao, D., Chan, K.P.: Evolutionary cross-domain discriminative hessian eigenmaps. IEEE Transactions on Image Processing 19(4), 1075–1086 (2010)

    Article  MathSciNet  Google Scholar 

  4. Si, S., Tao, D., Geng, B.: Bregman divergence based regularization for transfer subspace learning. IEEE Transactions on Knowledge and Data Engineering 22(7), 929–942 (2010)

    Article  Google Scholar 

  5. Tao, D., Li, X., Wu, X., Maybank, S.J.: Geometric mean for subspace selection. IEEE Transactions on Pattern Analysis and Machine Intelligence 31(2), 260–274 (2009)

    Article  Google Scholar 

  6. Zhang, T., Tao, D., Li, X., Yang, J.: Patch alignment for dimensionality reduction. IEEE Transactions on Knowledge and Data Engineering 21(9), 1299–1313 (2009)

    Article  Google Scholar 

  7. Jolliffe, I.T.: Principal Component Analysis. Springer, New York (2002)

    MATH  Google Scholar 

  8. Tenenbaum, J.B., Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290(5500), 2319–2323 (2000)

    Article  Google Scholar 

  9. Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. In: Advances in Neural Information Processing Systems, vol. 14, pp. 585–591. MIT Press, Cambridge (2001)

    Google Scholar 

  10. Roweis, S., Saul, L.: Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500), 2323–2326 (2000)

    Article  Google Scholar 

  11. Saxena, A., Gupta, A., Mukerjee, A.: Non-linear dimensionality reduction by locally linear isomaps.In: Neural Information Processing 2004, pp. 1038–1043 (2004)

    Google Scholar 

  12. Hinton, G., Roweis, S.: Stochastic neighbor embedding. Advances in Neural Information Processing Systems 15, 833–840

    Google Scholar 

  13. Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103(1), 127–152 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  14. van der Maaten, L., Hinton, G.: Visualizing data using t-sne. Journal of Machine Learning Research 9, 2579–2605 (2008)

    MATH  Google Scholar 

  15. Xie, B., Mu, Y., Tao, D.: Multiview stochastic neighbor embedding. Technical report, Nanyang Technological University (2010)

    Google Scholar 

  16. Nesterov, Y.: Gradient methods for minimizing composite objective function. Technical report (2007)

    Google Scholar 

  17. Hull, J.J.: A database for handwritten text recognition research. IEEE Trans. Pattern Anal. Mach. Intell. 16(5), 550–554 (1994)

    Article  Google Scholar 

  18. Fisher, R.A.: The use of multiple measurements in taxonomic problems. Annals of Eugenics 7(2), 179–188 (1936)

    Article  Google Scholar 

  19. Long, B., Yu, P.S., Zhang, Z.M.: A general model for multiple view unsupervised learning. In: Proceedings of the SIAM International Conference on Data Mining, pp. 822–833. SIAM, Atlanta (2008)

    Google Scholar 

  20. Chua, T.S., Tang, J., Hong, R., Li, H., Luo, Z., Zheng, Y.T.: Nus-wide: A real-world web image database from national university of singapore. In: Proc. of ACM Conf. on Image and Video Retrieval (CIVR 2009), Santorini, Greece, July 8-10 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xie, B., Mu, Y., Tao, D. (2010). m-SNE: Multiview Stochastic Neighbor Embedding. In: Wong, K.W., Mendis, B.S.U., Bouzerdoum, A. (eds) Neural Information Processing. Theory and Algorithms. ICONIP 2010. Lecture Notes in Computer Science, vol 6443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17537-4_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17537-4_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17536-7

  • Online ISBN: 978-3-642-17537-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics