Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2929))

  • 393 Accesses

Abstract

From numerical mathematics we know that a linear equation Ax=b may be solved more efficiently if a reduction of A as A=\(\left(\begin{array}{cc} B ~ O \\ C ~ D \\ \end{array}\right)\) is known beforehand. For the task \(\left(\begin{array}{cc} B ~ O \\ C ~ D \\ \end{array}\right) \cdot \left(\begin{array}{c} y \\ z \\ \end{array}\right) = \left(\begin{array}{c} c \\ d \\ \end{array}\right)\), one will solve By=c first and then Dz=d-Cy. Having an a priori knowledge of this kind is also an advantage in many other application fields. We here deal with a diversity of techniques to decompose relations according to some criteria and embed these techniques in a common framework. The results of decompositions obtained may be used in decision making, but also as a support for teaching, as they often give visual help.

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

  1. Bapat, R.B., Raghavan, T.E.S.: Nonnegative Matrices and Applications. Encyclopaedia of Mathematics and its Applications, vol. 64. Cambridge University Press, Cambridge (1996)

    Google Scholar 

  2. Džeroski, S., Lavrač, N. (eds.): Relational Data Mining. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  3. Kitainik, L.: Fuzzy Decision Procedures With Binary Relations – Towards a Unified Theory. Theory and Decision Library, Series D: System Theory, Knowledge Engineering and Problem Solving, vol. 13. Kluwer Academic Publishers, Dordrecht (1993)

    MATH  Google Scholar 

  4. Schmidt, G.: Decomposing Relations – Data Analysis Techniques for Boolean Matrices. Technical Report 2002-09, Fakultät für Informatik, Universität der Bundeswehr München, 79 p. (2002), http://ist.unibw-muenchen.de/People/schmidt/DecompoHomePage.html

  5. Schmidt, G.: Relational Language. Technical Report 2003, Fakultät für Informatik, Universität der Bundeswehr München (2003) (in preparation)

    Google Scholar 

  6. Schmidt, G., Ströhlein, T.: Relationen und Graphen. Mathematik für Informatiker. Springer, Heidelberg (1989) ISBN 3-540-50304-8, ISBN 0-387- 50304-8

    MATH  Google Scholar 

  7. Schmidt, G., Ströhlein, T.: Relations and Graphs – Discrete Mathematics for Computer Scientists. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1993) ISBN 3-540-56254-0, ISBN 0-387- 56254-0

    MATH  Google Scholar 

  8. Winter, M.: Decomposing Relations Into Orderings. In: Participants Proc. of the International Workshop RelMiCS ’7 Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra, in combination with a workshop of the COST Action 274, TARSKI, pp. 190–196 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Schmidt, G. (2003). Theory Extraction in Relational Data Analysis. In: de Swart, H., Orłowska, E., Schmidt, G., Roubens, M. (eds) Theory and Applications of Relational Structures as Knowledge Instruments. Lecture Notes in Computer Science, vol 2929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24615-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24615-2_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20780-1

  • Online ISBN: 978-3-540-24615-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics