Skip to main content

Compound Information Systems

  • Chapter
  • First Online:
Granular-Relational Data Mining

Part of the book series: Studies in Computational Intelligence ((SCI,volume 702))

  • 410 Accesses

Abstract

This chapter provides a general framework for analyzing and processing relational data in a granular computing environment. It introduces compound information systems for relational data. It also extends an attribute-value language for defining relational patterns.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    The approach introduced in this chapter can also be applied with no changes to a framework that uses a covering of the universe to form granules.

  2. 2.

    In this approach the equality relation in the construction of conditions is used. The approach can easily be extended to a case where the conditions are also constructed by applying equality relations and a membership relation.

  3. 3.

    The notation \(SEM_{IS}((a,v))\) is simplified by writing \(SEM_{IS}(a,v)\).

  4. 4.

    Symbolic values are abbreviated to their first letters. Granules in the table are presented in a simplified form, e.g. the granule \(\left( 30,\{3,4\}\right) \) from column age corresponds to the granule \(\left( (age,30),\{3,4\}\right) \).

  5. 5.

    \(SEM_i\) is the semantics of \(L_i\).

  6. 6.

    The index (i.e. the relation identifier) is omitted if this does not lead to a confusion.

  7. 7.

    It is assumed by default that a condition can be constructed based on two key attributes if they are of the same type.

  8. 8.

    The intersection of \(A_i\) and \(A_j\) is empty because all attributes names are distinct from one another, e.g. \(customer.id\ne purchase.id\).

  9. 9.

    1. The subset of \(A_i\) that consists of all key attributes is denoted by \((A_i)_{key}\). 2. As previously, it is assumed that key attributes are of the same type.

  10. 10.

    \(\pi _{A}(\bullet )\) is understood as a projection over the attributes from A.

  11. 11.

    The rule conclusion is a trivial formula and means that an object which satisfies the formula belongs to the relation.

  12. 12.

    Proofs of the propositions formulated in this chapter can be found in [41].

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Piotr Hońko .

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Hońko, P. (2017). Compound Information Systems. In: Granular-Relational Data Mining. Studies in Computational Intelligence, vol 702. Springer, Cham. https://doi.org/10.1007/978-3-319-52751-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-52751-2_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-52750-5

  • Online ISBN: 978-3-319-52751-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics