DMCA
Estimating Attributes: Analysis and Extensions of RELIEF (1994)
Cached
Download Links
- [ai.fri.uni-lj.si]
- [sci2s.ugr.es]
- CiteULike
- DBLP
Other Repositories/Bibliography
| Citations: | 449 - 23 self |
BibTeX
@INPROCEEDINGS{Kononenko94estimatingattributes:,
author = {Igor Kononenko},
title = {Estimating Attributes: Analysis and Extensions of RELIEF},
booktitle = {},
year = {1994},
pages = {171--182},
publisher = {Springer Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
. In the context of machine learning from examples this paper deals with the problem of estimating the quality of attributes with and without dependencies among them. Kira and Rendell (1992a,b) developed an algorithm called RELIEF, which was shown to be very efficient in estimating attributes. Original RELIEF can deal with discrete and continuous attributes and is limited to only two-class problems. In this paper RELIEF is analysed and extended to deal with noisy, incomplete, and multi-class data sets. The extensions are verified on various artificial and one well known real-world problem. 1 Introduction This paper deals with the problem of estimating the quality of attributes with strong dependencies to other attributes which seems to be the key issue of machine learning in general. Namely, for particular problems (e.q. parity problems of higher degrees) the discovering of dependencies between attributes may be unfeasible due to combinatorial explosion. In such cases efficient heuris...
