Location:
Search - keogh
Search list
Description: 这是个时间序列分段处理的程序，包含了Eamon Keogh的PAA算法实现，可以直接在eclipse中使用-This is a time series of sub-handling procedures, included Eamon Keogh of PAA algorithm can be used directly in eclipse
Platform: |
Size: 6144 |
Author: shaoqing |
Hits:
Description: OOP Demystified
James Keogh
& Mario Giannini
McGraw-Hill/Osborne
ISBN 0-07-225363-0-OOP Demystified
James Keogh
& Mario Giannini
McGraw-Hill/Osborne
ISBN 0-07-225363-0
Platform: |
Size: 1853440 |
Author: uday |
Hits:
Description: Dynamic Time Warping
Platform: |
Size: 101376 |
Author: yaser |
Hits:
Description: 时间序列的片段自适应提取，是keogh eamonn知名算法的改进版，可实现多特征片段的获取。同时将dtw度量引入。为提高运算速度，距离度量模块采用的c代码，编译后生成dll或者mex32的文件，主模块采用的是.m文件-Time series shapelet.
Platform: |
Size: 152576 |
Author: yuxiao |
Hits:
Description: JavaScript Dymystified
Platform: |
Size: 4042752 |
Author: ivislive |
Hits:
Description: 有时间序列方法和技术的兴趣大增。从人，自然收集的信息几乎每一件，和生物过程是容易随时间的变化，以及这些变化如何发生的研究是一个中心问题充分理解这样的过程。所有的时间序列数据挖掘任务的分类中，可能是最突出的一个。在时间序列的分类有大量的实证研究，在时间域表明近邻规则是非常有效的。然而，一定的时间序列特征不在这个领域很容易地识别和表达的变化可能揭示了一些重要的和未知的特征。在这项工作中我们提出了递归图的使用对于时间序列的分类表示域。我们的方法复发措施地块使用坎帕纳基奥之间的相似性（CK-1）的距离，一个基于Kolmogorov复杂性的距离，利用视频压缩算法来估计图像的相似性。我们表明，递归图与CK-1距离导致比欧氏距离和动态时间翘曲在几个数据集的准确率显著提高。虽然复发地块不能用于所有的数据集提供准确率最高的，我们证明了我们可以预测未来的时间，我们的方法将跑赢时间表示欧氏距离和动态时间弯曲距离。-There is a huge increase of interest for time series methods and techniques. Virtually every piece of information collected human, natural, and biological processes is susceptible to changes over time, and the study of how these changes occur is a central issue to fully understand such processes. Among all time series mining tasks, classification is likely to be the most prominent one. In time series classification there is a significant body of empirical research that indicates that k-nearest neighbor rule in the time domain is very effective. However, certain time series features are not easily identified in this domain and a change in representation may reveal some significant and unknown features. In this work we propose the use of recurrence plots as representation domain for time series classification. Our approach measures the similarity between recurrence plots using Campana-Keogh (CK-1) distance, a Kolmogorov complexity-based distance that uses video compression algorithms to
Platform: |
Size: 11939840 |
Author: 裴孟菲 |
Hits:
Description: Keogh的SAX聚集近似算法，首先采用PAA分段，然后正态化序列，在对应表上查询符号表示，这是一个很经典的时间序列表示方法-Keogh' s SAX gathered approximation algorithm, the first use PAA segment, then normal sequence, query on the corresponding symbol table indicates, this is a classic representation of the time series
Platform: |
Size: 24576 |
Author: Kit |
Hits: