32,861 research outputs found
Intuitionistic Fuzzy Soft Rough Set and Its Application in Decision Making
The soft set theory, originally proposed by Molodtsov, can be used as a general mathematical tool for dealing with uncertainty. In this paper, we present concepts of soft rough intuitionistic fuzzy sets and intuitionistic fuzzy soft rough sets, and investigate some properties of soft rough intuitionistic fuzzy sets and intuitionistic fuzzy soft rough sets in detail. Furthermore, classical representations of intuitionistic fuzzy soft rough approximation operators are presented. Finally, we develop an approach to intuitionistic fuzzy soft rough sets based on decision making and a numerical example is provided to illustrate the developed approach
Computing fuzzy rough approximations in large scale information systems
Rough set theory is a popular and powerful machine learning tool. It is especially suitable for dealing with information systems that exhibit inconsistencies, i.e. objects that have the same values for the conditional attributes but a different value for the decision attribute. In line with the emerging granular computing paradigm, rough set theory groups objects together based on the indiscernibility of their attribute values. Fuzzy rough set theory extends rough set theory to data with continuous attributes, and detects degrees of inconsistency in the data. Key to this is turning the indiscernibility relation into a gradual relation, acknowledging that objects can be similar to a certain extent. In very large datasets with millions of objects, computing the gradual indiscernibility relation (or in other words, the soft granules) is very demanding, both in terms of runtime and in terms of memory. It is however required for the computation of the lower and upper approximations of concepts in the fuzzy rough set analysis pipeline. Current non-distributed implementations in R are limited by memory capacity. For example, we found that a state of the art non-distributed implementation in R could not handle 30,000 rows and 10 attributes on a node with 62GB of memory. This is clearly insufficient to scale fuzzy rough set analysis to massive datasets. In this paper we present a parallel and distributed solution based on Message Passing Interface (MPI) to compute fuzzy rough approximations in very large information systems. Our results show that our parallel approach scales with problem size to information systems with millions of objects. To the best of our knowledge, no other parallel and distributed solutions have been proposed so far in the literature for this problem
Recommended from our members
Learning fuzzy inference systems using an adaptive membership function scheme
An adaptive membership function scheme for general additive fuzzy systems is proposed in this paper. The proposed scheme can adapt a proper membership function for any nonlinear input-output mapping, based upon a minimum number of rules and an initial approximate membership function. This parameter adjustment procedure is performed by computing the error between the actual and the desired decision surface. Using the proposed adaptive scheme for fuzzy system, the number of rules can be minimized. Nonlinear function approximation and truck backer-upper control system are employed to demonstrate the viability of the proposed method
Neurocognitive Informatics Manifesto.
Informatics studies all aspects of the structure of natural and artificial information systems. Theoretical and abstract approaches to information have made great advances, but human information processing is still unmatched in many areas, including information management, representation and understanding. Neurocognitive informatics is a new, emerging field that should help to improve the matching of artificial and natural systems, and inspire better computational algorithms to solve problems that are still beyond the reach of machines. In this position paper examples of neurocognitive inspirations and promising directions in this area are given
Class Association Rules Mining based Rough Set Method
This paper investigates the mining of class association rules with rough set
approach. In data mining, an association occurs between two set of elements
when one element set happen together with another. A class association rule set
(CARs) is a subset of association rules with classes specified as their
consequences. We present an efficient algorithm for mining the finest class
rule set inspired form Apriori algorithm, where the support and confidence are
computed based on the elementary set of lower approximation included in the
property of rough set theory. Our proposed approach has been shown very
effective, where the rough set approach for class association discovery is much
simpler than the classic association method.Comment: 10 pages, 2 figure
- …