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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
Keprt, A.: Algorithms for Binary Factor Analysis. PhD thesis (2006)
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)
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)
De Boeck, P., Rosenberg, S.: Hierarchical classes: model and data analysis. Psychometrika 53, 361–381 (1988)
Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)
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)
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)