[信息与通信]introduction to machine learning research on time sereis 机器学习在时间序列中的介绍.pdf

[信息与通信]introduction to machine learning research on time sereis 机器学习在时间序列中的介绍.pdf

  1. 1、本文档共35页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
[信息与通信]introduction to machine learning research on time sereis 机器学习在时间序列中的介绍

Introduction to Machine Learning Research on Time Series Umaa Rebbapragada Tufts University Advisor: Carla Brodley 1/29/07 Machine Learning (ML) • Originally a subfield of AI • Extraction of rules and patterns from data sets • Focused on: • Computational complexity • Memory Machine Learning Tasks for Time Series • Classification • Clustering • Semi-supervised learning • Anomaly Detection Assumptions • Univariate time series • Time series databases Single Time Series • A single long time series can be converted into a set of smaller time series by sliding a window incrementally across the time series : • Window length is usually a user-specified parameter. Challenges of Times Series Data • High dimensional • Voluminous • Requires fast technique Brute Force Similarity Search • Given query time series Q, the best match by sequential scanning is found by: • O(nd) • Finding the nearest neighbor for each time series in the database is prohibitive. Similarity Search • Clustering and classification methods perform many similarity calculations • Some require storage of the k nearest neighbors of each data instance • Critical that these calculations be fast Speeding up Similarity Search • Alternate time series representations • Search databases faster • New similarity metrics Data Mining Time Series Toolbox • Indexing • Dimensionality Reduction • Segmentation • Discretization • Similarity metric Indexing • Faster than a sequential scan • Insertions and deletions do not require rebuilding the entire index • Partition the dat

文档评论(0)

jiupshaieuk12 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

版权声明书
用户编号:6212135231000003

1亿VIP精品文档

相关文档