Metric learning for sequences in relational LVQ

NEUROCOMPUTING

卷:169

Article; Proceedings Paper

Mokbel, Bassam¹  Paassen, Benjamin¹  Schleif, Frank-Michael²  Hammer, Barbara¹ 

[1] Univ Bielefeld, CITEC Ctr Excellence, D-33619 Bielefeld, Germany

[2] Univ Birmingham, Sch Comp Sci, Birmingham B15 2TT, W Midlands, England

关键词: Metric learning;    Dissimilarity data;    Sequential data;    Relational LVQ;   

DOI  :  10.1016/j.neucom.2014.11.082

来源: Elsevier

【 摘 要 】

Metric learning constitutes a well-investigated field for vectorial data with successful applications, e.g. in computer vision, information retrieval, or bioinformatics. One particularly promising approach is offered by low-rank metric adaptation integrated into modern variants of learning vector quantization (LVQ). This technique is scalable with respect to both data dimensionality and the number of data points, and it can be accompanied by strong guarantees of learning theory. Recent extensions of LVQ to general (dis-) similarity data have paved the way towards LVQ classifiers for non-vectorial, possibly discrete, structured objects such as sequences, which are addressed by classical alignment in bioinformatics applications. In this context, the choice of metric parameters plays a crucial role for the result, just as it does in the vectorial setting. In this contribution, we propose a metric learning scheme which allows for an autonomous learning of parameters (such as the underlying scoring matrix in sequence alignments) according to a given discriminative task in relational LVQ. Besides facilitating the often crucial and problematic choice of the scoring parameters in applications, this extension offers an increased interpretability of the results by pointing out structural invariances for the given task. (C) 2015 Elsevier B.V. All rights reserved.

【 授权许可】

Free