Sciweavers

572 search results - page 64 / 115
» Isotonic Classification Trees
Sort
View
ISMB
1993
13 years 10 months ago
Knowledge Discovery in GENBANK
Wedescribe various methods designed to discover knowledge in the GenBanknucleic acid sequence database. Using a grammatical model of gene structure, we create a parse tree of a ge...
Jeffery S. Aaronson, Juergen Haas, G. Christian Ov...
SAC
2002
ACM
13 years 8 months ago
The P-tree algebra
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
Qin Ding, Maleq Khan, Amalendu Roy, William Perriz...
ICIC
2009
Springer
13 years 6 months ago
Towards a Better Understanding of Random Forests through the Study of Strength and Correlation
In this paper we present a study on the Random Forest (RF) family of ensemble methods. From our point of view, a "classical" RF induction process presents two main drawba...
Simon Bernard, Laurent Heutte, Sébastien Ad...
BMCBI
2010
121views more  BMCBI 2010»
13 years 9 months ago
MS4 - Multi-Scale Selector of Sequence Signatures: An alignment-free method for classification of biological sequences
Background: While multiple alignment is the first step of usual classification schemes for biological sequences, alignment-free methods are being increasingly used as alternatives...
Eduardo Corel, Florian Pitschi, Ivan Laprevotte, G...
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 10 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...