Fitting Sparse Markov Models to Categorical Time Series Using Convex Clustering
利用凸聚类拟合分类时间序列的稀疏马尔可夫模型
Higher-order Markov chains are frequently used to model categorical time series. However, a major problem with fitting such models is the exponentially growing number of parameters in the model order. A popular approach to parsimonious modeling is to use a Variable Length Markov Chain (VLMC), which determines relevant contexts (recent pasts) of variable orders and forms a context tree. A more general parsimonious modeling approach is given by Sparse Markov Models (SMMs),…