Mass Assignment Based Induction of Decision Trees on Words
نویسندگان
چکیده
A mass assignment based ID3 algorithm for the induction of decision trees on words is described. Such decision trees encode sets of qualified conditional rules on linguistic variables. The potential of this algorithm is illustrated by means of several examples relating to both real world and model classification and prediction problems.
منابع مشابه
Mass Assignment Fuzzy ID3 with Applications
A mass assignment based ID3 algorithm for learning probabilistic fuzzy decision trees is introduced. Fuzzy partitions are used to discretise continuous feature universes and to reduce complexity when universes are discrete but with large cardinalities. Furthermore, the fuzzy partitioning of classification universes facilitates the use of these decision trees in function approximation problems. ...
متن کاملDIAGNOSIS OF BREAST LESIONS USING THE LOCAL CHAN-VESE MODEL, HIERARCHICAL FUZZY PARTITIONING AND FUZZY DECISION TREE INDUCTION
Breast cancer is one of the leading causes of death among women. Mammography remains today the best technology to detect breast cancer, early and efficiently, to distinguish between benign and malignant diseases. Several techniques in image processing and analysis have been developed to address this problem. In this paper, we propose a new solution to the problem of computer aided detection and...
متن کاملAutomatic Accentuation of Words for Slovenian TTS System
The accentuation of unknown Slovene words represents a challenging task for automated solvers since in Slovenian, stress can be located on arbitrary syllables. Most words have only one stressed syllable, but there exist also words with no stress and words with more than one stress. Furthermore, different forms of the same word can be stressed differently. In this paper, we present a two level l...
متن کاملPrediction Trees Using Linguisitc Modelling
Linguistic decision tree (LDT) is a treestructured model based on a framework for linguistic modelling [5]. In previous research [8], an algorithm for learning LDTs was proposed and its performance on some benchmark classification problems were investigated and compared with a number of well known classifiers. In this paper, a methodology for extending LDTs to prediction problems is proposed an...
متن کاملA Tree-structured Classification Model Based on Label Semantics
Label Semantics is a random set based framework for Computing with Words. Imprecise concepts are modeled by the degrees of appropriateness of a linguistic expression as defined by a fuzzy set. An approach to decision tree induction based on this framework is studied and its performance when applied to realworld datasets is compared with the C4.5 and other machine learning algorithms. A method o...
متن کامل