Abstract
The following paper activates polynomial methods for data analysis.We want to embed a given formal context into a polynomial context \((K^n,K[x_1, . . . , x_n], \bot\)) in such a way that implications can be computed in the polynomial context, using the algebraic structure. The basic ideas of formal concept analysis that are needed here are sketched in [TB1].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ganter, B., Wille, R.: Formale Begriffsanalyse Mathematische Grundlagen. Springer, Heidelberg (1996)
Kunz, E.: Einführung in die kommutative Algebra und Algebraische Geometrie. Vieweg, Braunschweig (1980)
Krantz, D.H., et al.: Foundations of Measurement. Academic Press, London (1971)
Becker, T.: Features of Interaction between Formal Concept Analysis and Algebraic Geometry. TU Darmstadt
Becker, T.: General Algebraic Geometry, TU Darmstadt
Vogt, F.: Bialgebraic Contexts. Shaker, Aachen (1994)
Wille, U.: Geometric Representation of Ordinal Contexts. Dissertation, Giessen (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Becker, T. (2007). Polynomial Embeddings and Representations. In: Kuznetsov, S.O., Schmidt, S. (eds) Formal Concept Analysis. ICFCA 2007. Lecture Notes in Computer Science(), vol 4390. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70901-5_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-70901-5_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70828-5
Online ISBN: 978-3-540-70901-5
eBook Packages: Computer ScienceComputer Science (R0)