MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Using a Hybrid Adaboost Algorithm to Integrate Binding Site Predictions

Download:
pdf
by Yi Sun, Mark Robinson, Rod Adams, Paul Kaye, Alistair G. Rust, Neil Davey
http://homepages.feis.herts.ac.uk/~nngroup/pubs/papers/Sun-ICMI05.pdf
Add To MetaCart

Abstract:

Abstract — Currently the best algorithms for transcription factor binding site prediction are severely limited in accuracy. There is good reason to believe that predictions from these different classes of algorithms could be used in conjunction to improve the quality of predictions. In previous work, we have applied single layer networks, rules sets and support vector machines on predictions from ¡£ ¢ key real valued algorithms. Furthermore, we used a ‘window ’ of consecutive results in the input vector in order to contextualise the neighbouring results. In this paper, we improve the classification result with the aid of a hybrid Adaboost algorithm working on the dataset with windowed inputs. In the proposed algorithm, we first apply weighted majority voting. Those data points which cannot be classified ‘easily ’ using weighted majority voting are then classified using the Adaboost algorithm. We find that our method outperforms each of the original individual algorithms and the other classifiers used previously in this work. I.

Citations

1133 A decision-theoretic generalization of online learning and an application to boosting – Freund, Schapire - 1995
483 Boosting the margin: A new explanation for the effectiveness of voting methods – Schapire, Freund, et al. - 1998
178 Fitting a mixture model by expectation maximization to discover motifs in biopolymers – Bailey, Elkan - 1994
102 Learning with Kernels: Support Vector – Scholkopf, Smola - 2001
100 Computational identification of cis-regulatory elements associated with groups of functionally related genes in Saccharomyces cerevisiae – Hughes, Estep, et al. - 2000
89 SMOTE: Synthetic Minority Over-sampling Technique – Chawla, Bowyer, et al.
49 Probability estimates for multi-class classification by pairwise coupling – Wu, Lin, et al. - 2004
43 The hardwiring of development: Organization and function of genomic regulatory systems – Arnone, Davidson - 1997
35 A Gibbs sampling method to detect over-represented motifs in upstream regions of coexpressed genes – Thijs, Marchal, et al. - 2002
30 The Relationship Between Recall and Precision – Buckland, Gey - 1994
27 Using Rule Sets to Maximize ROC Performance – Fawcett - 2001
25 Efficient Detection of Unusual Words – Apostolico, Bock, et al. - 2000
23 Evaluating Boosting Algorithms to Classify Rare Classes – Joshi, Kumar, et al. - 2001
17 FootPrinter: a program designed for phylogenetic footprinting – Blanchette, Tompa - 2003
11 Class-Boundary Alignment for Imbalanced Dataset Learning – Wu, Chang - 2003
9 Computational detection of genomic cis regulatory modules, applied to body patterning in the early Drosophila embryo – Rajewsky, Vergassola, et al. - 2002
4 Class imbalances: Are we focusing on the right issure?” Workshop on learning from imbalanced datasets – Japkowicz - 2003
4 Decoding Noncoding Regulatory DNAs – Markstein, Stathopoulos, et al. - 2002
1 The genetic code”, Sci Am 207 – Crick
1 Rust and N.Davey, “Using Real-valued Meta Classifiers to Integrate Binding Site – Sun, Robinson, et al. - 2005