3,754 research outputs found

    Intertemporal Choice of Fuzzy Soft Sets

    Get PDF
    This paper first merges two noteworthy aspects of choice. On the one hand, soft sets and fuzzy soft sets are popular models that have been largely applied to decision making problems, such as real estate valuation, medical diagnosis (glaucoma, prostate cancer, etc.), data mining, or international trade. They provide crisp or fuzzy parameterized descriptions of the universe of alternatives. On the other hand, in many decisions, costs and benefits occur at different points in time. This brings about intertemporal choices, which may involve an indefinitely large number of periods. However, the literature does not provide a model, let alone a solution, to the intertemporal problem when the alternatives are described by (fuzzy) parameterizations. In this paper, we propose a novel soft set inspired model that applies to the intertemporal framework, hence it fills an important gap in the development of fuzzy soft set theory. An algorithm allows the selection of the optimal option in intertemporal choice problems with an infinite time horizon. We illustrate its application with a numerical example involving alternative portfolios of projects that a public administration may undertake. This allows us to establish a pioneering intertemporal model of choice in the framework of extended fuzzy set theorie

    A semantical and computational approach to covering-based rough sets

    Get PDF

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

    Get PDF
    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

    Spatial refinement as collection order relations

    Get PDF
    An abstract examination of refinement (and conversely, coarsening) with respect to the involved spatial relations gives rise to formulated order relations between spatial coverings, which are defined as complete-coverage representations composed of regional granules. Coverings, which generalize partitions by allowing granules to overlap, enhance hierarchical geocomputations in several ways. Refinement between spatial coverings has underlying patterns with respect to inclusion—formalized as binary topological relations—between their granules. The patterns are captured by collection relations of inclusion, which are obtained by constraining relevant topological relations with cardinality properties such as uniqueness and totality. Conjoining relevant collection relations of equality and proper inclusion with the overlappedness (non-overlapped or overlapped) of the refining and the refined covering yields collection order relations, which serve as specific types of refinement between spatial coverings. The examination results in 75 collection order relations including seven types of equality and 34 pairs of strict or non-strict types of refinement and coarsening, out of which 19 pairs form partial collection orders

    Matroidal approaches to rough sets via closure operators

    Get PDF
    AbstractThis paper studies rough sets from the operator-oriented view by matroidal approaches. We firstly investigate some kinds of closure operators and conclude that the Pawlak upper approximation operator is just a topological and matroidal closure operator. Then we characterize the Pawlak upper approximation operator in terms of the closure operator in Pawlak matroids, which are first defined in this paper, and are generalized to fundamental matroids when partitions are generalized to coverings. A new covering-based rough set model is then proposed based on fundamental matroids and properties of this model are studied. Lastly, we refer to the abstract approximation space, whose original definition is modified to get a one-to-one correspondence between closure systems (operators) and concrete models of abstract approximation spaces. We finally examine the relations of four kinds of abstract approximation spaces, which correspond exactly to the relations of closure systems
    • …
    corecore