Skip to main content

Representation of Data by Pseudoline Arrangements

  • Conference paper
Information and Classification

Part of the book series: Studies in Classification, Data Analysis and Knowledge Organization ((STUDIES CLASS))

  • 524 Accesses

Abstract

Formal contexts are under certain conditions representable by oriented pseudoline arrangements. Oriented pseudoline arrangements respect the hierarchical order of concept lattices. The formal context is reconstructable out of an oriented pseudoline arrangement. The representation of oriented pseudoline arrangements are quite easy to understand. In general there is no sufficient condition to decide if a context is representable (pictorial) or not. There is an infinite class of minor-minimal non-pictorial contexts. This tells us that excluding a finite number of examples is never sufficient to guarantee that a formal context is pictorial. Oriented pseudoline arrangements are isomorphic to oriented matroids of rank 3. We can therefore use an algorithmic approach which is generating oriented matroids of rank 3 and decide wether a context is representable by an oriented pseudoline arrangement.

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 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

  • Bokowski, J., Guedes De Oliveira, A., and Richter-Gebert, J. (1991), Algebraic varieties characterizing matroids and oriented matroids, Advances in Mathematics, 87, 160–185.

    Article  Google Scholar 

  • Bokowski, J., and Kollewe, W. (1992), On representing contexts in line arrangements, Order, (to appear).

    Google Scholar 

  • Bokowski, J., and Sturmfels, B. (1989), Computational synthetic geometry, Lecture Notes in Mathematics, 1355.

    Google Scholar 

  • Cordovil, R. (1983), Oriented matroids of rank three and arrangements of pseudolines, Annals of Discrete Math., 17, 219–223.

    Google Scholar 

  • Feger, H. (1989), Testdaten als Merkmalsvektoren, Beitrag zur Festschrift für Karl Josef Klauer, ‘Wissenschaft und Verantwortung’, Hogrefe, Göttingen.

    Google Scholar 

  • Folkman, J., and Lawrence, J. (1978), Oriented matroids, J. Combinatorial Theory, B 25, 199–236.

    Google Scholar 

  • Gabriel, K. R. (1981), Biplot display of multivariate matrices of data and diagnosis, in: V. Barnett (ed.), Interpreting multivariate data, Wiley, Chichester, 147–173.

    Google Scholar 

  • Ganter, B., and Wille, R. (1989), Conceptual scaling, in: F. Roberts (ed.), Applications of combinatorics and graph theory to the biological and social sciences, Springer Verlag, New York, 139–167

    Chapter  Google Scholar 

  • Ganter, B., and Wille, R. (1992), Formale Begriffsanalyse, Manuskript 75p.

    Google Scholar 

  • Grünbaum, B. (1972), Arrangements and spreads, American Math. Soc, Regional Conf. Ser. 10, Rhode Island.

    Google Scholar 

  • Kollewe, W. (1989), Evaluation of a survey with methods of formal concept analysis, in: O. Opitz (ed.), Conceptual and numerical analysis of data, Springer Verlag, Berlin-Heidelberg, 123–134.

    Chapter  Google Scholar 

  • Ringel, G. (1956), Teilungen der Ebene durch Geraden und topologische Geraden, Math. Zeitschrift, 64, 79–102.

    Article  Google Scholar 

  • Slater, P. (1977), The measurement of interpersonal space by grid technique, Vol. I and II, Wiley, New York, 1977.

    Google Scholar 

  • Spangenberg, N. and Wolff, K.E. (1988), Conceptual grid evaluation, in: H.H. Bock (ed.), Classification and related methods of data analysis, North-Holland, Amsterdam, 577–580

    Google Scholar 

  • Wille, R. (1984), Liniendiagramme hierarchischer Begriffssysteme, in: H. H. Bock (Hrsg.), Anwendungen der Klassifikation: Datenanalyse und numerische Klassifikation, Indeks-Verlag, Frankfurt, 32–51.

    Google Scholar 

  • Wille, R. (1987), Bedeutungen von Begriffsverbänden, in: B. Ganter, R. Wille, E. Wolff (Hrsg.), Beiträge zur Begriffsanalyse, B.I.-Wissenschaftsverlag, Mannheim-Wien-Zürich, 161–211

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Kollewe, W. (1993). Representation of Data by Pseudoline Arrangements. In: Opitz, O., Lausen, B., Klar, R. (eds) Information and Classification. Studies in Classification, Data Analysis and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-50974-2_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-50974-2_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56736-3

  • Online ISBN: 978-3-642-50974-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics