Sciweavers

1060 search results - page 103 / 212
» On the Discovery of Random Trees
Sort
View
CORR
2007
Springer
114views Education» more  CORR 2007»
15 years 6 months ago
Self-organizing maps and symbolic data
Abstract. In data analysis new forms of complex data have to be considered like for example (symbolic data, functional data, web data, trees, SQL query and multimedia data,. . . )....
Aïcha El Golli, Brieuc Conan-Guez, Fabrice Ro...
PIMRC
2008
IEEE
16 years 22 days ago
Dynamic data aggregation and transport in wireless sensor networks
—In wireless sensor networks, in-network aggregation is the process of compressing locally the data gathered by the sensor nodes, so that only the compressed data travel across s...
Mario O. Diaz, Kin K. Leung
ALIFE
2004
15 years 6 months ago
Using Avida to Test the Effects of Natural Selection on Phylogenetic Reconstruction Methods
Phylogenetic trees group organisms by their ancestral relationships. There are a number of distinct algorithms used to reconstruct these trees from molecular sequence data, but dif...
George I. Hagstrom, Dehua H. Hang, Charles Ofria, ...
CATA
2009
15 years 7 months ago
Nearest Shrunken Centroid as Feature Selection of Microarray Data
The nearest shrunken centroid classifier uses shrunken centroids as prototypes for each class and test samples are classified to belong to the class whose shrunken centroid is nea...
Myungsook Klassen, Nyunsu Kim
BMCBI
2008
139views more  BMCBI 2008»
15 years 6 months ago
A topological transformation in evolutionary tree search methods based on maximum likelihood combining p-ECR and neighbor joinin
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
Maozu Guo, Jian-Fu Li, Yang Liu