Skip to main content

Preclusivity and Simple Graphs

  • Conference paper
  • First Online:
Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing

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

Abstract

The adjacency relation of a simple undirected graph is a preclusive (irreflexive and symmetric) relation. Hence, it originates a preclusive space enabling us to define the lower and upper preclusive approximations of graphs and two orthogonality graphs. Further, the possibility of defining the similarity lower and upper approximations and the sufficiency operator on graphs will be investigated, with particular attention to complete and bipartite graphs. All these mappings will be put in relation with Formal Concept Analysis and the theory of opposition.

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

Access this chapter

Institutional subscriptions

References

  1. Cattaneo, G.: Generalized rough sets (preclusivity fuzzy-intuitionistic (BZ) lattices). Stud. Logica 01, 47–77 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cattaneo, G.: Abstract approximation spaces for rough theories. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery 1: Methodology and Applications. Studies in Fuzziness and Soft Computing, pp. 59–98. Physica, Heidelberg (1998)

    Google Scholar 

  3. Cattaneo, G., Nisticò, G.: Brouwer-Zadeh posets and three valued Łukasiewicz posets. Fuzzy Sets Syst. 33, 165–190 (1989)

    Article  MATH  Google Scholar 

  4. Chen, J., Li, J.: An application of rough sets to graph theory. Inf. Sci. 201, 114–127 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chiaselotti, G., Ciucci, D., Gentile, T.: Simple undirected graphs as formal contexts. In: Baixeries, J., Sacarea, C., Ojeda-Aciego, M. (eds.) ICFCA 2015. LNCS, vol. 9113, pp. 287–302. Springer, Heidelberg (2015)

    Chapter  MATH  Google Scholar 

  6. Chiaselotti, G., Ciucci, D., Gentile, T., Infusino, F.: Rough set theory applied to simple undirected graphs. In: Ciucci, D., Wang, G., Mitra, S., Wu, W. (eds.) RSKT 2015. LNCS, vol. 9436. Springer, Heidelberg (2015)

    Google Scholar 

  7. Chiaselotti, G., Ciucci, D., Gentile, T., Infusino, F.: Preclusivity and simple graphs: the \(n\)-cycle and \(n\)-path cases. In: Yao, Y., Hu, Q., Yu, H., Grzymala-Busse, J. (eds.) RSFDGrC 2015. LNCS, vol. 9437, pp. 138–148. Springer, Heidelberg (2015)

    Google Scholar 

  8. Ciucci, D., Dubois, D., Prade, H.: Opposition in rough set theory. In: Li, T., Nguyen, H.S., Wang, G., Grzymala-Busse, J., Janicki, R., Hassanien, A.E., Yu, H. (eds.) RSKT 2012. LNCS, vol. 7414, pp. 504–513. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  9. Ciucci, D., Dubois, D., Prade, H.: The structure of opposition in rough set theory and formal concept analysis - toward a new bridge between the two settings. In: Beierle, C., Meghini, C. (eds.) FoIKS 2014. LNCS, vol. 8367, pp. 154–173. Springer, Heidelberg (2014)

    Chapter  MATH  Google Scholar 

  10. David, H.A.: The Method of Paired Comparisons. Oxford University Press, New York (1988)

    MATH  Google Scholar 

  11. Diestel, R.: Graph Theory. Graduate Text in Mathematics, 4th edn. Springer, Heidelberg (2010)

    Book  MATH  Google Scholar 

  12. Düntsch, I., Orlowska, E.: Beyond modalities: sufficiency and mixed algebras. In: Orlowska, E., Szalas, A. (eds.) Relational Methods for Computer Science Applications, pp. 263–285. Physica-Verlag, Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Dubois, D., Prade, H.: From Blanché’s hexagonal organization of concepts to formal concept analysis and possibility theory. Logica Universalis 6, 149–169 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  14. Epasto, A., Feldman, J., Lattanzi, S., Leonardi, S., Mirrokni, V., Reduce and aggregate: similarity ranking in multi-categorical bipartite graphs. In: Proceedings of World wide web (WWW 2014), pp. 349–360. ACM

    Google Scholar 

  15. Ganter, B., Wille, R.: Formal Concept Analysis. Mathematical Foundations. Springer, Heidelberg (1999)

    Book  MATH  Google Scholar 

  16. Kuznetsov, S.O.: Mathematical aspects of concept analysis. J. Math. Sci. 80, 1654–1698 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  17. Skowron, A., Stepaniuk, J.: Tolerance approximation spaces. Fundam. Inform. 27, 245–253 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  18. Yao, Y.Y.: Duality in rough set theory based on the square of opposition. Fundam. Informaticae 127, 49–64 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  19. Yao, J.T., Ciucci, D., Zhang, Y.: Generalized rough sets. In: Kacprzyk, P. (ed.) Handbook of Computational Intelligence, Chapter 25, pp. 413–424. Springer, Heidelberg (2015)

    Google Scholar 

  20. Yao, Y.Y., Lin, T.Y.: Generalization of rough sets using modal logics. Intell. Autom. Soft Comput. 2, 103–120 (1996)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Davide Ciucci .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Chiaselotti, G., Ciucci, D., Gentile, T., Infusino, F. (2015). Preclusivity and Simple Graphs. In: Yao, Y., Hu, Q., Yu, H., Grzymala-Busse, J.W. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. Lecture Notes in Computer Science(), vol 9437. Springer, Cham. https://doi.org/10.1007/978-3-319-25783-9_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25783-9_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25782-2

  • Online ISBN: 978-3-319-25783-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics