基于改进隐马尔可夫模型的元业余设计相似性搜索方法

Qiong Wang, Gu-yu Hu, Gui-qiang Ni, Zhi-song Pan, Zhi-min Miao
{"title":"基于改进隐马尔可夫模型的元业余设计相似性搜索方法","authors":"Qiong Wang, Gu-yu Hu, Gui-qiang Ni, Zhi-song Pan, Zhi-min Miao","doi":"10.1109/META.2008.4723621","DOIUrl":null,"url":null,"abstract":"Hidden Markov model (HMM) is a highly effective mean of modeling a common motif within a set of unaligned sequences, which has been proved to be a prior tool in similarity search analysis based on time-series data [3]. However, its major drawback is that its training process is computationally expensive, which makes it hard to be efficient and precise simultaneously. In this paper, an efficient HMM-based similarity search scheme is proposed with an innovative training algorithm using small size of training data composed of only distinct subsequences, which is very useful for the metamaterial design. Experiment results show that the training time of our method can be reduced extremely to 1% of that of conventional methods. Furthermore, our HMM-based model is more stable with threshold fluctuating, which make it more feasible in practice.","PeriodicalId":345360,"journal":{"name":"2008 International Workshop on Metamaterials","volume":"22 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An efficient similarity search approach based on improved hidden Markov models for the metamateial design\",\"authors\":\"Qiong Wang, Gu-yu Hu, Gui-qiang Ni, Zhi-song Pan, Zhi-min Miao\",\"doi\":\"10.1109/META.2008.4723621\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Hidden Markov model (HMM) is a highly effective mean of modeling a common motif within a set of unaligned sequences, which has been proved to be a prior tool in similarity search analysis based on time-series data [3]. However, its major drawback is that its training process is computationally expensive, which makes it hard to be efficient and precise simultaneously. In this paper, an efficient HMM-based similarity search scheme is proposed with an innovative training algorithm using small size of training data composed of only distinct subsequences, which is very useful for the metamaterial design. Experiment results show that the training time of our method can be reduced extremely to 1% of that of conventional methods. Furthermore, our HMM-based model is more stable with threshold fluctuating, which make it more feasible in practice.\",\"PeriodicalId\":345360,\"journal\":{\"name\":\"2008 International Workshop on Metamaterials\",\"volume\":\"22 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Workshop on Metamaterials\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/META.2008.4723621\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Workshop on Metamaterials","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/META.2008.4723621","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

隐马尔可夫模型(隐马尔可夫模型,HMM)是一种在一组未对齐序列中对共同基序进行建模的高效方法,已被证明是基于时间序列数据[3]的相似性搜索分析的首选工具。然而,它的主要缺点是它的训练过程计算昂贵,这使得它很难同时高效和精确。本文提出了一种基于hmm的高效相似性搜索方案,该方案采用一种创新的训练算法,利用仅由不同子序列组成的小尺寸训练数据进行相似性搜索,这对超材料设计非常有用。实验结果表明,该方法的训练时间可大大缩短至传统方法的1%。此外,在阈值波动的情况下,基于hmm的模型更加稳定,在实际应用中更加可行。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An efficient similarity search approach based on improved hidden Markov models for the metamateial design
Hidden Markov model (HMM) is a highly effective mean of modeling a common motif within a set of unaligned sequences, which has been proved to be a prior tool in similarity search analysis based on time-series data [3]. However, its major drawback is that its training process is computationally expensive, which makes it hard to be efficient and precise simultaneously. In this paper, an efficient HMM-based similarity search scheme is proposed with an innovative training algorithm using small size of training data composed of only distinct subsequences, which is very useful for the metamaterial design. Experiment results show that the training time of our method can be reduced extremely to 1% of that of conventional methods. Furthermore, our HMM-based model is more stable with threshold fluctuating, which make it more feasible in practice.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信