Sciweavers

2503 search results - page 334 / 501
» New Algorithms for Statistical Analysis of Interval Data
Sort
View
GECCO
2003
Springer
112views Optimization» more  GECCO 2003»
15 years 10 months ago
Dispersion-Based Population Initialization
Reliable execution and analysis of an evolutionary algorithm (EA) normally requires many runs to provide reasonable assurance that stochastic effects have been properly considered...
Ronald W. Morrison
IDEAL
2007
Springer
15 years 11 months ago
A Framework to Analyze Biclustering Results on Microarray Experiments
Microarray technology produces large amounts of information to be manipulated by analysis methods, such as biclustering algorithms, to extract new knowledge. All-purpose multivaria...
Rodrigo Santamaría, Roberto Therón, ...
IDA
2005
Springer
15 years 10 months ago
Biological Cluster Validity Indices Based on the Gene Ontology
With the invention of biotechnological high throughput methods like DNA microarrays and the analysis of the resulting huge amounts of biological data, clustering algorithms gain ne...
Nora Speer, Christian Spieth, Andreas Zell
JEA
2008
120views more  JEA 2008»
15 years 4 months ago
Better external memory suffix array construction
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in b...
Roman Dementiev, Juha Kärkkäinen, Jens M...
INAP
2001
Springer
15 years 9 months ago
Discovering Frequent Itemsets in the Presence of Highly Frequent Items
This paper presents new techniques for focusing the discoveryof frequent itemsets within large, dense datasets containing highly frequent items. The existence of highly frequent i...
Dennis P. Groth, Edward L. Robertson