Sciweavers

12825 search results - page 130 / 2565
» Improved PLSOM algorithm
Sort
View
BMCBI
2010
164views more  BMCBI 2010»
15 years 2 months ago
Merged consensus clustering to assess and improve class discovery with microarray data
Background: One of the most commonly performed tasks when analysing high throughput gene expression data is to use clustering methods to classify the data into groups. There are a...
T. Ian Simpson, J. Douglas Armstrong, Andrew P. Ja...
AAMAS
2011
Springer
14 years 12 months ago
Using focal point learning to improve human-machine tacit coordination
We consider an automated agent that needs to coordinate with a human partner when communication between them is not possible or is undesirable (tacit coordination games). Specifi...
Inon Zuckerman, Sarit Kraus, Jeffrey S. Rosenschei...
FOCS
2009
IEEE
15 years 11 months ago
Regularity Lemmas and Combinatorial Algorithms
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
Nikhil Bansal, Ryan Williams
GECCO
2003
Springer
171views Optimization» more  GECCO 2003»
15 years 10 months ago
Genetic Algorithm Optimized Feature Transformation - A Comparison with Different Classifiers
When using a Genetic Algorithm (GA) to optimize the feature space of pattern classification problems, the performance improvement is not only determined by the data set used, but a...
Zhijian Huang, Min Pei, Erik D. Goodman, Yong Huan...
SPIRE
2001
Springer
15 years 9 months ago
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms
Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The £rst algorithm is an improvement of Hirschberg’s divide-andc...
Maxime Crochemore, Costas S. Iliopoulos, Yoan J. P...