{"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}
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.