基于时序聚类的北斗位置冗余数据压缩算法  

Compression Algorithm of Beidou Position Redundant Data Based on Time Series Clustering

作　　者：赵恩来[1] 郝文宁[1] 刘航[1] 戎誉[1] 朱耀华[1] 

机构地区：[1]解放军理工大学工程兵工程学院,南京210007

出　　处：《计算机工程》2012年第4期40-42,共3页Computer Engineering

摘　　要：在北斗用户机的位置数据采集过程中,容易出现数据冗余现象。为此,分析导致数据冗余的原因,提出一种基于时序聚类的冗余数据压缩算法。该算法采用基于密度的聚类方法将数据集进行分簇,把属于同一类运动特征的位置数据归为一类,根据簇直径判断该簇是否为冗余数据,并对冗余数据进行压缩。实验结果表明,该算法可以正确标识冗余数据,实现数据压缩。Aiming at data redundancy problems appeared in the data collection process of Beidou user machine position, the paper analyzes the reason caused by data redundancy. Compression algorithm of redundant data based on time series clustering is proposed. The algorithm which adopts the clustering method based on density puts the data sets into the same cluster, which have the same movement characteristics. According to the cluster diameter to determine whether the cluster is redundant data, then compress the redundant data. Experimental results show the algorithm can correctly identify the redundant data and implement data compression.

关 键 词：冗余数据 时序数据 聚类 数据压缩 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]