The Novel Sequence Distance Measuring Algorithm Based on Optimal Transport and Cross-Attention Mechanism. (31st August 2021)

• Record Type: Journal Article
• Authors: Yu, Yanmin; Lai, Yongcai; Yan, Ping; Liu, Haiying
• Other Names: Duan Chaoqun Academic Editor.
• Is Part Of: Shock and vibration. Volume 2021(2021)
• Publication Date: 2021-08-31
• Subjects: Shock (Mechanics) -- Periodicals; Vibration -- Periodicals; 534.5
• DOI: 10.1155/2021/3272119
• Languages: English
• ISSNs: 1070-9622

Abstract

Abstract : In this paper, we propose a novel sequence distance measuring algorithm based on optimal transport (OT) and cross-attention mechanism. Given a source sequence and a target sequence, we first calculate the ground distance between each pair of source and target terms of the two sequences. The ground distance is calculated over the subsequences around the two terms. We firstly pay attention from each the source terms to each target terms with attention weights, so that we have a representative source subsequence vector regarding each term in the target subsequence. Then, we pay attention from each representative vector of the term of the target subsequence to the entire source subsequence. In this way, we construct the cross-attention weights and use them to calculate the pairwise ground distances. With the ground distances, we derive the OT distance between the two sequences and train the attention parameters and ground distance metric parameters together. The training process is conducted with training triplets of sequences, where each triplet is composed of an anchor sequence, a must-link sequence, and a cannot-link sequence. The corresponding hinge loss function of each triplet is minimized, and we develop an iterative algorithm to solve the optimal transport problem and the attention/ground distance metric parameters in an alternate way. The experiments over sequence similarity search benchmark datasets, including text, video, and rice smut protein sequence data, are conducted. The experimental results show the algorithm is effective.