Fuzzy-rough set and fuzzy ID3 decision approaches to knowledge discovery in datasets

Fuzzy rough sets are the generalization of traditional rough sets to deal with both fuzziness and vagueness in data. The existing researches on fuzzy rough sets mainly concentrate on the construction of approximation operators. Less effort has been put on the knowledge discovery in datasets with fuzzy rough sets. This paper mainly focuses on knowledge discovery in datasets with fuzzy rough sets. After analyzing the previous works on knowledge discovery with fuzzy rough sets, we introduce formal concepts of attribute reduction with fuzzy rough sets and completely study the structure of attribute reduction

Study on Rough Sets and Fuzzy Sets in Constructing Intelligent Information System

Since human being is not an omniscient and omnipotent being, we are actually living in an uncertain world. Uncertainty was involved and connected to every aspect of human life as a quotation from Albert Einstein said: �As far as the laws of mathematics refer to reality, they are not certain. And as far as they are certain, they do not refer to reality.� The most fundamental aspect of this connection is obviously shown in human communication. Naturally, human communication is built on the perception1-based information instead of measurement-based information in which perceptions play a central role in human cognition [Zadeh, 2000]. For example, it is naturally said in our communication that �My house is far from here.� rather than let say �My house is 12,355 m from here�. Perception-based information is a generalization of measurement-based information, where perception-based information such as �John is excellent.� is hard to represent by measurement-based version. Perceptions express human subjective view. Consequently, they tend to lead up to misunderstanding. Measurements then are needed such as defining units of length, time, etc., to provide objectivity as a means to overcome misunderstanding. Many measurers were invented along with their methods and theories of measurement. Hence, human cannot communicate with measurers including computer as a product of measurement era unless he uses measurement-based information. Perceptions are intrinsic aspect in uncertainty-based information. In this case, information may be incomplete, imprecise, fragmentary, not fully reliable, vague, contradictory, or deficient in some other way. 1In psychology, perception is understood as a process of translating sensory stimulation into an organized experience Generally, these various information deficiencies may express different types of uncertainty. It is necessary to construct a computer-based information system called intelligent information system that can process uncertainty-based information. In the future, computers are expected to be able to make communication with human in the level of perception. Many theories were proposed to express and process the types of uncertainty such as probability, possibility, fuzzy sets, rough sets, chaos theory and so on. This book extends and generalizes existing theory of rough set, fuzzy sets and granular computing for the purpose of constructing intelligent information system. The structure of this book is the following: In Chapter 2, types of uncertainty in the relation to fuzziness, probability and evidence theory (belief and plausibility measures) are briefly discussed. Rough set regarded as another generalization of crisp set is considered to represent rough event in the connection to the probability theory. Special attention will be given to formulation of fuzzy conditional probability relation generated by property of conditional probability of fuzzy event. Fuzzy conditional probability relation then is used to represent similarity degree of two fuzzy labels. Generalization of rough set induced by fuzzy conditional probability relation in terms of covering of the universe is given in Chapter 3. In the relation to fuzzy conditional probability relation, it is necessary to consider an interesting mathematical relation called weak fuzzy similarity relation as a generalization of fuzzy similarity relation proposed by Zadeh [1995]. Fuzzy rough set and generalized fuzzy rough set are proposed along with the generalization of rough membership function. Their properties are examined. Some applications of these methods in information system such as α-redundancy of object and dependency of domain attributes are discussed. In addition, multi rough sets based on multi-context of attributes in the presence of multi-contexts information system is defined and proposed in Chapter 4. In the real application, depending on the context, a given object may have different values of attributes. In other words, set of attributes might be represented based on different context, where they may provide different values for a given object. Context can be viewed as background or situation in which somehow it is necessary to group some attributes as a subset of attributes and consider the subset as a context. Finally, Chapter 5 summarizes all discussed in this book and puts forward some future topics of research

Faculty of Sciences

A comprehensive study of fuzzy rough sets and their application in data reductio

Interval-based uncertain reasoning

This thesis examines three interval based uncertain reasoning approaches: reasoning under interval constraints, reasoning using necessity and possibility functions, and reasoning with rough set theory. In all these approaches, intervals are used to characterize the uncertainty involved in a reasoning process when the available information is insufficient for single-valued truth evaluation functions. Approaches using interval constraints can be applied to both interval fuzzy sets and interval probabilities. The notion of interval triangular norms, or interval t-norms for short, is introduced and studied in both numeric and non-numeric settings. Algorithms for computing interval t-norms are proposed. Basic issues on the use of t-norms for approximate reasoning with interval fuzzy sets are studied. Inference rules for reasoning under interval constraints are investigated. In the second approach, a pair of necessity and possibility functions is used to bound the fuzzy truth values of propositions. Inference in this case is to narrow the gap between the pair of the functions. Inference rules are derived from the properties of necessity and possibility functions. The theory of rough sets is used to approximate truth values of propositions and to explore modal structures in many-valued logic. It offers an uncertain reasoning method complementary to the other two

Fuzzy Supernova Templates I: Classification

Modern supernova (SN) surveys are now uncovering stellar explosions at rates that far surpass what the world's spectroscopic resources can handle. In order to make full use of these SN datasets, it is necessary to use analysis methods that depend only on the survey photometry. This paper presents two methods for utilizing a set of SN light curve templates to classify SN objects. In the first case we present an updated version of the Bayesian Adaptive Template Matching program (BATM). To address some shortcomings of that strictly Bayesian approach, we introduce a method for Supernova Ontology with Fuzzy Templates (SOFT), which utilizes Fuzzy Set Theory for the definition and combination of SN light curve models. For well-sampled light curves with a modest signal to noise ratio (S/N>10), the SOFT method can correctly separate thermonuclear (Type Ia) SNe from core collapse SNe with 98% accuracy. In addition, the SOFT method has the potential to classify supernovae into sub-types, providing photometric identification of very rare or peculiar explosions. The accuracy and precision of the SOFT method is verified using Monte Carlo simulations as well as real SN light curves from the Sloan Digital Sky Survey and the SuperNova Legacy Survey. In a subsequent paper the SOFT method is extended to address the problem of parameter estimation, providing estimates of redshift, distance, and host galaxy extinction without any spectroscopy.Comment: 26 pages, 12 figures. Accepted to Ap

Two-sorted Modal Logic for Formal and Rough Concepts

In this paper, we propose two-sorted modal logics for the representation and reasoning of concepts arising from rough set theory (RST) and formal concept analysis (FCA). These logics are interpreted in two-sorted bidirectional frames, which are essentially formal contexts with converse relations. On one hand, the logic $\textbf{KB}$ contains ordinary necessity and possibility modalities and can represent rough set-based concepts. On the other hand, the logic $\textbf{KF}$ has window modality that can represent formal concepts. We study the relationship between \textbf{KB} and \textbf{KF} by proving a correspondence theorem. It is then shown that, using the formulae with modal operators in \textbf{KB} and \textbf{KF}, we can capture formal concepts based on RST and FCA and their lattice structures

A non-distributive logic for semiconcepts of a context and its modal extension with semantics based on Kripke contexts

A non-distributive two-sorted hypersequent calculus \textbf{PDBL} and its modal extension \textbf{MPDBL} are proposed for the classes of pure double Boolean algebras and pure double Boolean algebras with operators respectively. A relational semantics for \textbf{PDBL} is next proposed, where any formula is interpreted as a semiconcept of a context. For \textbf{MPDBL}, the relational semantics is based on Kripke contexts, and a formula is interpreted as a semiconcept of the underlying context. The systems are shown to be sound and complete with respect to the relational semantics. Adding appropriate sequents to \textbf{MPDBL} results in logics with semantics based on reflexive, symmetric or transitive Kripke contexts. One of these systems is a logic for topological pure double Boolean algebras. It is demonstrated that, using \textbf{PDBL}, the basic notions and relations of conceptual knowledge can be expressed and inferences involving negations can be obtained. Further, drawing a connection with rough set theory, lower and upper approximations of semiconcepts of a context are defined. It is then shown that, using the formulae and sequents involving modal operators in \textbf{MPDBL}, these approximation operators and their properties can be captured