Skip to main content
SpringerLink
Log in

Ordinal Factor Analysis

  • Conference paper
Book cover Formal Concept Analysis (ICFCA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7278))

Included in the following conference series:

Abstract

We build on investigations by Keprt, Snásel, Belohlavek, and Vychodil on Boolean Factor Analysis. Rather than minimising the number of Boolean factors we aim at many-valued factorisations with a small number of ordinal factors.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

  1. Keprt, A., Snásel, V.: Binary factor analysis with help of formal concepts. In: Snásel, V., Belohlávek, R., (eds.) CLA. CEUR Workshop Proceedings, vol. 110. CEUR-WS.org (2004)

    Google Scholar 

  2. Keprt, A.: Algorithms for Binary Factor Analysis. PhD thesis (2006)

    Google Scholar 

  3. Belohlávek, R., Vychodil, V.: Formal concepts as optimal factors in boolean factor analysis: Implications and experiments. In: Eklund, P.W., Diatta, J., Liquiere, M., (eds.) CLA. CEUR Workshop Proceedings, vol. 331. CEUR-WS.org (2007)

    Google Scholar 

  4. Belohlávek, R., Vychodil, V.: Discovery of optimal factors in binary data via a novel method of matrix decomposition. J. Comput. Syst. Sci. 76(1), 3–20 (2010)

    Article  MATH  Google Scholar 

  5. De Boeck, P., Rosenberg, S.: Hierarchical classes: model and data analysis. Psychometrika 53, 361–381 (1988)

    Article  MATH  Google Scholar 

  6. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)

    Book  MATH  Google Scholar 

  7. Wille, R.: Formal Concept Analysis as Mathematical Theory of Concepts and Concept Hierarchies. In: Ganter, B., Stumme, G., Wille, R. (eds.) Formal Concept Analysis. LNCS (LNAI), vol. 3626, pp. 1–33. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Yannakakis, M.: The complexity of the partial order dimension problem. SIAM Journal on Matrix Analysis and Applications 3(3), 351–358 (1982), http://dx.doi.org/10.1137/0603036

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Algebra, Technische Universität Dresden, Germany

    Bernhard Ganter & Cynthia Vera Glodeanu

Authors
  1. Bernhard Ganter
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cynthia Vera Glodeanu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, University of Nicosia, 46 Makedonitissas Ave., 1700, Nicosia, Cyprus

    Florent Domenach

  2. Higher School of Economics, National Research University, Pokrovsky Boulevard, 109028, Moscow, Russia

    Dmitry I. Ignatov

  3. Faculty of Business and Economics, Katholieke Universiteit Leuven, Naamsestraat 69, 3000, Leuven, Belgium

    Jonas Poelmans

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ganter, B., Glodeanu, C.V. (2012). Ordinal Factor Analysis. In: Domenach, F., Ignatov, D.I., Poelmans, J. (eds) Formal Concept Analysis. ICFCA 2012. Lecture Notes in Computer Science(), vol 7278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29892-9_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29892-9_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29891-2

  • Online ISBN: 978-3-642-29892-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation