On characterization of generalized interval-valued fuzzy rough sets on two universes of discourse

This paper proposes a general study of (I,T)-interval-valued fuzzy rough sets on two universes of discourse integrating the rough set theory with the interval-valued fuzzy set theory by constructive and axiomatic approaches. Some primary properties of interval-valued fuzzy logical operators and the construction approaches of interval-valued fuzzy T-similarity relations are first introduced. Determined by an interval-valued fuzzy triangular norm and an interval-valued fuzzy implicator, a pair of lower and upper generalized interval-valued fuzzy rough approximation operators with respect to an arbitrary interval-valued fuzzy relation on two universes of discourse is then defined. Properties of I-lower and T-upper interval-valued fuzzy rough approximation operators are examined based on the properties of interval-valued fuzzy logical operators discussed above. Connections between interval-valued fuzzy relations and interval-valued fuzzy rough approximation operators are also established. Finally, an operator-oriented characterization of interval-valued fuzzy rough sets is proposed, that is, interval-valued fuzzy rough approximation operators are characterized by axioms. Different axiom sets of I-lower and T-upper interval-valued fuzzy set-theoretic operators guarantee the existence of different types of interval-valued fuzzy relations which produce the same operators.     

Generalized rough approximations in

In this paper we will treat a generalization of inner and outer approximations of fuzzy sets, which we will call -inner and -outer approximations respectively ( being any finite set of rational numbers in [0,1]). In particular we will discuss the case of those fuzzy sets which are definable in the logic by means of step functions from the hypercube [0,1]^k and taking value in an arbitrary (finite) subset of . Then, we will show that if a fuzzy set is definable as truth table of a formula of , then both its -inner and -outer approximation are definable as truth table of formulas of . Finally, we will introduce a generalization of abstract approximation spaces and compare our approach with the notion of fuzzy rough set.     

A note on “Generalized fuzzy rough approximation operators based on fuzzy coverings”

In this note, we show by examples that Theorem 5.3, partial proof of Theorem 5.3′, Lemma 5.4 and Remark 5.2 in [1] contain slight flaws and then provide the correct versions.     

A rough set approach to intuitionistic fuzzy soft set based decision making

The soft set theory, originally proposed by Molodtsov, can be used as a general mathematical tool for dealing with uncertainty. Since its appearance, there has been some progress concerning practical applications of soft set theory, especially the use of soft sets in decision making. The intuitionistic fuzzy soft set is a combination of an intuitionistic fuzzy set and a soft set. The rough set theory is a powerful tool for dealing with uncertainty, granuality and incompleteness of knowledge in information systems. Using rough set theory, this paper proposes a novel approach to intuitionistic fuzzy soft set based decision making problems. Firstly, by employing an intuitionistic fuzzy relation and a threshold value pair, we define a new rough set model and examine some fundamental properties of this rough set model. Then the concepts of approximate precision and rough degree are given and some basic properties are discussed. Furthermore, we investigate the relationship between intuitionistic fuzzy soft sets and intuitionistic fuzzy relations and present a rough set approach to intuitionistic fuzzy soft set based decision making. Finally, an illustrative example is employed to show the validity of this rough set approach in intuitionistic fuzzy soft set based decision making problems.     

Sampling aspects of rough set theory

Rough Set Theory (RST) originated as an approach to approximating a given set, but has found its main applications in the statistical domain of classification problems. It generates classification rules, and can be seen in general terms as a technique for rule induction. Expositions of RST often stress that it is robust in requiring no (explicit) assumptions of a statistical nature. The argument here, however, is that this apparent strength is also a weakness which prevents establishment of general statistical properties and comparison with other methods. A sampling theory is developed for the first time, using both the original RST model and its probabilistic extension, Variable Precision Rough Sets. This is applied in the context of examples, one of which involves Fishers Iris data.Bruce Curry: The author is grateful to two anonymous referees for various helpful suggestions     

Variable-precision dominance-based rough set approach and attribute reduction

In this paper, a variable-precision dominance-based rough set approach (VP-DRSA) is proposed together with several VP-DRSA-based approaches to attribute reduction. The properties of VP-DRSA are shown in comparison to previous dominance-based rough set approaches. An advantage of VP-DRSA over variable-consistency dominance-based rough set approach in decision rule induction is emphasized. Some relations among the VP-DRSA-based attribute reduction approaches are investigated.     

On uniqueness of （fuzzy） relation in some generalized rough set model

In rough set theory, crisp and/or fuzzy binary relations play an important role in both constructive and axiomatic considerations of various generalized rough sets. This paper considers the uniqueness problem of the （fuzzy） relation in some generalized rough set model. Our results show that by using the axiomatic approach, the （fuzzy） relation determined by （fuzzy） approximation operators is unique in some （fuzzy） double-universe model.     

A probability maximization model based on rough approximation and its application to the inventory problem

In the present paper, we concentrate on dealing with a class of multi-objective programming problems with random coefficients and present its application to the multi-item inventory problem. The P-model is proposed to obtain the maximum probability of the objective functions and rough approximation is applied to deal with the feasible set with random parameters. The fuzzy programming technique and genetic algorithm are then applied to solve the crisp programming problem. Finally, the application to Auchan’s inventory system is given in order to show the efficiency of the proposed models and algorithms.     

Heyting algebras with Boolean operators for rough sets and information retrieval applications

This paper presents an algebraic formalism for reasoning on finite increasing sequences over Boolean algebras in general and on generalizations of rough set concepts in particular. We argue that these generalizations are suitable for modeling relevance of documents in an information retrieval system.     

基于模糊集值映射的粗糙近似算子

给出基于模糊集值映射F的模糊集的下(上)近似等概念,研究F-下(上)近似算子aprF(aprF)的性质,探讨求它们的方法,得到若干结果.     

基于k阶二元关系的直觉模糊粗糙集

利用k阶二元关系定义直觉模糊粗糙集,讨论了分别为串行、自反、对称、传递关系时所对应的上、下近似算子的性质。在有限论域U中,研究了任一自反二元关系所诱导的直觉模糊拓扑空间中直觉模糊闭包、内部算子与相对应的上、下近似算子的关系。     

截集形式的模糊粗糙集及其性质

用模糊集的截集构造了模糊集的粗糙集,给出了模糊粗糙集的更加严格的数学定义,证明了与文[1]中的等价性,并用新的定义给出模糊粗糙集的相应性质.     

A comparison of parallel large-scale knowledge acquisition using rough set theory on different MapReduce runtime systems

Nowadays, with the volume of data growing at an unprecedented rate, large-scale data mining and knowledge discovery have become a new challenge. Rough set theory for knowledge acquisition has been successfully applied in data mining. The recently introduced MapReduce technique has received much attention from both scientific community and industry for its applicability in big data analysis. To mine knowledge from big data, we present parallel large-scale rough set based methods for knowledge acquisition using MapReduce in this paper. We implemented them on several representative MapReduce runtime systems: Hadoop, Phoenix and Twister. Performance comparisons on these runtime systems are reported in this paper. The experimental results show that (1) The computational time is mostly minimum on Twister while employing the same cores; (2) Hadoop has the best speedup for larger data sets; (3) Phoenix has the best speedup for smaller data sets. The excellent speedups also demonstrate that the proposed parallel methods can effectively process very large data on different runtime systems. Pitfalls and advantages of these runtime systems are also illustrated through our experiments, which are helpful for users to decide which runtime system should be used in their applications.     

Fuzzy relation equations on a finite set

The family of all the solutions of a fuzzy relation equation on a finite set is considered. It is characterized by the set of all the lower solutions, which can be obtained by a combinatorial algorithm.     

A production-repairing inventory model with fuzzy rough coefficients under inflation and time value of money

In this paper, a production-repairing inventory model in fuzzy rough environment is proposed incorporating inflationary effects where a part of the produced defective units are repaired and sold as fresh units. Here, production and repairing rates are assumed as dynamic control variables. Due to complexity of environment, different costs and coefficients are considered as fuzzy rough type and these are reduced to crisp ones using fuzzy rough expectation. Here production cost is production rate dependent, repairing cost is repairing rate dependent and demand of the item is stock-dependent. Goal of the research work is to find decisions for the decision maker (DM) who likes to maximize the total profit from the above system for a finite time horizon. The model is formulated as an optimal control problem and solved using a gradient based non-linear optimization method. Some particular cases of the general model are derived. The results of the models are illustrated with some numerical examples.     

Gaussian kernel based fuzzy rough sets: Model, uncertainty measures and applications

Kernel methods and rough sets are two general pursuits in the domain of machine learning and intelligent systems. Kernel methods map data into a higher dimensional feature space, where the resulting structure of the classification task is linearly separable; while rough sets granulate the universe with the use of relations and employ the induced knowledge granules to approximate arbitrary concepts existing in the problem at hand. Although it seems there is no connection between these two methodologies, both kernel methods and rough sets explicitly or implicitly dwell on relation matrices to represent the structure of sample information. Based on this observation, we combine these methodologies by incorporating Gaussian kernel with fuzzy rough sets and propose a Gaussian kernel approximation based fuzzy rough set model. Fuzzy T-equivalence relations constitute the fundamentals of most fuzzy rough set models. It is proven that fuzzy relations with Gaussian kernel are reflexive, symmetric and transitive. Gaussian kernels are introduced to acquire fuzzy relations between samples described by fuzzy or numeric attributes in order to carry out fuzzy rough data analysis. Moreover, we discuss information entropy to evaluate the kernel matrix and calculate the uncertainty of the approximation. Several functions are constructed for evaluating the significance of features based on kernel approximation and fuzzy entropy. Algorithms for feature ranking and reduction based on the proposed functions are designed. Results of experimental analysis are included to quantify the effectiveness of the proposed methods.     

Fuzzy set based models and methods of multicriteria group decision making

In the paper, the term consensus scheme is utilized to denote a dynamic and iterative process where the experts involved discuss a multicriteria decision problem. This discussion process is conducted by a human or artificial moderator, with the purpose of minimizing the discrepancy between the individual opinions.During the process of decision making, each expert involved must provide preference information. The information format and the circumstances where it must be given play a critical role in the decision process. This paper analyses a generic consensus scheme, which considers many different preference input formats, several possible interventions of the moderator, as well as admitting several stop conditions for interrupting the discussion process. In addition, a new consensus scheme is proposed with the intention of eliminating some difficulties met when the traditional consensus schemes are utilized in real applications. It preserves the experts’ integrity through the intervention of an external person, to supervise and mediate the conflicting situations. The human moderator is supposed to interfere in the discussion process by adjusting some parameters of the mathematical model or by inviting an expert to update his opinion. The usefulness of this consensus scheme is demonstrated by its use to solve a multicriteria group decision problem, generated applying the Balanced Scorecard methodology for enterprise strategy planning. In the illustrating problem, the experts are allowed to give their preferences in different input formats. But the information provided is made uniform on the basis of fuzzy preference relations through the use of adequate transformation functions, before being analyzed. The advantage of using fuzzy set theory for solving multiperson multicriteria decision problems lies in the fact that it can provide the flexibility needed to adequately deal with the uncertain factors intrinsic to such problems.