7.2
CiteScore
3.7
Impact Factor
Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors
Search in posts
Search in pages
Filter by Categories
ABUNDANCE ESTIMATION IN AN ARID ENVIRONMENT
Case Study
Editorial
Invited review
Letter to the Editor
Original Article
REVIEW
Review Article
SHORT COMMUNICATION
7.2
CiteScore
3.7
Impact Factor
Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors
Search in posts
Search in pages
Filter by Categories
ABUNDANCE ESTIMATION IN AN ARID ENVIRONMENT
Case Study
Editorial
Invited review
Letter to the Editor
Original Article
REVIEW
Review Article
SHORT COMMUNICATION
View/Download PDF

Translate this page into:

Original Article
23 (
1
); 17-21
doi:
10.1016/j.jksus.2010.06.001

Generalizations of rough set concepts

Department of Mathematics, Faculty of Science, Tanta University, Tanta, Egypt
Department of Mathematics, Faculty of Science, Shaqra University, P.O. Box 18, Al-Dawadmi 11911, Saudi Arabia

*Corresponding author at: Department of Mathematics, Faculty of Science, Shaqra University, P.O. Box 18, Al-Dawadmi 11911, Saudi Arabia. Tel.: +966 562180499 asalama2@ksu.edu.sa (A.S. Salama)

Disclaimer:
This article was originally published by Elsevier and was migrated to Scientific Scholar after the change of Publisher.

Available online 16 June 2010

Abstract

In this paper, we generalized the notions of rough set concepts using two topological structures generated by general binary relation defined on the universe of discourse. New types of topological rough sets are initiated and studied using new types of topological sets. Some properties of topological rough approximations are studied by many propositions.

Keywords

Rough sets
Topological spaces
Rough approximations
Rough measures
1

1 Introduction

The theory of rough set, proposed by Pawlak (1982), is an effective tool for data analysis (Greco et al., 2001, 2002; Hu and Cercone, 1995; Kryszkiewicz, 1998, 1999; Pawlak et al., 1994; Pawlak, 1991, 1997, 1998, 2001; Lin and Yao, 1996; Lingras and Yao, 1998; Leung and Li, 2003; Orlowska, 1986; Orlowska and Pawlak, 1987; Skowron and Rauszer, 1992; Skowron, 1993, 1995; Stepaniuk, 1998, 2000; Zhang et al., 2003). It can be used in the attribute-value representation model to describe the dependencies among attributes and evaluate the significance of attributes and derive decision rules. Classical rough set philosophy is based on an assumption that every object in the universe of discourse is associated with some information. Objects characterized by the same information are indiscernible with the available information about them. The indiscernibility relation generated in this way is the mathematical basis for the rough set theory. Classical rough set theory has used successfully in the analysis of data in complete information systems.

The indiscernibility relation is reflexive, symmetric and transitive. The set of all indiscernible objects is called an elementary set or equivalent class. Any set of objects, being a union of some elementary sets, is refereed to as crisp set, otherwise is called rough set. A rough set can be described by a pair of crisp sets, called the lower and upper approximations. By relaxing indiscernibility relation to more general binary relation, classical rough set can be extended to a more general model. Slowinski and Vanderpooten (1997) discussed rough approximation based on the reflexive and transitive binary relation. Skowron and Stepaniuk (1995) and Yao and Wong (1995) discussed generalized approximation space based on the reflexive and symmetry binary relation. Slowinski and Vanderpooten (2000) proposed generalized definition of rough approximation based on reflexive binary relation and compared with other definitions. Lin (1988), Lin and Yao (1996), Yao and Lin (1996), and Yao (1996, 1998) study the approximation operators defined by different neighborhood operators. Skowron and Stepaniuk (1995, 1996) and Stepaniuk (1998, 2000) defined generalized approximation space by using uncertain function and rough inclusion function and described its construction. Also they used the proposed techniques to investigate the problem of object selection.

In practice, tolerance relation (reflective, symmetric) and preference relation (reflective, anti-symmetric, transitive) are important relations. Greco et al. (2001, 2002) proposed rough approximations based on preference relation and applied it to multi-criteria decision analysis; rough approximation based on tolerance relation has been used successfully to compute attribute reducts and derive decision rules in incomplete information systems (Skowron and Rauszer, 1992; Skowron, 1993; Slowinski and Stepaniuk, 1989; Kryszkiewicz, 1998, 1999; Leung and Li, 2003). For example, Kryszkiewicz (1998, 1999) defined tolerance relation in incomplete information systems and proposed the concepts of generalized decision and relative reduct for an object. By using discernibility function and Boolean reasoning techniques, one can obtain the relative reduct of every object and the optimal decision rules supported by the object. Leung and Li (2003) gave a computational approach of relative reduct of each object by using maximal consistent block techniques.

This paper is organized as follows: Section 2 discuss the topological transition to rough generalizations. In Section 3 we initiated five types of rough generalizations using any binary relation and using the topological structure generated by this relation. The properties of the new five types of generalizations and some approximations are studied in Section 4. The conclusion of this work is discussed in Section 5.

2

2 Rough sets topological view

The reference space in rough set theory is the approximation space whose topological structure is generated by the equivalence relation R. This topology has the property that every open set in it is closed. This topology is called quasi-discrete topology and it is a kind of approximations that are transitive.

We will express rough set properties in terms of topological concepts. Let X be a subset of U. Let cl(X); int(X) and b(X) be closure, interior, and boundary points respectively. X is exact if b(X) = U, otherwise X is rough. It is clear X is exact iff cl(X) = int(X). In Pawlak space a subset X ⊆ U has two possibilities rough or exact. For a general topological space, X ⊆ U has the following types of definability:

  • X is totally definable if X is exact set “cl(X) = X = int(X)”,

  • X is internally definable if X = int(X), X ≠ cl(X),

  • X is externally definable if X ≠ int(X), X = cl(X),

  • X is undefinable if X ≠ int(X), X ≠ cl(X).

Original rough membership function is defined using equivalence classes. We will extend it to topological spaces. If τ is a topology on a finite set U, where its base is β, then the rough membership function is μ X τ ( x ) = { β x } X { β x } , β x β , x U , where βx is any member of β containing x. It can be shown that this number is independent of the choice of bases. Since, the intersection of all members of the topology containing X concedes with the intersection of all members of a base containing x.

3

3 Rough topological approximations

In this section we introduce the basic notations to topological lower and topological upper approximations. Here we define two topologies generated by any binary general relation R. The subbase of the first topology τxR (right topology) is the right neighborhood xR. Also, the topology τRx (left topology) is the left neighborhood Rx where, xR = {y ∈ X : xRy} and Rx = {y ∈ X : yRx}.

The topological lower and the topological upper approximations of a subset X of U are defined using the topologies τxR and τRx as follows: R ̲ τ xR ( X ) = { xR : xR X } and R ¯ τ xR ( X ) = { xR : xR X ϕ } , R ̲ τ Rx ( X ) = { Rx : Rx X } and R ¯ τ Rx ( X ) = { Rx : Rx X ϕ } .

Some types of topological rough sets are initiated in the following definition.

Definition 3.1

Let (U, R) be a generalized approximation space. Let τxR and τRx be the two topologies generated using the relation R. Then the subset X ⊆ U is called:

  1. Semi rough (briefly S12-rough) if X R ¯ τ Rx ( R ̲ τ xR ( X ) ) .

  2. Pre rough (briefly P12-rough) if X R ¯ τ xR ( R ̲ τ Rx ( A ) ) .

  3. Semi-pre rough (briefly β12-rough) if X R ¯ τ Rx ( R ̲ τ xR ( R ¯ τ Rx ( X ) ) ) .

  4. α-Rough (briefly α12-rough) if X R ̲ τ xR ( R ¯ τ Rx ( R ̲ τ xR ( X ) ) ) .

  5. γ-Rough (briefly γ12-rough) if X R ¯ τ Rx ( R ̲ τ xR ( X ) ) R ̲ τ xR ( R ¯ τ Rx ( X ) ) .

The family of all S12-rough (resp. P12-rough, β12-rough, α12-rough and γ12-rough) sets in (U, R) is denoted by FS12(U) (resp. FP12(U), 12(U), 12(U) and 12(U)).

The complement of S12-rough (resp. P12-rough, β12-rough, α12-rough and γ12-rough) set is called S 12 c -rough (resp. P 12 c -rough, β 12 c -rough, α 12 c -rough and γ 12 c -rough).

The family of all S 12 c -rough (resp. P 12 c -rough, β 12 c -rough, α 12 c -rough and γ 12 c -rough) sets of (U, R) is denoted by FS 12 c ( U ) (resp. FP 12 c ( U ) , F β 12 c ( U ) , F α 12 c ( U ) and F γ 12 c ( U ) ) .

Proposition 3.1

In the generalized approximation space (U,R), we can prove that:

  1. 12(U) < FS12(U) < 12(U) < 12(U).

  2. 12(U) < FP12(U) < 12(U) < 12(U).

Proof

Obvious. □

The following example illustrates the above definition.

Example 3.1

Let R be any binary relation defined on a nonempty set U = {a, b, c, d} defined by R = {(a, a), (a, c), (a, d), (b, b), (b, d), (c, a), (c, b), (c, d), (d, a)}. Hence the subbase of τxR is {{a, c, d}, {b, d}, {a, b, d}, {a}} and the subbase of τRx is {{a, c, d}, {b, c}, {a}, {a, b, c}}. Then τ xR = { U , ϕ , { a , c , d } , { b , d } , { a , b , d } , { a } , { d } , { a , d } } , τ Rx = { U , ϕ , { a , c , d } , { a , c } , { a , b , c } , { a } , { c } , { b , c } } . Consequently, F α 12 ( U ) = FS 12 ( U ) = { U , ϕ , { a , c , d } , { b , d } , { a , b , d } , { a } , { d } , { a , d } } , F γ 12 ( U ) = F β 12 ( U ) = P rl O ( U ) = { U , ϕ , { a } , { d } , { a , b } , { a , d } , { a , c } , { a , b , c } , { b , d } , { a , b , d } , { a , c , d } } .

Definition 3.2

Let (U, R) be a generalized approximation space and X ⊆ U. Then the general lower (briefly λ12 lower) of X denoted by λ12(X) for all λ12 ∈ {S12, P12, β12, α12, γ12} is defined by: λ12(X) = ∪ {G ∈ 12(U), G ⊆ X}.

Definition 3.3

Let (U, R) be a generalized approximation space and X ⊆ U. Then the general upper of X denoted by λ ¯ 12 ( X ) for all λ12 ∈ {S12, P12, β12, α12, γ12} is defined by λ ¯ 12 ( X ) = { H F λ 12 c ( U ) , H X } .

Definition 3.4

Let (U, R) be a generalized approximation space. Then for all λ12 ∈ {S12, P12, β12, α12, γ12} the topological general lower and topological general upper approximations of any subset X ⊆ U are defined as: R ̲ λ 12 ( X ) = λ ̲ 12 ( X ) ; R ¯ λ 12 ( X ) = λ ¯ 12 ( X ) .

Proposition 3.2

Let (U,R) be a generalized approximation space generated by any binary relation R. Then for any subset X ⊆ U:

  1. R ̲ τ xR ( X ) R ̲ α 12 ( X ) R ̲ S 12 ( X ) R ̲ γ 12 ( X ) R ̲ β 12 ( X ) X R ¯ β 12 ( X ) R ¯ γ 12 ( X ) R ¯ S 12 ( X ) R ¯ α 12 ( X ) R ¯ τ xR ( X ) .

  2. R ̲ τ Rx ( X ) R ̲ α 12 ( X ) R ̲ P 12 ( X ) R ̲ γ 12 ( X ) R ̲ β 12 ( X ) X R ¯ β 12 ( X ) R ¯ γ 12 ( X ) R ¯ P 12 ( X ) R ¯ α 12 ( X ) R ¯ τ Rx ( X ) .

Proof

( i ) R ̲ τ xR ( X ) = { G τ xR : G X } { G F α 12 ( U ) : G X } { G FS 12 ( U ) : G X } { G F γ 12 ( U ) : G X } { G F β 12 ( U ) : G X } X { H F β 12 c ( U ) : X H } { H F γ 12 c ( U ) : X H } { H FS 12 c ( U ) : X H } { H F α 12 c ( U ) : X H } { H τ xR c : X H } .

Hence, R ̲ τ xR ( X ) R ̲ α 12 ( X ) R ̲ S 12 ( X ) R ̲ γ 12 ( X ) R ̲ β 12 ( X ) X R ¯ β 12 ( X ) R ¯ γ 12 ( X ) R ¯ S 12 ( X ) R ¯ α 12 ( X ) R ¯ τ xR ( X ) .

(ii) By the same manner as (i). □

Example 3.2

According to Example 3.1, if X = {a, b} and Y = {d}. Then R ̲ α 12 ( X ) = { a } , R ̲ P 12 ( X ) = { a , b } , R ¯ α 12 ( Y ) = { b , c , d } and R ¯ P 12 ( Y ) = { d } . So R ̲ α 12 ( X ) R ̲ P 12 ( X ) and R ¯ P 12 ( Y ) R ¯ α 12 ( Y ) .

Proposition 3.3

Let (U,R) be a generalized approximation space generated by any binary relation R. Then for any two subsets X,Y ⊆ U we have for all λ12 ∈ {S12, P12, β12, α12, γ12}:

  1. R ̲ λ 12 ( ϕ ) = R ¯ λ 12 ( ϕ ) = ϕ and R ̲ λ 12 ( U ) = R ¯ λ 12 ( U ) = U .

  2. If X ⊆ Y, then R ̲ λ 12 ( X ) R ̲ λ 12 ( Y ) .

  3. If X ⊆ Y, then R ¯ λ 12 ( X ) R ¯ λ 12 ( Y ) .

  4. R ̲ λ 12 ( X Y ) R ̲ λ 12 ( X ) R ̲ λ 12 ( Y ) .

  5. R ¯ λ 12 ( X Y ) R ¯ λ 12 ( X ) R ¯ λ 12 ( Y ) .

  6. R ̲ λ 12 ( X Y ) R ̲ λ 12 ( X ) R ̲ λ 12 ( Y ) .

  7. R ¯ λ 12 ( X Y ) R ¯ λ 12 ( X ) R ¯ λ 12 ( Y ) .

  8. R ̲ λ 12 ( X c ) = ( R ¯ λ 12 ( X ) ) c .

  9. R ¯ λ 12 ( X c ) = ( R ̲ λ 12 ( X ) ) c .

Proof

By using the properties of λ12 and λ ¯ 12 for all λ12 ∈ {S12, P12, β12, α12, γ12} the proof is complete. □

The following example, at λ12 = α12 illustrates that the inverse of Property (iv) in the above proposition in general does not hold for all λ12 ∈ {S12, P12, β12, α12, γ12}.

Example 3.3

According to Example 3.1 if X = {a} andY = {c, d}, then R ̲ α 12 ( X ) = { a } , R ̲ α 12 ( Y ) = { d } , and R ̲ α 12 ( X Y ) R ̲ α 12 ( X ) R ̲ α 12 ( Y ) .

The following example shows that the inverse of the Properties (v) and (vi) in Proposition 3.2, in general are not true for all λ12 ∈ {S12, P12, β12, α12, γ12}, we consider λ12 = β12.

Example 3.4

According to Example 3.1, if X1 = {a}, X2 = {d}, Y1 = {a, b} and Y2 = {b, d}, then R ¯ β 12 ( X 1 ) = { a , c } , R ¯ β 12 ( X 2 ) = { d } , R ¯ β 12 ( X 1 X 2 ) = U , R ̲ β 12 ( Y 1 ) = { a , b } , R ̲ β 12 ( Y 2 ) = { b , d } , and R ̲ β 12 ( Y 1 Y 2 ) = ϕ , hence R ¯ β 12 ( X 1 X 2 ) R ¯ β 12 ( X 1 ) R ¯ β 12 ( X 2 ) , and R ̲ β 12 ( Y 1 Y 2 ) R ̲ β 12 ( Y 1 ) R ̲ β 12 ( Y 2 ) .

The following example shows that the Property (vii) in Proposition 3.2, in general are not true for all λ12 ∈ {S12, P12, β12, α12, γ12}, we consider here λ12 = P12.

Example 3.5

According to Example 3.1, if X = {a, c, d} and Y = {b, c, d}. Then R ¯ P 12 ( X ) = U , R ¯ P 12 ( Y ) = { b , c , d } and R ¯ P 12 ( X Y ) = { c , d } , hence R ¯ P 12 ( X Y ) R ¯ P 12 ( X ) R ¯ P 12 ( Y ) .

Proposition 3.4

Let (X,R) be a generalized approximation space defined on any binary relation R. Then for all λ12 ∈ {S12,P12, β12, α12, γ12}, and for any X ⊆ U, the following properties do not hold:

  1. R ̲ λ 12 ( R ̲ λ 12 ( X ) ) = R ¯ λ 12 ( R ̲ λ 12 ( X ) ) = R ̲ λ 12 ( X ) .

  2. R ¯ λ 12 ( R ¯ λ 12 ( X ) ) = R ̲ λ 12 ( R ¯ λ 12 ( X ) ) = R ¯ λ 12 ( X ) .

The following example illustrates the above proposition, using λ12=β12.

Example 3.6

According to Example 3.1, if X = {a} and Y = {c, d}. Then R ̲ β 12 ( X ) = { a } , R ̲ β rl R ̲ β rl ( A ) = { a } , R ¯ β rl R ̲ β rl ( A ) = { a , c } , R ¯ β rl ( B ) = { c , d } , R ¯ β rl R ¯ β rl ( B ) = { c , d } , and R ̲ β 12 ( R ¯ β 12 ( Y ) ) = { d } , hence R ̲ β 12 ( R ̲ β 12 ( X ) ) R ¯ β 12 ( R ̲ β 12 ( X ) ) , and R ¯ β 12 ( R ¯ β 12 ( Y ) ) R ̲ β 12 ( R ¯ β 12 ( Y ) ) .

Lemma 3.1

Let (U,R) be a generalized approximation space, and for any X ⊆ U, then ( Cl λ 12 ( X ) ) c = int λ 12 ( X c ) for all λ12 ∈ {S12, P12, β12, α12, γ12}.

Proof

Let X ⊆ U, then for all λ12 ∈ {S12, P12, β12, α12, γ12}, we get: ( Cl λ 12 ( X ) ) c = U - Cl λ 12 ( X ) = U - { F U : F is λ 12 upper set and X F } = { ( U - F ) U : ( U - F ) is λ 12 lower set, ( U - F ) ( U - X ) = int λ 12 ( U - X ) .

Thus ( Cl λ 12 ( X ) ) c = int λ 12 ( X c ) . □

Proposition 3.5

Let (U,R) be a generalized approximation space defined on any binary relation R for any two subsets X,Y ⊆ U we have: R ̲ λ 12 ( X - Y ) R ̲ λ 12 ( X ) - R ̲ λ 12 ( Y ) , for all λ12 ∈ {S12,P12, β12, α12, γ12}.

Proof

As X − Y = X ∩ Yc, then: R ̲ λ 12 ( X - Y ) = int λ 12 ( X - Y ) = int λ 12 ( X Y c ) int λ 12 ( X ) int λ 12 ( Y c ) .

By Lemma 3.1, we have: R ̲ λ 12 ( X - Y ) int λ 12 ( X ) ( Cl λ 12 ( Y ) ) c = int λ 12 ( X ) - Cl λ 12 ( Y ) int λ 12 ( X ) - int λ 12 ( Y )

Thus R ̲ λ 12 ( X - Y ) R ̲ λ 12 ( X ) - R ̲ λ 12 ( Y ) .

The next example illustrates that the inverse of Proposition 3.5, in general does not hold with respect to λ12 = β12. □

Example 3.7

According to Example 3.1, if X = {a, b} and Y = {a}, then R ̲ β 12 ( Y ) = { a } , R ̲ β 12 ( X ) = { a , b } , and R ̲ β 12 ( X - Y ) = ϕ , thus R ̲ β 12 ( X - Y ) R ̲ β 12 ( X ) - R ̲ β 12 ( Y ) .

4

4 Topological generalizations of rough concepts

In this section we introduce and study some topological generalizations for some concepts of the rough set theory by using the λ12 lower and λ12 upper approximations.

Definition 4.1

Let (U, R) be a generalized approximation space defined on any binary relation R. Then for all λ12 ∈ {S12, P12, β12, α12, γ12} and for any X ⊆ U we define:

  1. X is totally topological λ12-definable (λ12-exact) set if R ̲ λ 12 ( X ) = R ¯ λ 12 ( X ) = X .

  2. X is internally topological λ12-definable set if R ̲ λ 12 ( X ) = X , and R ¯ λ 12 ( X ) X .

  3. X is externally topological λ12-definable set if R ̲ λ 12 ( X ) X , and R ¯ λ 12 ( X ) = X .

  4. X is topologically λ12-indefinable (λ12-rough) set if R ̲ λ 12 ( X ) A , and R ¯ λ 12 ( X ) X .

Example 4.1

According to Example 3.1, for subsets X = {d} and Y = {c, d}, X is topologicallyβ12-exact set, X is topologically internally α12-definable set, Y is topologically S12-rough set, and Y is topologically externally P12-definable set.

Definition 4.2

Let (U, R) be a generalized approximation space defined on any binary relation R. Then we can introduce the generalized accuracy measure for any set X ⊆ U as the following: Acc λ 12 ( X ) = R ̲ λ 12 ( X ) R ¯ λ 12 ( X ) , R ¯ λ 12 ( X ) ϕ , where λ12 ∈ {S12, P12, β12, α12, γ12},and ∣X∣ denoted the cardinality of the set X.

The number Acc λ 12 of the above definition is a measure of the degree of exactness of any subset X ⊆ U. So by this measure we will determine, what is the best of our definitions for the λ12 lower and λ12 upper approximations. We can notice that:

  1. 0 Acc τ xR ( X ) Acc α 12 ( X ) Acc S 12 ( X ) Acc γ 12 ( X ) Acc β 12 ( X ) 1 .

  2. 0 Acc τ xR ( X ) Acc α 12 ( X ) Acc P 12 ( X ) Acc γ 12 ( X ) Acc β 12 ( X ) 1 .

So the best definition here is λ12 = β12.

The next example studies the comparison between β12 and S12.

Example 4.2

According to Example 3.1, we have the following table:

Set X Acc S 12 Acc β 12
{d} 1/3 1
{a, c} 1/2 1
{b, d} 2/3 1
{a, b, c} 1/3 1

By using the definitions of rough concepts at λ12 = β12 we can tends to exactness of many sets. This will lead to accurate results in many data reduction applications using new topological approaches. Next works shall deal with more types of applications in data reductions, data processing, image processing and rule extraction.

Definition 4.3

Let (U, R) be a generalized approximation space defined on any binary relation R. Then for all λ12 ∈ {S12, P12, β12, α12, γ12} and for any X, Y ⊆ U we define:

  1. X λ 12 Y if R ̲ λ 12 ( X ) R ̲ λ 12 ( Y ) .

  2. X ˜ λ 12 Y if R ¯ λ 12 ( X ) R ¯ λ 12 ( Y ) .

    The illustration of the facts of the above definition are given as below example.

Example 4.3

According to Example 3.1, let X1 = {a, c, d}, X2 = {b, c, d}, X3 = {b, d} and X4 = {c, d}, then we have: X 4 p 12 X 3 , X 2 ˜ s 12 X 1 and X 2 ˜ β 12 X 1 .

Definition 4.4

Let (U, R) be a generalized approximation space defined on any binary relation R. For any subset X ⊆ U and any element x ∈ U, for all λ12 ∈ {S12, P12, β12, α12, γ12}, we define:

  1. x λ 12 X if x R ̲ λ 12 ( X ) .

  2. x ˜ λ 12 X if x R ¯ λ 12 ( X ) .

Proposition 4.1

Let (U,R) be a generalized approximation space defined on any binary relation R. For any subset X ⊆ U and any element x ∈ U, for all λ12 ∈ {S12, P12, β12, α12, γ12}, we have:

  1. if x λ 12 X then x ∈ X.

  2. if x ˜ λ 12 X then x ∉ X.

Proof

The proof is direct from definitions. □

The following example shows that the inverse of Proposition 4.1, in general does not hold.

Example 4.4

According to Example 3.1, let X = {a, b, c} and Y = {a, d}, then we have b ∈ X, but b s 12 X and b α 12 X . Also, we have b ∉ Y, but b ˜ s 12 Y , b ˜ α 12 Y , b ˜ p rL D , b ˜ γ 12 Y and b ˜ β 12 Y .

5

5 Conclusions

One of the main contributions of this paper is in the area of topological classifications. Based on topological space, we presented an underlying theory to explain how classifications of rough sets topologically may be performed.

We conclude that the intermingling of topology in the construction of some approximation space concepts will help to get results with abundant logical statements. That is discovering hidden relationships among data and, moreover, probably helps in producing accurate programs (Duntsch et al., 2001; Lipski, 1981).

References

  1. , , , . Relational attribute systems. International Journal of Human–Computer Studies. 2001;55:293-309.
    [Google Scholar]
  2. , , , . Rough sets theory for multicriteria decision analysis. European Journal of Operational Research. 2001;129:1-47.
    [Google Scholar]
  3. , , , . Rough approximation by dominance relation. International Journal of Intelligent Systems. 2002;17:153-171.
    [Google Scholar]
  4. , , . Learning in relational databases: a rough set approach. Computational Intelligence. 1995;11(2):323-337.
    [Google Scholar]
  5. , . Rough set approach to incomplete information systems. Information Sciences. 1998;112:39-49.
    [Google Scholar]
  6. , . Rules in incomplete information systems. Information Sciences. 1999;113:271-292.
    [Google Scholar]
  7. , . On databases with incomplete information. Journal of the ACM. 1981;26:41-70.
    [Google Scholar]
  8. Lin, T.Y., 1988. Neighborhood systems and relational database. In: Proceedings of CSC’88.
  9. Lin, T.Y., Yao, Y.Y., 1996. Mining soft rules using rough sets and neighborhoods. In: Proceedings of the Symposium on Modelling, Analysis and Simulation, Computational Engineering in Systems Applications (CESA’96), IMASCS Multiconference, Lille, France, July 9–12, pp. 1095–1100.
  10. , , . Data mining using extension of rough set model. Journal of American Society of Information Science. 1998;49(5):415-422.
    [Google Scholar]
  11. , , . Maximal consistent block technique for rule acquisition in incomplete information systems. Information Sciences. 2003;153:85-106.
    [Google Scholar]
  12. , . Semantics analysis of inductive reasoning. Theoretical Computer Science. 1986;43:81-89.
    [Google Scholar]
  13. , , . Representation of nondeterministic information. Theoretical Computer Science. 1987;29:27-39.
    [Google Scholar]
  14. , . Rough sets. International Journal of Computer and Information Sciences. 1982;11:341-356.
    [Google Scholar]
  15. , . Rough Sets: Theoretical Aspects of Reasoning about Data. London: Kluwer Academic Publishers; .
  16. , , . Rough set approach to multi-attribute decision analysis, Invited Review. European Journal of Operational Research. 1994;72:443-459.
    [Google Scholar]
  17. , . Rough set approach to knowledge-based decision support. European Journal of Operational Research. 1997;99:48-57.
    [Google Scholar]
  18. , . Rough set theory and its applications in data analysis. International Journal of Cybernetics Systems. 1998;29:661-685.
    [Google Scholar]
  19. , . Drawing conclusions from data—the rough set way. International Journal of Intelligent Systems. 2001;16:3-11.
    [Google Scholar]
  20. , , . The discernibility matrices and functions in information systems. In: , ed. Intelligent Decision Support: Handbook of Applications and Advances of Rough Sets Theory. Dordrecht: Kluwer Academic Publisher; . p. :331-362.
    [Google Scholar]
  21. , . Boolean reasoning for decision rules generation. In: , , eds. Proceedings of the 7th International Symposium ISMIS’93, Trondheim, Norway, 1993. In: , , eds. Lecture Notes in Artificial Intelligence. Vol vol. 689. Berlin: Springer; . p. :295-305.
    [Google Scholar]
  22. , . Extracting laws from decision tables: a rough set. Computational Intelligence. 1995;110:371-388.
    [Google Scholar]
  23. Skowron, A., Stepaniuk, J., 1995. Generalized approximation space. In: Lin, T.Y., Wildberger, A.M. (Eds.), Soft Computing, Simulation Councils, San Diego, pp. 18–21.
  24. , , . Tolerance approximation spaces. Fundamenta Informaticae. 1996;27(2–3):245-253.
    [Google Scholar]
  25. , , . Rough classification in incomplete information systems. Mathematical and Computer Modelling. 1989;12(10/11):1347-1357.
    [Google Scholar]
  26. , , . Similarity relation as a basis for rough approximations. In: , ed. Advances in Machine Intelligence and Soft-Computing. NC, USA: Department of Electrical Engineering, Duke University Durham; . p. :17-33.
    [Google Scholar]
  27. , , . A generalized definition of rough approximations based on similarity. IEEE Transactions on Knowledge and Data Engineering. 2000;12(2):331-336.
    [Google Scholar]
  28. , . Approximation spaces, reducts and representatives. In: , , eds. Rough Sets in Knowledge Discovery 2. Applications, Case Studies and Software Systems. Heidelberg: Physica-Verlag; . p. :109-126.
    [Google Scholar]
  29. , . Knowledge discovery by application of rough set methods. In: , , , eds. Rough Set Methods and Applications. Heidelberg: Physica-Verlag; . p. :213-234.
    [Google Scholar]
  30. Yao, Y.Y., Wong, S.K.M., 1995. Generalization of rough sets using relationships between attribute values. In: Proceedings of the 2nd Annual Joint Conference on Information Sciences, pp. 30–33.
  31. , , . Generalization of rough sets using modal logic. Intelligent Automation and Soft Computing. 1996;2:103-120.
    [Google Scholar]
  32. , . Two views of the theory of rough sets in finite universes. International Journal of Approximate Reasoning. 1996;15:291-317.
    [Google Scholar]
  33. , . Relational interpretation of neighborhood operators and rough set approximation operator. Information Sciences. 1998;111:239-259.
    [Google Scholar]
  34. , , , . Approaches to knowledge reducts in inconsistent systems. International Journal of Intelligent Systems. 2003;18:989-1000.
    [Google Scholar]
Show Sections