Sciweavers

9 search results - page 1 / 2
» Finding Genes in DNA Using Decision Trees and Dynamic Progra...
Sort
View
ISMB
1996
13 years 6 months ago
Finding Genes in DNA Using Decision Trees and Dynamic Programming
This study demonstratesthe use of decision tree classifiers as the basis for a general gene-finding system. The system uses a dynamic programmingalgorithm that. finds the optimal ...
Steven Salzberg, Xin Chen, John Henderson, Kenneth...
BMCBI
2007
148views more  BMCBI 2007»
13 years 4 months ago
Computation of significance scores of unweighted Gene Set Enrichment Analyses
Background: Gene Set Enrichment Analysis (GSEA) is a computational method for the statistical evaluation of sorted lists of genes or proteins. Originally GSEA was developed for in...
Andreas Keller, Christina Backes, Hans-Peter Lenho...
ICSE
2004
IEEE-ACM
14 years 4 months ago
Finding Latent Code Errors via Machine Learning over Program Executions
This paper proposes a technique for identifying program properties that indicate errors. The technique generates machine learning models of program properties known to result from...
Yuriy Brun, Michael D. Ernst
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 5 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
CORR
2006
Springer
109views Education» more  CORR 2006»
13 years 4 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer