title: A normalized statistical metric space for hidden Markov models.
abstract: In this paper, we present a normalized statistical metric space for hidden Markov models (HMMs). HMMs are widely used to model real-world systems. Like graph matching, some previous approaches compare HMMs by evaluating the correspondence, or goodness of match, between every pair of states, concentrating on the structure of the models instead of the statistics of the process being observed. To remedy this, we present a new metric space that compares the statistics of HMMs within a given level of statistical significance. Compared with the Kullback-Leibler divergence, which is another widely used approach for measuring model similarity, our approach is a true metric, can always return an appropriate distance value, and provides a confidence measure on the metric value. Experimental results are given for a sample application, which quantify the similarity of HMMs of network traffic in the Tor anonymization system. This application is interesting since it considers models extracted from a system that is intentionally trying to obfuscate its internal workings. In the conclusion, we discuss applications in less-challenging domains, such as data mining.
authors.affiliation: The Holcombe Department of Electrical and Computer Engineering, Clemson University, Clemson, SC 29634, USA. lu4@clemson.edu
authors.forename: Chen
authors.initials: C
authors.lastname: Lu
authors.forename: Jason M
authors.initials: JM
authors.lastname: Schwier
authors.forename: Ryan M
authors.initials: RM
authors.lastname: Craven
authors.forename: Lu
authors.initials: L
authors.lastname: Yu
authors.forename: Richard R
authors.initials: RR
authors.lastname: Brooks
authors.forename: Christopher
authors.initials: C
authors.lastname: Griffin
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D003627:Data Interpretation, Statistical; D057225:Data Mining / Q000379:methods*; D008390:Markov Chains; D015233:Models, Statistical