Fast feature ranking algorithm

DMCA

Fast feature ranking algorithm

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Roberto Ruiz , José C. Riquelme , Jesús S. Aguilar-ruiz

Venue:	Knowledge-Based Intelligent Information and Engineering Systems
Citations:	2 - 0 self

BibTeX

@ARTICLE{Ruiz_fastfeature,
    author = {Roberto Ruiz and José C. Riquelme and Jesús S. Aguilar-ruiz},
    title = {Fast feature ranking algorithm},
    journal = {Knowledge-Based Intelligent Information and Engineering Systems},
    year = {},
    pages = {325--331}
}

OpenURL

Abstract

Abstract. The attribute selection techniques for supervised learning, used in the preprocessing phase to emphasize the most relevant attributes, allow making models of classification simpler and easy to understand. The algorithm has some interesting characteristics: lower computational cost (O(m n log n) m attributes and n examples in the data set) with respect to other typical algorithms due to the absence of distance and statistical calculations; its applicability to any labelled data set, that is to say, it can contain continuous and discrete variables, with no need for transformation. In order to test the relevance of the new feature selection algorithm, we compare the results induced by several classifiers before and after applying the feature selection algorithms. 1

Keyphrases

fast feature attribute selection technique discrete variable typical algorithm classification simpler several classifier new feature selection algorithm interesting characteristic data set feature selection algorithm relevant attribute preprocessing phase statistical calculation labelled data set computational cost supervised learning

DMCA