Fuzzy Rough Decision Trees
Fuzzy rough sets are widely studied and applied in the domain of machine learning and data mining these years. In this work, this theory is used to design a fuzzy rough decision tree algorithm which can be used to deal with the cognitive uncertainties such as vagueness and ambiguity associated with human thinking and perception. In our algorithm, both selecting nodes and splitting branches in constructing the tree are based on fuzzy rough set theory. Especially, the current branching point is determined by pureness of the two branches, where the pureness is based on fuzzy lower approximation. The comparison results show that our decision tree algorithm is equivalent to or outperforms some popular decision tree algorithms.
KeywordsDecision Tree Decision Tree Algorithm Fuzzy Equivalence Relation Fuzzy Decision Tree Select Node
Unable to display preview. Download preview PDF.
- 1.Blake, C.L., Merz, C.J.: UCI Repository of Machine Learning Databases (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html
- 3.Cios, K.J., Sztandera, L.M.: Continuous ID3 Algorithm with Fuzzy Entropy Measures. In: Proceeding on IEEE International Conference on Fuzzy Systems, San Diego, CA, pp. 469–476 (1992)Google Scholar
- 6.Dasarathy, B.V.: Nearest Neighbor NN Norms: NN Pattern Classification Techniques, pp. 1–30. IEEE Computer Society (1990)Google Scholar
- 16.Quinlan, J.R.: Induction of Decision Trees. Machine Learning 1, 81–106 (1986)Google Scholar
- 17.Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)Google Scholar