Rough sets and textural neighbourhoods

8Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this work, we discuss the neighbourhoods and approximation operators using p-sets and q-sets of a texture. Here, we show that the presections of a direlation correspond to lower and upper approximations in terms of successor neighbourhood operators while the sections of a direlation correspond to lower and upper approximations in terms of predecessor neighbourhood operators. For discrete textures, we observe that the weak forms of definabilities are preserved under the relation preserving bijective functions where the inverses are also relation preserving.

Cite

CITATION STYLE

APA

Diker, M., Uğur, A. A., & Bayhan, S. (2015). Rough sets and textural neighbourhoods. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9436, pp. 202–213). Springer Verlag. https://doi.org/10.1007/978-3-319-25754-9_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free