摘要
提出了一种基于最小边界矩形的新颖的时间序列表示方法(GMBR),该方法将网格的概念引入到MBR中,能够在保证低开小的情况下有效地提高查找的准确性,最后通过实验证明了该方法的有效性,实验分别在实际数据和合成数据上进行。结果表明该方法的剪枝率为69%~92%,高出MBR方法4%~9%。
This paper proposess a novel time series representation called GMBR based on Minimum Bounding Rectangle in which the binary idea is applied into the MBR.The experiments have been performed on synthetic,as well as real data sequences to evaluate the proposed method.The experiment demonstrates that 69-92 percent of irrelevant sequences are pruned using the proposed method.
出处
《计算机工程与应用》
CSCD
北大核心
2008年第16期135-138,共4页
Computer Engineering and Applications
基金
国家自然科学基金(the National Natural Science Foundation of China under Grant No.60674088)
山东省教育厅07科研发展计划课题(No.J07WJ20)