Sciweavers

371 search results - page 33 / 75
» Uncertainty Based Selection of Learning Experiences
Sort
View
AAAI
2010
13 years 10 months ago
Efficient Spectral Feature Selection with Minimum Redundancy
Spectral feature selection identifies relevant features by measuring their capability of preserving sample similarity. It provides a powerful framework for both supervised and uns...
Zheng Zhao, Lei Wang, Huan Liu
EWCBR
2006
Springer
14 years 11 days ago
Unsupervised Feature Selection for Text Data
Feature selection for unsupervised tasks is particularly challenging, especially when dealing with text data. The increase in online documents and email communication creates a nee...
Nirmalie Wiratunga, Robert Lothian, Stewart Massie
LION
2010
Springer
190views Optimization» more  LION 2010»
14 years 21 days ago
Algorithm Selection as a Bandit Problem with Unbounded Losses
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
Matteo Gagliolo, Jürgen Schmidhuber
ALGORITHMICA
2006
74views more  ALGORITHMICA 2006»
13 years 8 months ago
Parallelizing Feature Selection
Classification is a key problem in machine learning/data mining. Algorithms for classification have the ability to predict the class of a new instance after having been trained on...
Jerffeson Teixeira de Souza, Stan Matwin, Nathalie...
ICML
2004
IEEE
14 years 9 months ago
Parameter space exploration with Gaussian process trees
Computer experiments often require dense sweeps over input parameters to obtain a qualitative understanding of their response. Such sweeps can be prohibitively expensive, and are ...
Robert B. Gramacy, Herbert K. H. Lee, William G. M...