首页 | 官方网站   微博 | 高级检索  
     

基于最大熵投票模型的时间序列无监督分割
引用本文:孙焘,冯林,郑虎,高成锴.基于最大熵投票模型的时间序列无监督分割[J].计算机工程,2009,35(22):26-28.
作者姓名:孙焘  冯林  郑虎  高成锴
作者单位:大连理工大学创新实验学院,大连,116024
基金项目:国家自然科学基金资助项目,辽宁省自然科学基金资助项目 
摘    要:通过高维时间序列分割可以创建高级符号表示。提出一种针对高维时间序列的无监督分割算法,用于解决高维数据符号化的预处理问题。该算法实现对高维数据的聚类,应用最大熵投票模型进行序列分割。实验结果表明,其平均查全率和查准率分别为0.86和0.88,且整体性能优于主成分分析算法和概率主成分分析算法。

关 键 词:最大熵投票模型  k-mean聚类  高维时间序列  无监督分割
修稿时间: 

Unsupervised Segmentation of Time Series Based on Max Entropy Voting Model
SUN Tao,FENG Lin,ZHENG Hu,GAO Cheng-kai.Unsupervised Segmentation of Time Series Based on Max Entropy Voting Model[J].Computer Engineering,2009,35(22):26-28.
Authors:SUN Tao  FENG Lin  ZHENG Hu  GAO Cheng-kai
Affiliation:(School of Innovation Experiment, Dalian University of Technology, Dalian 116024)
Abstract:Through the high-dimension segmentation, the high-level symbol expression can be created. This paper proposes an unsupervised segmentation algorithm for high-dimension time series. This method can solve the pretreatmant problem of high-dimension symbolization. It realizes the clustering of high-dimension data, and uses max entropy voting model to do series segmentation. Experimental results show that the algorithm's average recall ratio and precision ration are respectively 0.86 and 0.88. Its whole performance is better than Principal Component Analysis(PCA) algorithm and Probability Principal Component Analysis(PPCA) algorithm.
Keywords:max entropy voting model  k-mean clustering  high-dimension time series  unsupervised segmentation
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号