Skip to main content

On the Choice of the Kernel Function in Kernel Discriminant Analysis Using Information Complexity

  • Conference paper
Data Analysis, Classification and the Forward Search

Abstract

In this short paper we shall consider the Kernel Fisher Discriminant Analysis (KFDA) and extend the idea of Linear Discriminant, Analysis (LDA) to nonlinear feature space. We shall present a new method of choosing the optimal kernel function and its effect on the KDA classifier using information-theoretic complexity measure.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • ARONSZAJN, N. (1950): Theory of reproducing kernels. Transactions of the American Mathematical Society, 68, 337–404.

    Article  MATH  Google Scholar 

  • BOZDOGAN, H. (1988): ICOMP: A New Model-Selection Criterion. In Hans H. Bock (Ed.): Classification and Related Methods of Data, Analysis, Elsevier Science Publishers B. V. (North Holland), Amsterdam, 599–608.

    Google Scholar 

  • BOZDOGAN, H. (1990): On the information-based measure of covariance complexity and its application to the evaluation of multivariate linear models. Communications in Statistics Theory and Methods, 19(1), 221–278.

    Article  MATH  Google Scholar 

  • BOZDOGAN, H. (1994): Mixture-model cluster analysis using model selection criteria and a new informational measure of complexity. In H. Bozdogan (Ed.). Multivariate Statistical Modeling, Vol. 2. Kluwer Academic Publishers, Dordrecht, the Netherlands. 69–113.

    Google Scholar 

  • BOZDOGAN, H. (2000): Akaike’s information criterion and recent developments in informational complexity. Journal of Mathematical Psychology, 44, 62–91.

    Article  MATH  Google Scholar 

  • BOZDOGAN, H. (2004). Intelligent statistical data mining with information complexity and genetic algorithms. In H. Bozdogan (Ed.) Statistical Data Mining and, Knowledge Discovery. Chapman and Hall/CRC, Boca Raton, Florida. 15–56.

    Google Scholar 

  • BOZDOGAN, H. (2006). Information Complexity and, Multivariate Learning Theory with Data, Mining Applications. Forthcoming book.

    Google Scholar 

  • CAWLEY, G. and TALBOT, N.L.C. (2003): Efficient leave-one-out cross-validation of kernel Fisher discriminant classifiers. Paper submitted to Elsevier Science.

    Google Scholar 

  • CHEN, M. C-F. (1976): Estimation of covariance matrices under a quadratic loss function. Research Report S-46, Department of Mathematics, SUNY at Albany, Albany, N.Y., 1–33.

    Google Scholar 

  • CRISTIANINI N. and SHAWE-TAYLOR, J. (2000): An introduction to Support Vector Machines. Cambridge University Press.

    Google Scholar 

  • FRANC, V. and HLAVÁČ, V. (2004): Statistical Pattern Recognition Toolbox for Matlab. Research Report of CMP, Czech Technical University in Prague, No.8.

    Google Scholar 

  • MERCER, J. (1909): Functions of positive and negative type and their connection with the theory of integral equations. Philosophical Transactions Royal Society London, A209, 415–446.

    Article  Google Scholar 

  • MIKA, S. (2002): Kernel Fisher discriminants. Ph.D. Thesis, Technical University of Berlin, Berlin, Germany.

    MATH  Google Scholar 

  • MORGERA. S. D. (1985). Information theoretic covariance complexity and its relation to pattern recognition. IEEE Transactions on Systems, Man, and Cybernetics, SMC-15, 608–619.

    Google Scholar 

  • PRESS, S.J. (1975): Estimation of a normal covariance matrix. University of British Columbia.

    Google Scholar 

  • RIPLEY, B.D. (1994): Neural networks and related methods for classification (with discussion). J. Royal Statistical Soc. Series B, 56: 409–456.

    MATH  Google Scholar 

  • SHURYGIN, A. M. (1983): The linear combination of the simplest discriminator and Fisher’s one. In Nauka (Ed.). Applied Statistics. Moscow, 144–158 (in Russian).

    Google Scholar 

  • VAN EMDEN, M.H. (1971): An Analysis of Complexity. Mathematical Centre Tracts, Amsterdam, 35.

    MATH  Google Scholar 

  • VAPNIK, V. (1995): The Nature of Statistical Learning Theory. Springer-Verlag. New York.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Heidelberg

About this paper

Cite this paper

Bozdogan, H., Camillo, F., Liberati, C. (2006). On the Choice of the Kernel Function in Kernel Discriminant Analysis Using Information Complexity. In: Zani, S., Cerioli, A., Riani, M., Vichi, M. (eds) Data Analysis, Classification and the Forward Search. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-35978-8_2

Download citation

Publish with us

Policies and ethics