Learning sequence neighbourhood metrics

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

Abstract

Recurrent neural networks (RNNs) in combination with a pooling operator and the neighbourhood components analysis (NCA) objective function are able to detect the characterizing dynamics of sequences and embed them into a fixed-length vector space of arbitrary dimensionality. Subsequently, the resulting features are meaningful and can be used for visualization or nearest neighbour classification in linear time. This kind of metric learning for sequential data enables the use of algorithms tailored towards fixed length vector spaces such as ℝ n. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Bayer, J., Osendorfer, C., & Van Der Smagt, P. (2012). Learning sequence neighbourhood metrics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7552 LNCS, pp. 531–538). https://doi.org/10.1007/978-3-642-33269-2_67

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