Gradient boosting for sequence alignment

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 452-457

  Parker, Charles ^a   Fern, Alan ^a   Tadepalli, Prasad ^a  

^a OREGON STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC MATCHING; GRADIENT BOOSTING; SEQUENCE ALIGNMENT; SEQUENCE ALIGNMENT ALGORITHMS; STANDARD FUNCTION APPROXIMATION PROBLEMS;

ALGORITHMS; DATA TRANSFER; DYNAMIC PROGRAMMING; FUNCTION EVALUATION; GRADIENT METHODS; MATHEMATICAL MODELS; PATTERN MATCHING; PROBLEM SOLVING; QUERY LANGUAGES; SEQUENTIAL MACHINES;

INFORMATION RETRIEVAL;

EID: 33750720635     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Carré, M.; Philippe, P.; and Apélian, C. 2001. New queryby-humming music retrieval system conception and evaluation based on a query nature study. In Proc. COST G-6 Conference on Digital Audio Effects.
2. Dannenberg, R. B.; Birmingham, W. P.; Tzanetakis, G.; Meek, C.; Hu, N.; and Pardo, B. 2003. The musart testbed for query-by-humming evaluation. In Proc. 4th International Symposium on Music Information Retrieval.
3. Dietterich, T. G.; Ashenfelter, A.; and Bulatov, Y. 2004. Training conditional random fields via gradient tree boosting. In International Conference on Machine Learning.
4. Durbin, R.; Eddy, S.; Krogh, A.; and Mitchison, G. 1998. Biological Sequence Analysis. Cambridge University Press.
5. Friedman, J.; Hastie, T.; and Tibshirani, R. 2000. Additive logistic regression: a statistical view of boosting. Annals of Statistics 28(2):337-407.
6. Joachims, T. 2003. Learning to align sequences, a maximum margin approach. Technical report, Cornell University.
7. Krogh, A.; Brown, M.; Mian, I. S.; Sjölander, K.; and Haussler, D. 1994. Hidden Markov models in computational biology: Applications to protein modeling. Journal of Molecular Biology 235:1501-1531.
8. Lafferty, J.; McCallum, A.; and Pereira, F. 2001. Conditional random fields: Probabilistic models for segmenting and lebeling sequence data. In ICML.
9. Meek, C. 2004. Modelling error in query-by-humming applications. Ph.D. Dissertation, The University of Michigan.
10. Pardo, B., and Birmingham, W. 2002. Encoding timing information for musical query matching. In Proc. 3rd International Symposium on Music Information Retrieval.
11. Rabiner, L. R. 1989. A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE 77(2):257-285.
12. Sinha, S. 2004. Leaf shape recognition via support vector machines with edit distance kernels. Master's thesis, Oregon State University.
13. Smith, M. S., and Waterman, T. F. 1981. Identification of common molecular subsequence. Journal of Molecular Biology 147:195-197.
14. Taskar, B.; Guestrin, C.; and Koller, D. 2004. Max margin markov networks. In NIPS.
15. Tsochantaridis, I.; Hofmann, T.; Joachims, T.; and Altun, Y. 2004. Support vector machine learning for interdependent and structured output spaces. In Proc. 21st International Conference on Machine Learning.
16. Vapnik, V. N. 1998. Statistical Learning Theory. John Wiley & Sons.