A kernel-based case retrieval algorithm with application to bioinformatics

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Case retrieval in case-based reasoning relies heavily on the design of a good similarity function. This paper provides an approach to utilizing the correlative information among features to compute the similarity of cases for case retrieval. This is achieved by extending the dot product-based linear similarity measures to their nonlinear versions with kernel functions. An application to the peptide retrieval problem in bioinformatics shows the effectiveness of the approach. In this problem, the objective is to retrieve the corresponding peptide to the input tandem mass spectrum from a large database of known peptides. By a kernel function implicitly mapping the tandem mass spectrum to a high dimensional space, the correlative information among fragment ions in a tandem mass spectrum can be modeled to dramatically reduce the stochastic mismatches. The experiment on the real spectra dataset shows a significant reduction of 10% in the error rate as compared to a common linear similarity function. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Fu, Y., Yang, Q., Ling, C. X., Wang, H., Li, D., Sun, R., … Gao, W. (2004). A kernel-based case retrieval algorithm with application to bioinformatics. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3157, pp. 544–553). Springer Verlag. https://doi.org/10.1007/978-3-540-28633-2_58

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free