Sciweavers

126 search results - page 12 / 26
» Finding low-entropy sets and trees from binary data
Sort
View
DMIN
2007
158views Data Mining» more  DMIN 2007»
15 years 1 months ago
Mining Frequent Itemsets Using Re-Usable Data Structure
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
Mohamed Yakout, Alaaeldin M. Hafez, Hussein Aly
BMCBI
2010
142views more  BMCBI 2010»
14 years 11 months ago
pplacer: linear time maximum-likelihood and Bayesian phylogenetic placement of sequences onto a fixed reference tree
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
Frederick A. Matsen III, Robin B. Kodner, E. Virgi...
82
Voted
LREC
2008
89views Education» more  LREC 2008»
15 years 1 months ago
Parser Evaluation and the BNC: Evaluating 4 constituency parsers with 3 metrics
We evaluate discriminative parse reranking and parser self-training on a new English test set using four versions of the Charniak parser and a variety of parser evaluation metrics...
Jennifer Foster, Josef van Genabith
GCB
2000
Springer
137views Biometrics» more  GCB 2000»
15 years 3 months ago
Detecting Sporadic Recombination in DNA Alignments with Hidden Markov Models
Conventional phylogenetic tree estimation methods assume that all sites in a DNA multiple alignment have the same evolutionary history. This assumption is violated in data sets fro...
Dirk Husmeier, Frank Wright
JMLR
2010
117views more  JMLR 2010»
14 years 6 months ago
Exploiting the High Predictive Power of Multi-class Subgroups
Subgroup discovery aims at finding subsets of a population whose class distribution is significantly different from the overall distribution. A number of multi-class subgroup disc...
Tarek Abudawood, Peter A. Flach