A complete fuzzy decision tree technique

Traditional decision tree classifiers work with data whose values are known and precise. We extend such classifiers to handle data with uncertain information. Value uncertainty arises in many applications during the data collection process. Example sources of uncertainty include measurement/quantization errors, data staleness, and multiple repeated measurements. With uncertainty, the value of a data item is often represented not by one single value, but by multiple values forming a probability distribution. Rather than abstracting uncertain data by statistical derivatives (such as mean and median), we discover that the accuracy of a decision tree classifier can be much improved if the "complete information" of a data item (taking into account the probability density function (pdf)) is utilized. We extend classical decision tree building algorithms to handle data tuples with uncertain values. Extensive experiments have been conducted which show that the resulting classifiers are more accurate than those using value averages. Since processing pdfs is computationally more costly than processing single values (e.g., averages), decision tree construction on uncertain data is more CPU demanding than that for certain data. To tackle this problem, we propose a series of pruning techniques that can greatly improve construction efficiency.

/pdf/decision-trees-for-uncertain-data-qedg4mpf9d.pdf

Decision Trees for Uncertain Data

Induction of multiple fuzzy decision trees based on rough set technique

Traditional decision tree classifiers work with data whose values are known and precise. We extend such classifiers to handle data with uncertain information, which originates from measurement/quantisation errors, data staleness, multiple repeated measurements, etc. The value uncertainty is represented by multiple values forming a probability distribution function (pdf). We discover that the accuracy of a decision tree classifier can be much improved if the whole pdf, rather than a simple statistic, is taken into account. We extend classical decision tree building algorithms to handle data tuples with uncertain values. Since processing pdf's is computationally more costly, we propose a series of pruning techniques that can greatly improve the efficiency of the construction of decision trees.

/pdf/decision-trees-for-uncertain-data-3z1k47r3bq.pdf

Belief decision trees: Theoretical foundations

A popular and particularly efficient method for making a decision tree for classification from symbolic data is ID3 algorithm. Revised algorithms for numerical data have been proposed, some of which divide a numerical range into several intervals or fuzzy intervals. Their decision trees, however, are not easy to understand. We propose a new version of ID3 algorithm to generate an understandable fuzzy decision tree using fuzzy sets defined by a user. We apply it to diagnosis for potential transformers by analyzing gas in oil. >

J. Kinoshita

Papers

Fuzzy decision trees by fuzzy ID3 algorithm and its application to diagnosis systems