Standard Decision Tree Algorithm Research Articles

Robustan algoritam za učenje pravila za klasifikaciju - studija slučaja dijagnoze greške

Machine learning algorithms are used for building classifier models. The rule-based decision tree classifiers are popular ones. However, the performance of the decision tree classifier varies with hyperparameter tuning. The optimum hyperparameter values are obtained using either optimization algorithms or trial and error methods. The present study utilizes the MODLEM algorithm to overcome the drawbacks accounted for by decision tree algorithms. Eliminating hyperparameter tuning and producing results closer to standard decision tree algorithms makes MODLEM a robust classification algorithm. The robustness of the MODLEM algorithm is illustrated with the fault diagnosis case study. The case study is faults diagnosis of an automobile suspension system using vibration signals acquired at various fault conditions.

Heart Disease Classification for Early Diagnosis based on Adaptive Hoeffding Tree Algorithm in IoMT Data

Heart disease is a rapidly increasing disease that causes death worldwide. Therefore, scientists around the globe start studying this issue from a different perspective to assure early prediction of diagnosis to save patients' life from bad consequences that cause death. In this regard, Internet of Medical Things (IoMT) applications and algorithms should be utilized effectively to overcome this problem. Hoeffding Tree Algorithm (HTA) is a standard decision tree algorithm to handle large sizes of data sets. In this paper, an Adaptive Hoeffding Tree (AHT) algorithm is suggested to carry out classifications of data sets for early diagnosis of heart disease-related factors, and the obtained results by this algorithm are compared with other suggested Machine Learning (ML) algorithms in the literature. Therefore, a total of 3000 records of data sets are used in the classification, 33% of the data are utilized for female patient information, and the rest of the data are utilized for male patient information. In the original data set, each patient record includes 76 attributes, however only the most important 16 patient attributes are used for the classification. Data are retrieved from the University of California Irvine (UCI) Machine Learning Repository, which is collected from the Hungarian Institute of Cardiology, University Hospital at Zurich, University Hospital at Basel, and V.A. Medical Center. The obtained results from this study and the provided comparative results show the effectiveness of the AHT algorithm over other ML algorithms. Compared to other ML algorithms, AHT outperforms other algorithms with 95.67% accuracy for early estimation of diagnosis of heart disease.

Decision tree classifiers for evidential attribute values and class labels

Decision trees are well-known machine learning techniques for solving complex classification problems. Despite their great success, the standard decision tree algorithms do not have the ability to process imperfect knowledge, meaning uncertain, imprecise and incomplete data. In this paper, we develop new decision tree approaches to cope with data that have uncertain attribute values and class labels. More concretely, we tackle the case where the uncertainty is represented and managed through the evidence theory.

Decision trees for mining data streams

In this paper we study the problem of constructing accurate decision tree models from data streams. Data streams are incremental tasks that require incremental, online, and any-time learning algorithms. One of the most successful algorithms for mining data streams is VFDT. We have extended VFDT in three directions: the ability to deal with continuous data; the use of more powerful classification techniques at tree leaves, and the ability to detect and react to concept drift. VFDTc system can incorporate and classify new information online, with a single scan of the data, in time constant per example. The most relevant property of our system is the ability to obtain a performance similar to a standard decision tree algorithm even for medium size datasets. This is relevant due to the any-time property. We also extend VFDTc with the ability to deal with concept drift, by continuously monitoring differences between two class-distribution of the examples: the distribution when a node was built and the distribution in a time window of the most recent examples. We study the sensitivity of VFDTc with respect to drift, noise, the order of examples, and the initial parameters in different problems and demonstrate its utility in large and medium data sets.

ANN-DT: an algorithm for extraction of decision trees from artificial neural networks

Although artificial neural networks can represent a variety of complex systems with a high degree of accuracy, these connectionist models are difficult to interpret. This significantly limits the applicability of neural networks in practice, especially where a premium is placed on the comprehensibility or reliability of systems. A novel artificial neural-network decision tree algorithm (ANN-DT) is therefore proposed, which extracts binary decision trees from a trained neural network. The ANN-DT algorithm uses the neural network to generate outputs for samples interpolated from the training data set. In contrast to existing techniques, ANN-DT can extract rules from feedforward neural networks with continuous outputs. These rules are extracted from the neural network without making assumptions about the internal structure of the neural network or the features of the data. A novel attribute selection criterion based on a significance analysis of the variables on the neural-network output is examined. It is shown to have significant benefits in certain cases when compared with the standard criteria of minimum weighted variance over the branches. In three case studies the ANN-DT algorithm compared favorably with CART, a standard decision tree algorithm.

Boolean feature discovery in empirical learning

We investigate the problem of learning Boolean functions with a short DNF representation using decision trees as a concept description language. Unfortunately, Boolean concepts with a short description may not have a small decision tree representation when the tests at the nodes are limited to the primitive attributes. This representational shortcoming may be overcome by using Boolean features at the decision nodes. We present two new methods that adaptively introduce relevant features while learning a decision tree from examples. We show empirically that these methods outperform a standard decision tree algorithm for learning small random DNF functions when the examples are drawn at random from the uniform distribution.

Boolean Feature Discovery in Empirical Learning

We investigate the problem of learning Boolean functions with a short DNF representation using decision trees as a concept description language. Unfortunately, Boolean concepts with a short description may not have a small decision tree representation when the tests at the nodes are limited to the primitive attributes. This representational shortcoming may be overcome by using Boolean features at the decision nodes. We present two new methods that adaptively introduce relevant features while learning a decision tree from examples. We show empirically that these methods outperform a standard decision tree algorithm for learning small random DNF functions when the examples are drawn at random from the uniform distribution.