By Topic

An efficient similarity search approach based on improved hidden Markov models for the metamateial design

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Qiong Wang ; Inst. of Command Autom., PLA Univ. of Sci. & Technol., Nanjing ; Gu-Yu Hu ; Gui-qiang Ni ; Zhi-song Pan
more authors

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.

Published in:

Metamaterials, 2008 International Workshop on

Date of Conference:

9-12 Nov. 2008