Skip to main content
SpringerLink
Log in

Relational Granularity for Hypergraphs

  • Conference paper
Rough Sets and Current Trends in Computing (RSCTC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6086))

Included in the following conference series:

Abstract

A set of subsets of a set may be seen as granules that allow arbitrary subsets to be approximated in terms of these granules. In the simplest case of rough set theory, the set of granules is required to partition the underlying set, but granulations based on relations more general than equivalence relations are well-known within rough set theory. The operations of dilation and erosion from mathematical morphology, together with their converse forms, can be used to organize different techniques of granular approximation for subsets of a set with respect to an arbitrary relation. The extension of this approach to granulations of sets with structure is examined here for the case of hypergraphs. A novel notion of relation on a hypergraph is presented, and the application of these relations to a theory of granularity for hypergraphs is discussed.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as 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

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. Berge, C.: Hypergraphs: Combinatorics of Finite Sets. North-Holland Mathematical Library, vol. 45. North-Holland, Amsterdam (1989)

    Book  MATH  Google Scholar 

  2. Bloch, I., Heijmans, H.J.A.M., Ronse, C.: Mathematical morphology. In: Aiello, M., Pratt-Hartmann, I., van Benthem, J. (eds.) Handbook of Spatial Logics, ch. 14, pp. 857–944. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Bloch, I.: On links between mathematical morphology and rough sets. Pattern Recognition 33, 1487–1496 (2000)

    Article  Google Scholar 

  4. Brown, R., Morris, I., Shrimpton, J., Wensley, C.D.: Graphs of Morphisms of Graphs. Bangor Mathematics Preprint 06.04, Mathematics Department, University of Wales, Bangor (2006)

    Google Scholar 

  5. Lin, T.Y.: Granular computing on binary relations I, II. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery, pp. 107–140. Physica-Verlag, Heidelberg (1998)

    Google Scholar 

  6. Pawlak, Z.: Rough sets. International Journal of Computer and Information Sciences 11, 341–356 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  7. Pagliani, P., Chakraborty, M.: A Geometry of Approximation. Rough Set Theory: Logic, Algebra and Topology of Conceptual Patterns. Trends in Logic, vol. 27. Springer, Heidelberg (2008)

    Google Scholar 

  8. Pawlak, Z., Skowron, A.: Rudiments of rough sets. Information Sciences 177, 3–27 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  9. Rosenthal, K.I.: Quantales and their applications. Pitman Research Notes in Mathematics, vol. 234. Longman, Harlow (1990)

    Google Scholar 

  10. Serra, J.: Image Analysis and Mathematical Morphology. Academic Press, London (1982)

    MATH  Google Scholar 

  11. Skowron, A., Stepaniuk, J.: Tolerance approximation spaces. Fundamenta Informaticae 27, 245–253 (1996)

    MATH  MathSciNet  Google Scholar 

  12. Stell, J.G.: Relations in Mathematical Morphology with Applications to Graphs and Rough Sets. In: Winter, S., Duckham, M., Kulik, L., Kuipers, B., et al. (eds.) COSIT 2007. LNCS, vol. 4736, pp. 438–454. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. Taylor, P.: Practical Foundations of Mathematics. Cambridge University Press, Cambridge (1999)

    MATH  Google Scholar 

  14. Yao, Y.Y.: Relational interpretations of neighborhood operators and rough set approximation operators. Information Sciences 111, 239–259 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  15. Yao, Y.Y.: Information granulation and rough set approximation. International Journal of Intelligent Systems 16, 87–104 (2001)

    Article  MATH  Google Scholar 

  16. Zadeh, L.A.: Towards a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic. Fuzzy Sets and Systems 19, 111–127 (1997)

    Article  MathSciNet  Google Scholar 

  17. Zhu, W.: Generalised rough sets based on relations. Information Sciences 177, 4997–5011 (2007)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Schoool of Computing, University of Leeds, LS2 9JT, U.K.

    John G. Stell

Authors
  1. John G. Stell
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics, Warsaw University, Banacha 2, 02-097, Warsaw, Poland

    Marcin Szczuka

  2. ICS, Warsaw University of Technology,,  

    Marzena Kryszkiewicz

  3. Department of Applied Computer Science, University of Winnipeg, R3B 2E9, Winnipeg, Manitoba, Canada

    Sheela Ramanna

  4. Dept. of Computer Science, The University of Wales, Aberystwyth, UK

    Richard Jensen

  5. Harbin Institute of Technology, PO Box 458, 150006, Harbin, China

    Qinghua Hu

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stell, J.G. (2010). Relational Granularity for Hypergraphs. In: Szczuka, M., Kryszkiewicz, M., Ramanna, S., Jensen, R., Hu, Q. (eds) Rough Sets and Current Trends in Computing. RSCTC 2010. Lecture Notes in Computer Science(), vol 6086. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13529-3_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13529-3_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13528-6

  • Online ISBN: 978-3-642-13529-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation