Sciweavers

4591 search results - page 522 / 919
» Learning from Dyadic Data
Sort
View
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
16 years 9 days ago
Post-processing clustering to reduce XCS variability
XCS is a stochastic algorithm, so it does not guarantee to produce the same results when run with the same input. When interpretability matters, obtaining a single, stable result ...
Flavio Baronti, Alessandro Passaro, Antonina Stari...
DAWAK
2006
Springer
15 years 10 months ago
Mixed Decision Trees: An Evolutionary Approach
In the paper, a new evolutionary algorithm (EA) for mixed tree learning is proposed. In non-terminal nodes of a mixed decision tree different types of tests can be placed, ranging ...
Marek Kretowski, Marek Grzes
IJCAI
2007
15 years 8 months ago
Improving Embeddings by Flexible Exploitation of Side Information
Dimensionality reduction is a much-studied task in machine learning in which high-dimensional data is mapped, possibly via a non-linear transformation, onto a low-dimensional mani...
Ali Ghodsi, Dana F. Wilkinson, Finnegan Southey
NIPS
2007
15 years 8 months ago
On higher-order perceptron algorithms
A new algorithm for on-line learning linear-threshold functions is proposed which efficiently combines second-order statistics about the data with the ”logarithmic behavior” ...
Claudio Gentile, Fabio Vitale, Cristian Brotto
AAAI
1997
15 years 8 months ago
Symbolic Nearest Mean Classifiers
The minimum-distance classifier summarizes each class with a prototype and then uses a nearest neighbor approach for classification. Three drawbacks of the original minimum-distan...
Piew Datta, Dennis F. Kibler