28 research outputs found

    TS-Models from Evidential Clustering

    Get PDF
    We study how to derive a fuzzy rule-based classification model using the theoretical framework of belief functions. For this purpose we use the recently proposed Evidential c-means (ECM) to derive Takagi-Sugeno (TS) models solely from data. ECM allocates, for each object, a mass of belief to any subsets of possible clusters, which allows to gain a deeper insight in the data while being robust with respect to outliers. Some classification examples are discussed, which show the advantages and disadvantages of the proposed algorithm

    Generalised max entropy classifiers

    Get PDF
    In this paper we propose a generalised maximum-entropy classification framework, in which the empirical expectation of the feature functions is bounded by the lower and upper expectations associated with the lower and upper probabilities associated with a belief measure. This generalised setting permits a more cautious appreciation of the information content of a training set. We analytically derive the KarushKuhn-Tucker conditions for the generalised max-entropy classifier in the case in which a Shannon-like entropy is adopted

    Information-based evaluation functions for probabilistic classifiers

    No full text
    International audienc

    Towards a Definition of Evaluation Criteria for Probabilistic Classifiers

    No full text

    Réseaux bayésiens naïfs et arbres de décision

    No full text

    A New Similarity Measure for Possibilistic Uncertain Information

    No full text
    International audienc

    Incremental Induction of Belief Decision Trees in Averaging Approach

    No full text

    Dynamic Reduct from Partially Uncertain Data Using Rough Sets

    No full text

    Contextual discounting of belief functions

    No full text
    International audienc
    corecore