Toward a Generalization of Rough Sets Based on Active and Passive Relations | Zendy

M. Emoto | Zendy; Rolly Intan | Zendy; Masao Mukaidono | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Toward a Generalization of Rough Sets Based on Active and Passive Relations

Author(s) -

M. Emoto,

Rolly Intan,

Masao Mukaidono

Publication year - 2006

Publication title -

journal of advanced computational intelligence and intelligent informatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.172

H-Index - 20

eISSN - 1343-0130

pISSN - 1883-8014

DOI - 10.20965/jaciii.2006.p0939

Subject(s) - generalization , relation (database) , equivalence relation , binary relation , conditional probability , rough set , computer science , equivalence (formal languages) , mathematics , theoretical computer science , discrete mathematics , artificial intelligence , data mining , statistics , mathematical analysis

In the generalization of rough sets, many concepts use a relation weaker than the equivalence relation usually used in classical rough sets, e.g., induced by a conditional probability relation. The conditional probability relation is binary and assumes that the relationship between two data (elements or objects) resembles a relationship between two events in conditional probability. We use the asymmetric property of the conditional probability relation to propose active and passive relations, then discuss a generalization and properties of rough sets based on active and passive relations.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research