Sciweavers

2553 search results - page 173 / 511
» Evaluating machine creativity
Sort
View
DNA
2005
Springer
118views Bioinformatics» more  DNA 2005»
15 years 10 months ago
Molecular Learning of wDNF Formulae
We introduce a class of generalized DNF formulae called wDNF or weighted disjunctive normal form, and present a molecular algorithm that learns a wDNF formula from training example...
Byoung-Tak Zhang, Ha-Young Jang
IDA
2005
Springer
15 years 10 months ago
Learning from Ambiguously Labeled Examples
Inducing a classification function from a set of examples in the form of labeled instances is a standard problem in supervised machine learning. In this paper, we are concerned w...
Eyke Hüllermeier, Jürgen Beringer
ECML
2004
Springer
15 years 10 months ago
Improving Random Forests
Random forests are one of the most successful ensemble methods which exhibits performance on the level of boosting and support vector machines. The method is fast, robust to noise,...
Marko Robnik-Sikonja
HAIS
2009
Springer
15 years 8 months ago
Beyond Homemade Artificial Data Sets
One of the most important challenges in supervised learning is how to evaluate the quality of the models evolved by different machine learning techniques. Up to now, we have relied...
Núria Macià, Albert Orriols-Puig, Es...
ECML
2006
Springer
15 years 8 months ago
An Efficient Approximation to Lookahead in Relational Learners
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
Jan Struyf, Jesse Davis, C. David Page Jr.