Results 231 to 240 of about 1,077,252 (284)

SOME RESULTS IN THE EXTENSION WITH A COHERENT SUSLIN TREE (Aspects of Descriptive Set Theory)

SOME RESULTS IN THE EXTENSION WITH A COHERENT SUSLIN TREE (Aspects of Descriptive Set Theory)
openaire  

Some of the next articles are maybe not open access.

Related searches:

Construction of Decision Tree Based on Rough Sets Theory

Advanced Materials Research, 2012
In the process of constructing decision trees, the selecting criteria of classification attributes will directly affect the classification results. Here we presented the classification contribution function (CCF), a new concept based on rough sets theory, which is regarded as the criteria for choosing attributes in the core of attributes.
Zhi Jun Lei, Lin Li Wu
openaire   +1 more source

A New Decision Tree Algorithm Based on Rough Set Theory

2009 Asia-Pacific Conference on Information Processing, 2009
Decision tree algorithm has been widely used to classify numeric and categorical attributes. Lots of approaches were suggested in order to induce decision trees. ID3 (Quinlan, 1986), as a heuristic algorithm, is very classic and popular in the induction of decision trees.
Baoshi Ding, Yongqing Zheng, Shaoyu Zang
openaire   +1 more source

An Algorithm for Decision Tree Construction Based on Rough Set Theory

2008 International Conference on Computer Science and Information Technology, 2008
In this paper, a novel and effective algorithm is introdcued for constructing decision tree. First of all, the knowledge dependence in rough set theory is used to reduce the test attribute set of decision tree, that is, the test attribute space is optimized and hence the attributes which are not correlated with the decision information are deleted ...
Cuiru Wang, Fangfang Ou
openaire   +1 more source

Data-driven decision tree learning algorithm based on rough set theory

Proceedings of the 2005 International Conference on Active Media Technology, 2005. (AMT 2005)., 2005
Decision tree pre-pruning is an effective method to solve the over-fitting problem in decision tree learning process. However, it is difficult to estimate the exact time to stop the growing process of a decision tree, which limits the developments and applications of this method.
null Desheng Yin, null Guoyin Wang, null Yu Wu   +2 more
openaire   +1 more source

Induction of Decision Trees Based on the Rough Set Theory

1998
This paper aimed at two following objectives. One was the introduction of a new measure (R-measure) of dependency between groups of attributes in a data set, inspired by the notion of dependency of attribute in the rough set theory. The second was the application of this measure to the problem of attribute selection in decision tree induction, and an ...
Tu Bao Ho, Trong Dung Nguyen, Masayuki Kimura   +2 more
openaire   +1 more source