Geometry of Data Tables

  • Tim B. Kaiser
  • Stefan E. Schmidt
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2961)


We introduce the notions of systems of equivalence relations, affine ordered sets and projective ordered sets to draw connections between many-valued contexts, geometry, and order-theory. This gives rise to applications in data analysis and data visualization.


Equivalence Class Equivalence Relation Data Table Data Visualization Identity Relation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [GW99]
    Ganter, B., Wille, R.: Formal Concept Analysis, Mathematical Foundations. Springer, Berlin (1999)zbMATHGoogle Scholar
  2. [Pa91]
    Pawlak, Z.: Rough Sets - Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)zbMATHGoogle Scholar
  3. [Pr95]
    Pratt, V.R.: Chu spaces and their interpretation as concurrent objects. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol. 1000, pp. 392–405. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  4. [Wi70]
    Wille, R.: Kongruenzklassengeometrien. Springer, Berlin (1970)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Tim B. Kaiser
    • 1
    • 2
  • Stefan E. Schmidt
    • 2
  1. 1.Department of MathematicsDarmstadt University of TechnologyDarmstadtGermany
  2. 2.Physical Science LaboratoryNew Mexico State UniversityLas CrucesUSA

Personalised recommendations