6,380 research outputs found

    Symbolic Approximate Reasoning Within Unbalanced Multi-sets: Application to Autism Diagnosis

    Get PDF
    International audienceIn most daily activities, humans often use imprecise information derived from appreciation instead of exact measurements to make decisions. Multisets allow the representation of imperfect information in a Knowledge-Based System (KBS), in the multivalued logic context. New facts are deduced using approximate reasoning. In the literature, dealing with imperfect information relies on an implicit assumption: the distribution of terms is uniform on a scale ranging from 0 to 1. Nevertheless, in some cases, a sub-domain of this scale may be more informative and may include more terms. In this work, we focus on approximate reasoning within these sets, known as unbalanced sets, in the context of multi-valued logic. We introduce an approach based on the Generalized Modus Ponens (GMP) model using Generalized Symbolic Modifiers (GSM). The proposed model is implemented in a tool for autism diagnosis by means of unbalanced severity degrees of the Childhood Autism Rating Scale (CARS). We obtain satisfying results on the distinction between autistic and not autistic child compared to psychiatrists diagnosis

    Implementing imperfect information in fuzzy databases

    Get PDF
    Information in real-world applications is often vague, imprecise and uncertain. Ignoring the inherent imperfect nature of real-world will undoubtedly introduce some deformation of human perception of real-world and may eliminate several substantial information, which may be very useful in several data-intensive applications. In database context, several fuzzy database models have been proposed. In these works, fuzziness is introduced at different levels. Common to all these proposals is the support of fuzziness at the attribute level. This paper proposes first a rich set of data types devoted to model the different kinds of imperfect information. The paper then proposes a formal approach to implement these data types. The proposed approach was implemented within a relational object database model but it is generic enough to be incorporated into other database models.ou

    Heuristic algorithm for interpretation of multi-valued attributes in similarity-based fuzzy relational databases

    Get PDF
    AbstractIn this work, we are presenting implementation details and extended scalability tests of the heuristic algorithm, which we had used in the past [1,2] to discover knowledge from multi-valued data entries stored in similarity-based fuzzy relational databases. The multi-valued symbolic descriptors, characterizing individual attributes of database records, are commonly used in similarity-based fuzzy databases to reflect uncertainty about the recorded observation. In this paper, we present an algorithm, which we developed to precisely interpret such non-atomic values and to transfer the fuzzy database tuples to the forms acceptable for many regular (i.e. atomic values based) data mining algorithms
    corecore