0198-9715/$ see front matter 2013 Elsevier Ltd. All rights reserved. http://dx.doi.org/10.1016/j.compenvurbsys.2013.09.005 ⇑ Corresponding author. Address: Tarbiat Modares University, Jalal Ale Ahmad Highway, P.O. Box 14115-111, Tehran, Iran. Tel.: +98 21 82884698; fax: +98 21 82884180. E-mail addresses: [email protected] (J. Karami), [email protected] (A. Alimohammadi), Taseifouri@y...

Fuzzy rough set (FRS) has a great effect on data mining processes and the fuzzy logical operators play key role in development of FRS theory. In order to generalize theory more complicated environments, we firstly propose four types neighborhood based covering by overlap functions their implicators this paper. Meanwhile, derived coverings from an original are defined equalities among function-b...

Rough set theory (RST) is a modern tool for dealing with uncertainty, granularity, and incompleteness of knowledge in information systems. One of the limitations of RST is its dependence on portioning the universe according to equivalence relation on the universe of objects in information systems. The purpose of this paper is to construct connections between generalized rough sets based on cove...

In digital-based information boom, the fuzzy covering rough set model is an important mathematical tool for artificial intelligence, and how to build the bridge between the fuzzy covering rough set theory and Pawlak’s model is becoming a hot research topic. In this paper, we first present the γ−fuzzy covering based probabilistic and grade approximation operators and double-quantitative approxim...

The introduction of covering-based rough sets has made a substantial contribution to the classical rough sets. However, many vital problems in rough sets, including attribution reduction, are NP-hard and therefore the algorithms for solving them are usually greedy. Matroid, as a generalization of linear independence in vector spaces, it has a variety of applications in many fields such as algor...

Traditional rough set theory is mainly used to extract rules from and reduce attributes in databases in which attributes are characterized by partitions, while the covering rough set theory, a generalization of traditional rough set theory, does the same yet characterizes attributes by covers. In this paper, we propose a way to reduce the attributes of covering decision systems, which are datab...

Neighborhood based rough sets are important generalizations of the classical rough sets of Pawlak, as neighborhood operators generalize equivalence classes. In this article, we introduce nine neighborhood based operators and we study the partial order relations between twenty-two different neighborhood operators obtained from one covering. Seven neighborhood operators result in new rough set ap...

Covering-based rough sets is an extension of rough sets and it is based on a covering instead of a partition of the universe. Therefore it is more powerful in describing some practical problems than rough sets. However, by extending the rough sets, covering-based rough sets can increase the roughness of each model in recognizing objects. How to obtain better approximations from the models of a ...