Skip to main content

A Variant of the Trace Quotient Formulation for Dimensionality Reduction

  • Conference paper
  • 1655 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 5996))

Abstract

Due to its importance to classification and clustering, dimensionality reduction or distance metric learning has been studied in depth in recent years. In this work, we demonstrate the weakness of a widely-used class separability criterion—trace quotient for dimensionality reduction—and propose new criteria for the dimensionality reduction problem. The proposed optimization problem can be efficiently solved using semidefinite programming, similar to the technique in [1]. Experiments on classification and clustering are performed to evaluate the proposed algorithm. Results show the advantage of the our proposed algorithm.

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. Shen, C., Li, H., Brooks, M.J.: Supervised dimensionality reduction via sequential semidefinite programming. Pattern Recogn. 41(12), 3644–3652 (2008)

    Article  MATH  Google Scholar 

  2. Bar-Hillel, A., Hertz, T., Shental, N., Weinshall, D.: Learning a Mahalanobis metric from equivalence constraints. J. Mach. Learn. Res. 6, 937–965 (2005)

    MathSciNet  Google Scholar 

  3. Yan, S., Tang, X.: Trace quotient problems revisited. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol. 3952, pp. 232–244. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Xing, E., Ng, A., Jordan, M., Russell, S.: Distance metric learning, with application to clustering with side-information. In: Proc. Adv. Neural Inf. Process. Syst. MIT Press, Cambridge (2002)

    Google Scholar 

  5. Kahl, F., Hartley, R.: Multiple view geometry under the L  ∞ -norm. IEEE Trans. Pattern Anal. Mach. Intell. 30(9), 1603–1617 (2008)

    Article  Google Scholar 

  6. Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)

    MATH  Google Scholar 

  7. Grant, M., Boyd, S., Ye, Y.: CVX user’s guide: for cvx version 1.1. Technical report, Stanford University (2007)

    Google Scholar 

  8. Tütüncü, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. 95(2), 189–217 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Newman, D., Hettich, S., Blake, C., Merz, C.: UCI repository of machine learning databases (1998), http://archive.ics.uci.edu/ml/

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

Wang, P., Shen, C., Zheng, H., Ren, Z. (2010). A Variant of the Trace Quotient Formulation for Dimensionality Reduction. In: Zha, H., Taniguchi, Ri., Maybank, S. (eds) Computer Vision – ACCV 2009. ACCV 2009. Lecture Notes in Computer Science, vol 5996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12297-2_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12297-2_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12296-5

  • Online ISBN: 978-3-642-12297-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics