Download:
|
by Zijian Zheng
for Young Computer Scientists, Peking University
ftp://ftp.cs.su.oz.au/zijian/icycs95.ps.Z
Add To MetaCart
Abstract:
ABSTRACT: An X-of-N is a set containing one or more attribute-value pairs. For a given instance, its value corresponds to the number of its attribute-value pairs that are true. In this paper, we explore the characteristics and performance of continuousvalued X-of-N attributes versus nominal X-of-N attributes for constructive induction. Nominal X-of-Ns are more representationally powerful than continuous-valued X-of-Ns, but the former suffer the "fragmentation " problem, although some mechanisms such as subsetting can help to solve the problem. Two approaches to constructive induction using continuous-valued X-of-Ns are described. Continuous-valued X-of-Ns perform better than nominal ones on domains that need X-of-Ns with only one cut point. On domains that need X-of-N representations with more than one cut point, nominal X-of-Ns perform better than continuous-valued ones. Experimental results on a set of artificial and real-world domains support these statements.
Citations
|
2438
|
Classification and Regression Trees
– Breiman, Friedman, et al.
- 1984
|
|
655
|
UCI Repository of Machine Learning Databases [machine-readable data repository
– Murphy, Aha
- 1992
|
|
509
|
C4.5: Programs for
– Quinlan
- 1993
|
|
162
|
The MONK’s problems – a performance comparison of different learning algorithms
– Thrun
- 1991
|
|
82
|
Constructive Induction on Decision Trees
– Matheus, Rendell
- 1989
|
|
54
|
Id2-of-3: Constructive induction of m-of-n concepts for discriminators in decision trees
– Murphy, Pazzani
- 1991
|
|
53
|
Lookahead feature construction for learning hard concepts
– Ragavan, Rendell
- 1993
|
|
52
|
A comparative study of ID3 and backpropagation for English text-to-speech mapping
– Dietterich, Hild, et al.
- 1990
|
|
29
|
Pattern Recognition as Knowledge-Guided Computer Induction
– Michalski
- 1978
|
|
27
|
Learning Categorical Decision Criteria in Biomedical Domains
– Spackman
- 1988
|
|
25
|
Multistrategy Constructive Induction: AQ17-MCI
– Bloedorn, Michalski, et al.
- 1993
|
|
25
|
Adaptive Decision Tree Algorithms for Learning From Examples
– Pagallo
- 1990
|
|
16
|
Inferring decision graphs using the minimum message length principle
– Oliver, Dowe, et al.
- 1992
|
|
14
|
Constructing nominal x-of-n attributes
– Zheng
- 1995
|
|
9
|
Constructing conjunctive tests for decision trees
– Zheng
- 1992
|
|
6
|
An M-of-N rule induction algorithm and its application to DNA domain
– Ting
- 1994
|
