Bounding Edit Distance for similarity-based sequence classification on Structural Pattern Recognition

Pattern Recognition tasks in the structural domain generally exhibit high accuracy results, but their time efficiency is quite low. Furthermore, this low performance is more pronounced when dealing with instance-based classifiers, since, for each query, the entire corpus must be evaluated to find the closest prototype. In this work we address this efficiency issue for the Nearest Neighbor classifier when data are encoded as two-dimensional code sequences, and more precisely strings and sequences of vectors. For this, a set of bounds is proposed in the distance metric that avoid the calculation of unnecessary distances. Results obtained prove the effectiveness of the proposal as it reduces the classification time in percentages between 80% and 90% for string representations and between 60% and 80% for data codified as sequences of vectors with respect to their corresponding non-optimized version of the classifier.This research work was partially funded by “Programa I+D+i de la Generalitat Valenciana, Spain” through grant APOSTD/2020/256 by the Spanish Ministerio de Economía, Industria y Competitividad through Project HISPAMUS (No. TIN2017-86576-R supported by EU FEDER funds)