Using Decision Trees to Analyze Online Learning Data
نویسندگان
چکیده
منابع مشابه
Online active learning of decision trees with evidential data
Learning from uncertain data has been drawing increasing attention in recent years. In this paper, we propose a tree induction approach which can not only handle uncertain data, but also furthermore reduce epistemic uncertainty by querying the most valuable uncertain instances within the learning procedure. We extend classical decision trees to the framework of belief functions to deal with a v...
متن کاملA Reinforcement Learning Approach to Online Learning of Decision Trees
Online decision tree learning algorithms typically examine all features of a new data point to update model parameters. We propose a novel alternative, Reinforcement Learningbased Decision Trees (RLDT), that uses Reinforcement Learning (RL) to actively examine a minimal number of features of a data point to classify it with high accuracy. Furthermore, RLDT optimizes a long term return, providin...
متن کاملUsing Online Learning to Analyze the Opponent's Behavior
Analyzing opponent teams has been established within the simulation league for a number of years. However, most of the analyzing methods are only available off-line. Last year we introduced a new idea which uses a time series-based decision tree induction to generate rules on-line. This paper follows that idea and introduces the approach in detail. We implemented this approach as a library func...
متن کاملUsing Decision Trees to Understand Student Data
We apply and evaluate a decision tree algorithm to university records, producing human-readable graphs that are useful both for predicting graduation, and understanding factors that lead to graduation. We compare this method to that of nueral networks, Support Vector Machines, and Kernel Regression, and show that it is equally powerful as a classificaion tool. At the same time, decision trees p...
متن کاملLearning Invariants using Decision Trees
The problem of inferring an inductive invariant for verifying program safety can be formulated in terms of binary classification. This is a standard problem in machine learning: given a sample of good and bad points, one is asked to find a classifier that generalizes from the sample and separates the two sets. Here, the good points are the reachable states of the program, and the bad points are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Symposium for Innovative Teaching and Learning
سال: 2017
ISSN: 2573-4911
DOI: 10.4148/2573-4911.1005