A simple and efficient method for variable ranking according to their usefulness for learning

DOI10.1016/j.csda.2007.02.003zbMath1452.62115OpenAlexW2025392565WikidataQ62618145 ScholiaQ62618145MaRDI QIDQ1020844

Oscar Luaces, José Ramón Quevedo, Antonio Bahamonde

Publication date: 2 June 2009

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10651/30706

zbMATH Keywords

dimensionality reductionvariable ranking

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (3)

Modeling the variability of rankings ⋮ Editorial: Statistical learning methods including dimensionality reduction ⋮ Maximizing equity market sector predictability in a Bayesian time-varying parameter model

Uses Software

• C4.5

Cites Work

• Orthogonal least squares methods and their application to non-linear system identification
• 10.1162/153244303322753616
• 10.1162/153244303322753706
• 10.1162/153244303322753733
• Machine Learning: ECML 2004
• Solving linear least squares problems by Gram-Schmidt orthogonalization
• Gene selection for cancer classification using support vector machines
• Unnamed Item

This page was built for publication: A simple and efficient method for variable ranking according to their usefulness for learning