Data-based identification of fuzzy rule-based classifiers for high-dimensional problems is addressed. A crisp binary decision tree approach is proposed for the selection of the relevant features and effective initial partitioning of the input domain. The decision tree is then transformed into a fuzzy rule-based classifier. Fuzzy classifiers have more flexible decision boundaries than decision t...

The aim of this paper is to point out the difference between static and dynamic approaches to choosing the optimal time for intervention. The paper demonstrates that classical approaches, such as decision trees and influence diagrams, hardly cope with dynamic problems: they cannot simulate all the real-world strategies and consequently can only calculate suboptimal solutions. A dynamic formalis...

Churn prediction is an important task for Customer Relationship Management (CRM) in telecommunication companies. Accurate churn prediction helps CRM in planning effective strategies to retain their valuable customers. However, churn prediction is a complex and challenging task. In this paper, a hybrid churn prediction model is proposed based on combining two approaches; Neighborhood Cleaning Ru...

This article proposes a new acoustic model using decision trees (DTs) as replacements for Gaussian mixture models (GMM) to compute the observation likelihoods for a given hidden Markov model state in a speech recognition system. DTs have a number of advantageous properties, such as that they do not impose restrictions on the number or types of features, and that they automatically perform featu...

Tandem mass spectrometry is a promising new screening technology which permits screening within one analytical run not only for phenylketonuria (PKU) but also for a wide range of other metabolic disorders in newborns. We investigated two symbolic supervised machine learning techniques logistic regression analysis (LRA) and decision trees (DT), where the knowledge is represented in an explicit w...

The Steiner distance dc(S) of a subset S of nodes of a connected graph G is the minimum number of edges in a connected subgraph of G that contains S. We consider the behaviour of the expected value ILk (n) of dT(S) and the probability Pk(n, m) that dT(S) rn lover all subsets S of k nodes of trees T of order n from certain families of trees.