Sciweavers

2382 search results - page 53 / 477
» Generating Seeded Trees from Data Sets
Sort
View
FSTTCS
1993
Springer
15 years 8 months ago
Induce-Statements and Induce-Expressions: Constructs for Inductive Programming
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
Theodore S. Norvell
IJCNN
2006
IEEE
15 years 10 months ago
Generalizing Independent Component Analysis for Two Related Data Sets
— We introduce in this paper methods for finding mutually corresponding dependent components from two different but related data sets in an unsupervised (blind) manner. The basi...
Juha Karhunen, Tomas Ukkonen
DAWAK
2006
Springer
15 years 7 months ago
Mining Direct Marketing Data by Ensembles of Weak Learners and Rough Set Methods
This paper describes problem of prediction that is based on direct marketing data coming from Nationwide Products and Services Questionnaire (NPSQ) prepared by Polish division of A...
Jerzy Blaszczynski, Krzysztof Dembczynski, Wojciec...
TSP
2010
14 years 10 months ago
Learning graphical models for hypothesis testing and classification
Sparse graphical models have proven to be a flexible class of multivariate probability models for approximating high-dimensional distributions. In this paper, we propose techniques...
Vincent Y. F. Tan, Sujay Sanghavi, John W. Fisher ...
BMCBI
2007
165views more  BMCBI 2007»
15 years 4 months ago
Direct maximum parsimony phylogeny reconstruction from genotype data
Background: Maximum parsimony phylogenetic tree reconstruction from genetic variation data is a fundamental problem in computational genetics with many practical applications in p...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...