The Relationship between Decision Trees and the Scale of Train Data Set

Decision Trees need train samples in the train data set to get classification rules. If the number of train data was too small, the important information might be missed and thus the model could not explain the classification rules of data. While it is not affirmative that large scale of train data set can get well model. This Paper analysis the relationship between decision trees and the train data scale. We use nine decision tree algorithms to experiment the accuracy, complexity and robustness of decision tree algorithms. Some results are demonstrated.

Decision tree classification of land cover from remotely sensed data

Decision tree classification algorithms have significant potential for land cover mapping problems and have not been tested in detail by the remote sensing community relative to more conventional pattern recognition techniques such as maximum likelihood classification. In this paper, we present several types of decision tree classification algorithms arid evaluate them on three different remote sensing data sets. The decision tree classification algorithms tested include an univariate decision tree, a multivariate decision tree, and a hybrid decision tree capable of including several different types of classification algorithms within a single decision tree structure. Classification accuracies produced by each of these decision tree algorithms are compared with both maximum likelihood and linear discriminant function classifiers. Results from this analysis show that the decision tree algorithms consistently outperform the maximum likelihood and linear discriminant function classifiers in regard to classf — cation accuracy. In particular, the hybrid tree consistently produced the highest classification accuracies for the data sets tested. More generally, the results from this work show that decision trees have several advantages for remote sensing applications by virtue of their relatively simple, explicit, and intuitive classification structure. Further, decision tree algorithms are strictly nonparametric and, therefore, make no assumptions regarding the distribution of input data, and are flexible and robust with respect to nonlinear and noisy relations among input features and class labels.

汉语文本语篇语句焦点确定及焦点与重音关系研究

This study investigated the method of the focus identification in Chinese text discourse and the relationship between accent and focus, large corpus analysis and decision tree were used in the research. The main results are: 1. Based on the concept of the Focus and understanding of the discourse, Foci identification is consistent and steady; 2. Special Focus markers and specific Focus constructions have greater influence than special constituent order on identifying Focus in Chinese discourse; while information states also have great influence on focus identifying; part of speech，information state, the relative position in the sentence, focus-sensitive operator, specific Focus constructions, contrast relations, relations between the sentences are important factors to focus identifying; 3. Using multi-dimensional tagging and knowledge discovery, it is a feasible way to construct and employ decision trees by computing tagging results to identify Focus; 4. Focus predicting also depends on literal types and styles of the discourse, several types of decision trees should be constructed for different literal types; 5. In the monologue discourse, the most prominent accent is located on the Focus word or in the scope of the Focus; there are some kinds of rules on accent assignment in broad Focus; it is necessary to analyze and classify focus structure for the research of relations between accent and Focus.

An automata theoretic decision procedure for the propositional mu-calculus

The propositional mu-calculus is a propositional logic of programs which incorporates a least fixpoint operator and subsumes the propositional dynamic logic of Fischer and Ladner, the infinite looping construct of Streett, and the game logic of Parikh. We give an elementary time decision procedure, using a reduction to the emptiness problem for automata on infinite trees. A small model theorem is obtained as a corollary.