A. Pereira, J. Vega, A. Portas, R. Castro, A. Murari, J. Contributors
{"title":"Optimised search strategies to improve structural pattern recognition techniques","authors":"A. Pereira, J. Vega, A. Portas, R. Castro, A. Murari, J. Contributors","doi":"10.1504/IJNKM.2010.031151","DOIUrl":null,"url":null,"abstract":"Data retrieval methods are based on three essential aspects: feature extraction (to reduce signal dimensionality), the classification system (to index objects according to some criteria) and similarity measures (to compare how similar two objects are); but there is not a single solution to handle these key elements. This paper provides a new solution to the localisation and extraction of similar patterns in time-series data. Alternative searches are proposed to objectively increase the recognition of similar patterns so as to achieve better results on the data retrieval. These search strategies have been studied with excellent results in the detection of long subpatterns. Long subpatterns are not very easy to identify since even a single mismatch in one character can compromise similarity between two patterns. Identifying long patterns in a fast, fault-tolerant and intelligent way is the aim of the analysed strategies, which are formally based on statistical criteria and some aspects of probability theory.","PeriodicalId":188437,"journal":{"name":"International Journal of Nuclear Knowledge Management","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Nuclear Knowledge Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJNKM.2010.031151","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Data retrieval methods are based on three essential aspects: feature extraction (to reduce signal dimensionality), the classification system (to index objects according to some criteria) and similarity measures (to compare how similar two objects are); but there is not a single solution to handle these key elements. This paper provides a new solution to the localisation and extraction of similar patterns in time-series data. Alternative searches are proposed to objectively increase the recognition of similar patterns so as to achieve better results on the data retrieval. These search strategies have been studied with excellent results in the detection of long subpatterns. Long subpatterns are not very easy to identify since even a single mismatch in one character can compromise similarity between two patterns. Identifying long patterns in a fast, fault-tolerant and intelligent way is the aim of the analysed strategies, which are formally based on statistical criteria and some aspects of probability theory.