.png){kind=icon}
返回
Bounding Edit Distance for similarity-based sequence classification on Structural Pattern Recognition
.png){kind=icon}
OA
AI
DOI：10.1016/j.asoc.2020.106778.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Structural pattern recognition
Efficient search
Classification
Nearest neighbor
Edit distance
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
Improving kNN multi-label classification in Prototype Selection scenarios using class proposals.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏分享收藏The dissimilarity space: Bridging structural and statistical pattern recognition相异空间: 桥接结构和统计模式识别
PREAI
分享收藏
查看更多内容