Download:
|
by Rich Caruana, Dayne Freitag
In: Relevance, Papers from the 1994 AAAI Fall Symposium
http://www.fac.cs.cmu.edu/afs/cs.cmu.edu/user/dayne/www/ps/rel94.ps.Z
Add To MetaCart
Abstract:
Eliminating irrelevant attributes prior to induction boosts the performance of many learning algorithms. Relevance, however, is no guarantee of usefulness to a particular learner. We test two methods of finding relevant attributes, FOCUS and RELIEF, to see how the attributes they select perform with ID3/C4.5 on two learning problems from a calendar scheduling domain. A more direct attribute selection procedure, hillclimbing in attribute space, finds superior attribute sets. 1
Citations
|
511
|
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
– Littlestone
- 1988
|
|
490
|
Irrelevant features and the subset selection problem
– John, Kohavi
- 1994
|
|
213
|
Applied Regression Analysis
– Draper, Smith
- 1981
|
|
194
|
Estimating attributes: analysis and extensions of relief
– Kononenko
- 1994
|
|
174
|
Learning With Many Irrelevant Features
– Almuallim, Ditterich
- 1991
|
|
172
|
The Feature Selection Problem: Traditional Methods and a New Algorithm
– Kira, Rendell
- 1992
|
|
165
|
Greedy Attribute Selection
– Caruana, Freitag
- 1994
|
|
117
|
Efficient Algorithms for Minimizing Cross Validation Error
– Moore, Lee
- 1993
|
|
98
|
A personal learning apprentice
– Dent, Boticario, et al.
- 1992
|
|
11
|
Interfaces that learn: A learning apprentice for calendar management
– Jourdan, Dent, et al.
- 1991
|
|
8
|
Improving classification methods via feature selection
– Salzberg
- 1992
|
|
7
|
Scaling to domains with many irrelevant features
– Langley
- 1997
|
|
7
|
Experience with a personal learning assistant
– Mitchell, Caruana, et al.
- 1994
|
|
2
|
Oblivious Decision Trees and Abstract Cases," to be presented at
– Langley, Sage
- 1994
|