QUANTIZATION OF REAL VALUE ATTRIBUTESRough Set and Boolean Reasoning
نویسندگان
چکیده
s. The quantization of real value attributes is one of the main problem to be solved in synthesis of decision rules from data tables with real value attributes. We present an approach to this problem based on rough set methods and Boolean reasoning. The main result states that the problem of optimal quantization of real value attributes is polynomially reducible to the problem of minimal reduct nding, so it is NP-hard. We construct eecient heuristics for nding suboptimal quantization of real value attributes.
منابع مشابه
Disguised Face Recognition by Using Local Phase Quantization and Singular Value Decomposition
Disguised face recognition is a major challenge in the field of face recognition which has been taken less attention. Therefore, in this paper a disguised face recognition algorithm based on Local Phase Quantization (LPQ) method and Singular Value Decomposition (SVD) is presented which deals with two main challenges. The first challenge is when an individual intentionally alters the appearance ...
متن کاملA fuzzy reasoning method based on compensating operation and its application to fuzzy systems
In this paper, we present a new fuzzy reasoning method based on the compensating fuzzy reasoning (CFR). Its basicidea is to obtain a new fuzzy reasoning result by moving and deforming the consequent fuzzy set on the basis of themoving, deformation, and moving-deformation operations between the antecedent fuzzy set and observation information.Experimental results on real-world data sets show tha...
متن کاملThe ring of real-valued functions on a frame
In this paper, we define and study the notion of the real-valued functions on a frame $L$. We show that $F(L) $, consisting of all frame homomorphisms from the power set of $mathbb{R}$ to a frame $ L$, is an $f$-ring, as a generalization of all functions from a set $X$ into $mathbb R$. Also, we show that $F(L) $ is isomorphic to a sub-$f$-ring of $mathcal{R}(L)$, the ring of real-valued continu...
متن کاملON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملOn Considering Constraints of Different Importance in Fuzzy Constraint Satisfaction Problems
Several real-world applications (e.g., scheduling, configuration, ... ) can be formulated as Constraint Satisfaction Problems (CSP). In these cases, a set of variables have to be settled to a value with the requirement that they satisfy a set of constraints. Classical CSPs are defined only by means of crisp (Boolean) constraints. However, as sometimes Boolean constraints are too strict in relat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995