MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Constructing nominal x-of-n attributes (1995) [14 citations — 6 self]

Download:
Download as a PDF | Download as a PS
by Zijian Zheng
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence
http://www3.cm.deakin.edu.au/~zijian/Papers/ijcai95.ps.gz
Add To MetaCart

Abstract:

Most constructive induction researchers focus only on new boolean attributes. This paper reports a new constructive induction algorithm, called XofN, that constructs new nominal attributes in the form of X-of-N representations. 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. The promising preliminary experimental results, on both artificial and real-world domains, show that constructing new nominal attributes in the form of X-of-N representations can significantly improve the performance of selective induction in terms of both higher prediction accuracy and lower theory complexity.

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
418 Multi-interval discretization of continuous-valued attributes for classification learning – Fayyad, Irani - 1993
265 Inferring decision trees using the minimum description length principle – Quinlan, Rivest - 1989
162 The MONK’s problems – a performance comparison of different learning algorithms – Thrun - 1991
129 On changing continuous attributes into ordered discrete attributes – Catlett - 1991
103 HypothesisDriven Constructive Induction in AQ17-HCI: A Method and Experiments – Wnek, Michalski - 1994
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
31 Multivariate versus univariate decision trees – Brodley, Utgoff - 1992
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
16 de Merckt. Decision trees in numerical attribute spaces – Van - 1993
9 Constructing conjunctive tests for decision trees – Zheng - 1992
7 Iterative rule induction methods – Indurkhya, Weiss - 1991
6 An M-of-N rule induction algorithm and its application to DNA domain – Ting - 1994
5 Continuous-valued X-of-N attributes versus nominal X-of-N attributes for constructive induction: a case study – Zheng - 1995
1 CA: University of California, Department of Information and Computer Science, Available by anonymous ftp at ics.uci.edu in the pub/machine-learning-databases directory – Irvine - 1994
View or Download | Add to My Collection | Correct Errors