Active Sample Selection Based Incremental Algorithm for Attribute Reduction with Rough Sets

Attribute reduction with rough sets is an effective technique for obtaining a compact and informative attribute set from a given dataset. However, traditional algorithms have no explicit provision for handling dynamic datasets where data present themselves in successive samples. Incremental algorithms for attribute reduction with rough sets have been recently introduced to handle dynamic datasets with large samples, though they have high complexity in time and space. To address the time/space complexity issue of the algorithms, this paper presents a novel incremental algorithm for attribute reduction with rough sets based on the adoption of an active sample selection process and an insight into the attribute reduction process. This algorithm first decides whether each incoming sample is useful with respect to the current dataset by the active sample selection process. A useless sample is discarded while a useful sample is selected to update a reduct. At the arrival of a useful sample, the attribute reduction process is then employed to guide how to add and/or delete attributes in the current reduct. The two processes thus constitute the theoretical framework of our algorithm. The proposed algorithm is finally experimentally shown to be efficient in time and space

Measures for unsupervised fuzzy-rough feature selection

For supervised learning, feature selection algorithms at-tempt to maximise a given function of predictive accuracy. This function usually considers the ability of feature vectors to reflect decision class labels. It is therefore intuitive to re-tain only those features that are related to or lead to these decision classes. However, in unsupervised learning, deci-sion class labels are not provided, which poses questions such as; which features should be retained? and, why not use all of the information? The problem is that not all fea-tures are important. Some of the features may be redundant, and others may be irrelevant and noisy. In this paper, some new fuzzy-rough set-based approaches to unsupervised fea-ture selection are proposed. These approaches require no thresholding or domain information, can operate on real-valued data, and result in a significant reduction in dimen-sionality whilst retaining the semantics of the data. 1

Fuzzy-rough set models and fuzzy-rough data reduction

Rough set theory is a powerful tool to analysis the information systems. Fuzzy rough set is introduced as a fuzzy generalization of rough sets. This paper reviewed the most important contributions to the rough set theory, fuzzy rough set theory and their applications. In many real world situations, some of the attribute values for an object may be in the set-valued form. In this paper, to handle this problem, we present a more general approach to the fuzzification of rough sets. Specially, we define a broad family of fuzzy rough sets. This paper presents a new development for the rough set theory by incorporating the classical rough set theory and the interval-valued fuzzy sets. The proposed methods are illustrated by an numerical example on the real case

Approximate Accuracy Approaches to Attribute Reduction for Information Systems

The key problem for attribute reduction to information systems is how to evaluate the importance of an attribute. The algorithms are challenged by the variety of data forms in information system. Based on rough sets theory we present a new approach to attribute reduction for incomplete information systems and fuzzy valued information systems. In order to evaluate the importance of an attribute effectively, a novel algorithm with rigorous theorem is proposed. Experiments show the effect of proposed algorithm

Parameter Selection and Uncertainty Measurement for Variable Precision Probabilistic Rough Set

In this paper, we consider the problem of parameter selection and uncertainty measurement for a variable precision probabilistic rough set. Firstly, within the framework of the variable precision probabilistic rough set model, the relative discernibility of a variable precision rough set in probabilistic approximation space is discussed, and the conditions that make precision parameters α discernible in a variable precision probabilistic rough set are put forward. Concurrently, we consider the lack of predictability of precision parameters in a variable precision probabilistic rough set, and we propose a systematic threshold selection method based on relative discernibility of sets, using the concept of relative discernibility in probabilistic approximation space. Furthermore, a numerical example is applied to test the validity of the proposed method in this paper. Secondly, we discuss the problem of uncertainty measurement for the variable precision probabilistic rough set. The concept of classical fuzzy entropy is introduced into probabilistic approximation space, and the uncertain information that comes from approximation space and the approximated objects is fully considered. Then, an axiomatic approach is established for uncertainty measurement in a variable precision probabilistic rough set, and several related interesting properties are also discussed. Thirdly, we study the attribute reduction for the variable precision probabilistic rough set. The definition of reduction and its characteristic theorems are given for the variable precision probabilistic rough set. The main contribution of this paper is twofold. One is to propose a method of parameter selection for a variable precision probabilistic rough set. Another is to present a new approach to measurement uncertainty and the method of attribute reduction for a variable precision probabilistic rough set

δ-information reducts and bireducts

Attribute reduction is an important step in order to decrease the computational complexity to derive information from databases. In this paper, we extend the notions of reducts and bireducts introduced in rough set theory for attribute reduction purposes and let them work with similarity relations defined on attribute values. Hence, the related mathematical concepts will be introduced and the characterizations of the new reducts and bireducts will be given in terms of the corresponding generalizations of the discernibility function.La reducción en atributos es un paso importante para disminuir la complejidad computacional para obtener información de una base de datos. En este trabajo, extendemos la noción de reductos y birredcutos introducidos en Teoría de Conjuntos Rugosos para reducción de atributos y trabajamos con relaciones de similaridad definidas en los valores de los atributos. Luego, los conceptos matemáticos relacionados se introducirán junto con las caracterizaciones de los nuevos reductos y birreductos en términos de la función de discernibilidad