Sciweavers

165 search results - page 7 / 33
» Measuring the Diversity of a Test Set With Distance Entropy
Sort
View
EMMCVPR
1997
Springer
15 years 1 months ago
Genetic Algorithms for Ambiguous Labelling Problems
Consistent labelling problems frequently have more than one solution. Most work in the "eld has aimed at disambiguating early in the interpretation process, using only local ...
Richard Myers, Edwin R. Hancock
BMCBI
2008
138views more  BMCBI 2008»
14 years 9 months ago
Information transfer in signaling pathways: A study using coupled simulated and experimental data
Background: The topology of signaling cascades has been studied in quite some detail. However, how information is processed exactly is still relatively unknown. Since quite divers...
Jürgen Pahle, Anne K. Green, C. Jane Dixon, U...
ISDA
2009
IEEE
15 years 4 months ago
Clustering-Based Feature Selection in Semi-supervised Problems
— In this contribution a feature selection method in semi-supervised problems is proposed. This method selects variables using a feature clustering strategy, using a combination ...
Ianisse Quinzán, José Manuel Sotoca,...
AE
2003
Springer
15 years 2 months ago
A Study of Diversity in Multipopulation Genetic Programming
In this work we study how using multiple communicating populations instead of a single panmictic one may help in maintaining diversity during GP runs. After defining suitable geno...
Marco Tomassini, Leonardo Vanneschi, Francisco Fer...
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
Bodo Manthey, Heiko Röglin