pith. sign in

arxiv: 1109.2034 · v2 · pith:SC7VFBKRnew · submitted 2011-09-09 · 💻 cs.NE · cs.LG

Learning Sequence Neighbourhood Metrics

classification 💻 cs.NE cs.LG
keywords learningneighbourhoodvectorablealgorithmsanalysisarbitrarycharacterizing
0
0 comments X
read the original 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 R^n.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.