时间序列时序关联规则挖掘研究
|
摘要
时间序列的时序关联规则指时间序列局部变化趋势之间的具有时间约束的关联关系,这些局部变化趋势发生本身具有时间先后顺序,因此这种关联关系就体现出时序性。时间序列的数据密集性、随机波动性和数据海量性决定了只有通过数据挖掘方法才能获取隐含的时序关联规则。
时间序列时序关联规则挖掘是一个系统工程,分为时间序列预处理、时间序列压缩、时间序列模式相似性度量、时间序列时序关联规则获取、解释和评价等步骤。目前关于各步骤挖掘方法的研究还不够完善,主要表现在以下方面:(1)在孤立点噪声数据的识别中,基于统计学识别法很难获得样本的分布参数,基于小波变换识别法改变了原始时间序列的真实性,基于似然比识别法的计算量较大;(2)在经典时间序列时序关联规则挖掘中,以给定长度和滑动步长的滑动窗口把时间序列离散成模式序列,然后获取频繁模式,最后生成强时序关联规则。由于滑动窗口的长度和滑动步长是由人为给定,这样时间序列的压缩结果具有很强的人为性,挖掘结果也就具有很强的不确定性;(3)时间序列模式相似性的度量是获取模式序列中频繁模式的基础,决定着时序关联规则获取。目前,元模式单调距离和元模式向量距离中对元模式表示都存在缺陷,所以元模式相似性的度量存在一定问题。而且,现有度量序列模式相似性的方法不能用距离法度量不同长度的两个序列模式的相似性。
时间序列时序关联规则具有很强的实用价值,但正如上述,目前挖掘方法却不完善。因此,本文的研究重点是时间序列时序关联规则挖掘方法的改进和完善,提出理论模型与实证分析,力求从时间序列中获取更多可靠的时序关联规则,从而为决策者提供更好的决策帮助。
本文以挖掘步骤为主线展开论述,共分八章,每章的结构安排为:首先综述国内外对本步骤所涉及的理论和研究现状,其次分析研究中存在的问题,然后提出相应的改进方法,并用实证进行分析和论证。文章主要内容包括:
(1)时间序列预处理
时间序列的预处理是时间序列时序关联规则挖掘的第一步:怎样清洗时间序列中的噪声数据。这部分首先对时间序列的噪声数据进行界定,其次综述已有时间序列孤立点噪声数据的识别方法,并且分析这些方法的优缺点,最后提出基于数据相对变化率的时间序列孤立点噪声数据的识别方法。
(2)时间序列的压缩
时间序列压缩是时间序列时序关联规则挖掘的第二步:如何把时间序列转化成模式序列。首先分析时序关联规则挖掘过程中数据压缩的必要性、目的和意义,其次综述已有时间序列压缩方法,在此基础上提出时间序列压缩方法的评价体系,并对已有压缩方法进行比较分析,然后选择有利于时序关联规则挖掘的时间序列压缩方法,最后对所选择压缩方法分割点的确定加以改进。
(3)时间序列模式相似性的度量
时间序列模式间相似性度量是时间序列时序关联规则的重要内容之一。只有很好地度量模式间的相似性,才能更好地完成模式序列中频繁模式和时序关联规则的获取。本文认为已有度量两个元模式相似性的方法存在弊端,考虑到序列模式的相似性度量涉及两个不同长度的模式,因而把度量两个不同维数的点间的距离的方法应用到序列模式相似性的度量上,提出序列模式相似性的动态时间弯曲距离度量法。
(4)时间序列时序关联规则的获取
时间序列时序关联规则挖掘的第三步:怎样从模式序列中获取频繁模式进而生成强时序关联规则。在一般时序关联规则中,对象或者事件的频繁性由其出现的次数决定。但由于时间序列模式的差异性,模式出现的次数不能决定其频繁性,而应由与其相似模式的数目决定。在时序关联规则的生成过程中,针对时间序列模式频繁性的特殊性,本文提出时序关联规则的分层获取方法,并用实证加以分析。
(5)时间序列的相似性
本文对时间序列的相似性研究从两方面展开。一方面研究一元时间序列序列的相似性。首先综述国内外关于时间序列相似性的研究,并分析存在问题,然后针对时间序列的时序性特点提出度量时间序列相似性的图形相似法,并分析该方法的优缺点;另一方面研究多元时间序列的相似性。首先分析度量多元时间序列相似性的必要性,然后分析该研究的难点所在,最后提出两种度量时间序列相似性的方法:基于矩阵范数和基于综合属性的多元时间序列的相似性度量方法。
(6)时间序列时序关联规则挖掘平台
时间序列时序关联规则挖掘平台以JAVA作为开发语言,共有六个模块,实现数据加载、时间序列的预处理、时间序列压缩、时间序列模式相似性度量、时序关联规则获取、时序关联规则评价和时间序列相似性度量等功能。一方面对各个步骤的改进方法进行实证分析,另一方面实现从时间序列中挖掘时序关联规则。
本文的研究按照时序关联规则的挖掘步骤展开,从时间序列时序关联规则的第一步时间序列预处理到最后一步时序关联规则解释与评价。在每个步骤中,对已有研究进行梳理,对所涉及的理论模型进行推导,并提出改进方法。由于时间序列相似性在时间序列数据挖掘中起到重要作用,本文专门对时间序列的相似性进行探讨。本文的主要创新点归纳为:
(1)在时序关联规则挖掘的时间序列预处理中,提出基于数据相对变化率的孤立点噪声数据识别方法。时间序列一般都含有噪声数据,其存在对时序关联规则的挖掘有很大影响,因此,在挖掘前必须去除噪声数据。但由于时间序列压缩对孤立点噪声数据不具有容忍性,而且孤立点的存在会影响时间序列的分割和时间序列模式表示,所以识别和删除时间序列中的孤立点噪声数据便成为时间序列预处理的重要工作之一。数据是否是时间序列的孤立点,关键是看它与周围数据的跳跃程度。本文以时间序列数据相对变化率作为判断其跳跃程度的标准,提出新的孤立点噪声数据识别方法。
(2)在时间序列模式相似性度量中,提出度量两个元模式相似性的加权距离法以及可以度量两个不同长度序列模式相似性的动态时间弯曲距离法。在时序关联规则的挖掘中,元模式单调距离法、元模式向量距离法度量两个元模式相似性都不适合频繁模式的获取。因此,本文针对时间序列模式的特点提出元模式的加权距离,并在此基础之上提出度量两个序列模式相似性的动态时间弯曲距离法。
(3)在时间序列时序关联规则的获取中,提出分层时序关联规则获取方法。时序关联规则的时间约束、关联规则的前、后件长度决定时序关联规则的获取。为了降低获取中的难度,只有把时序关联规则的前件分成不同的长度,由此提出分层时序关联规则的获取方法。由于频繁模式界定上的差异,这种方法有别于一般的获取方法;但也由于这种方法考虑到各种长度的关联规则前件,所以具有其他时序关联规则获取方法所不具有的优点。
(4)在度量两个时间序列的相似性时,因为已有一元时间序列相似性的度量方法忽略了时间序列是以时间为变量的函数,本文经研究论证提出度量两个一元时间序列相似性的图形相似法。同时,在多元时间序列的相似性度量中,因考虑到多元时间序列的存储结构是矩阵,本文提出度量两个多元时间序列相似性的基于矩阵范数的多元时间序列相似性度量方法和基于综合性的多元时间序列相似性度量方法。
Temporal association rules of time series are the temporal constraining association among partly changes of time series. Partly changes of time series themselves have time sequence, so time order is a characteristic of the association. Time series have the characteristics of data denseness and stochastic fluctuation, and temporal association rules of partly changes are implied in the large data set, so the rules can be obtained only through data mining.
The mining of temporal association rules of time series is a systematic engineering, which can be divided into time series data pre-processing, time series data compression, time series data similarity measure, the requirement of temporal association rules and the interpretation and evaluation of temporal association rules. The research on mining methods of temporal association rules has gained a lot, but is far from perfection. The main points are as follows.
(1) In recognizing outlier, the method based on statistics is hard to gain the sample’s distribution parameter, the method based on wavelet transform will change the authenticity of original time series, and the method based on likelihood ratio has a large amount of calculation.
(2) In mining the classical temporal association rules, the time series are discredited into sequential patterns by the sliding window with the given length and steps. The frequent pattern will be acquired and it will end up with strengthened temporal association rules. Because the length and step for the sliding window are arbitrary, there is a lot of uncertainty in the result from the time series compression.
(3) Similarity measure of time series is the base for acquiring the frequent pattern in sequential patterns, and also decides the obtainment of temporal association rules. The meta-pattern monotony distance and the meta-pattern vector distance both have some flaws in defining the meta-pattern, so the similarity measure of meta-pattern has some problems. And the existing methods of measuring series pattern’s similarity cannot measure the series pattern’s similarity of two different lengths.
Temporal association rules of time series are practical valuable, but the existing mining methods have some flaws. So, the dissertation focuses on the improvement and perfection of the mining method of temporal association rules of time series, offering the theoretical models and empirical analysis, in order to gain more reliable temporal association rules from time series and help decision-making.
The dissertation addresses the mining of temporal association rules. Aiming at the faultiness of every step, the author summarizes the existing relative research, then offers solutions and carries out empirical analysis. The dissertation can be divided into 8 chapters, the main content are as following.
(1) Time Series Data Pre-processing
Time series data pre-processing is the first step of mining temporal association rules that is how to clean the noise data in time series. In this part, the author first defines the noise data, and then sums up the existing recognition methods of outlier of time series, as well as analyzes their advantages and disadvantages. At last comes up with the recognition method of outlier of time series based on relative variance rate of time series.
(2) Time Series Data Compression
Time series data compression is the second step of mining temporal association rules, which means how to transform time series into sequential patterns. Firstly the author analyzes the necessity, objective and meaning of compressing data in mining temporal association rules. And then analyzes the existing compressing ways, and then offers estimating system to value time series data compression. After comparative analysis, chooses time series data compression method, which is in favor of mining, and finally improves the reorganization of division point.
(3) Time Series Data Similarity Measure
Similarity measure of sequential patterns is the important content of temporal association rules of time series. Only the similarity among patterns is properly measured, the acquirement of frequent patterns in sequential patterns and temporal association rules can be successfully accomplished. The existing two methods have more or less disadvantages. Because the similarity among sequential patterns comes down to two models of different length, by using the method of measuring different dimensions distance, the author puts forward dynamic time warping distance means of sequential pattern.
(4) Acquirement of Temporal Association Rules
The third step of mining temporal association rules is how to get frequent patterns from sequential patters, and then to build strengthened temporal association rules. In common temporal association rules, the objects may appear or not, and its frequency depends on the appearing times of objects and incidents. Because of the difference of time series pattern, the frequency cannot be decided by single model’s appearing times, but by the amount of similar patterns. During the process of creating temporal association rules, according to the particularity of time series patterns, the author offers the layered means of getting temporal association rules and proves it.
(5) Similarity of Time Series
The dissertation clarifies similarity of time series from two aspects. On the one hand, the dissertation studied the similarity of one-variety time series. Based on the summary of existing research on time series, the author puts forward the graphic similarity measure-to-measure similarity of time series and analyzes the method. On the other hand, the dissertation researches similarity of multivariate time series. Firstly the author analyzes the necessity of researching it, and then the difficulty in it, finally comes up with two ways to measure similarity of time series, based on matrix and synthesis attribution.
(6)Mining Flat of Temporal association rules of time series
The mining flat of temporal association rules of time series uses JAVA as exploiting languages, and has 6 modules. It has several functions, such as loading data, time series data pre-processing, time series data compression, time series data similarity measure, the requirement of temporal association rules and the interpretation and evaluation of temporal association rules, etc. The dissertation proves every improvement by empirical analysis, and also realizes to mine temporal association rules from time series.
Combining with theories of mining temporal association rules, the dissertation carries out systemic research on every step, from the first step, time series data pre-processing, to the last step, the interpretation and evaluation of temporal association rules. In every step, the author combs the existing research, tests the relative theoretical models, offers improvement and proves it. Because the mining of multivariate time series is a hot issue, the author discusses it in the last part. The innovations of the dissertation can be included as follows.
(1) In time series data pre-processing, the author puts forwards recognition method of outlier noise data based on data variance ratio. Time series usually contains noise data, which will affect the mining temporal association rules, so it should be cleaned out before mining. Because time series compression is intolerant to outlier noise data, meanwhile the existence of outlier will affect the division of time series and representation of time series patterns, so identifying and deleting the outlier in time series will be one of the important works in time series data pre-processing. Whether a datum is the outlier, depends on its vibrancy with surrounding data. The author uses data variance ratio of time series data to estimate the vibrancy, and then offers recognition of outlier noise data.
(2) In time series and similarity measure, the author comes up with Euclid distance method to measure the similarity of two meta-patterns and, and also brings forward dynamic time warping distance means to measure the similarity of two time series patterns. In mining temporal association rules, the meta-pattern monotony distance method and the meta-pattern vector distance method both are not suitable for getting frequent pattern when measuring the similarity between two meta patterns. Aiming the specialty of time series pattern, the dissertation offers weighted distance method of meta-pattern, and then comes up with dynamic time warping distance means, which can measure the similarity between two sequential patterns.
(3) In the acquirement of temporal association rules, the author puts forwards the layered means. The time restriction of temporal association rules and…of association rules determines the difficulty of acquiring temporal association rules. In order to decrease the difficulty, we can divide the beforer of temporal association rules into different length and then mine, that is so called the layered mining of temporal association rules. Because of the difference in defining the frequent patterns, the method is different from other mining ways. Meanwhile because the method considers the beforer of different length, it has the unique advantages compared with other methods
(4) When measuring the similarity between two time series, because the existing measure of one-variety time series ignores that time series is the function of time, the dissertation puts forward the graphic similarity measure. Meanwhile, in measuring similarity of multivariate time series, considering the storing way of multivariate time series is matrix, the dissertation offers two methods based on matrix norm to measure the similarity of multivariate time series and based on comprehensive attribute to measure the similarity of multivariate time series.
时间序列时序关联规则挖掘是一个系统工程,分为时间序列预处理、时间序列压缩、时间序列模式相似性度量、时间序列时序关联规则获取、解释和评价等步骤。目前关于各步骤挖掘方法的研究还不够完善,主要表现在以下方面:(1)在孤立点噪声数据的识别中,基于统计学识别法很难获得样本的分布参数,基于小波变换识别法改变了原始时间序列的真实性,基于似然比识别法的计算量较大;(2)在经典时间序列时序关联规则挖掘中,以给定长度和滑动步长的滑动窗口把时间序列离散成模式序列,然后获取频繁模式,最后生成强时序关联规则。由于滑动窗口的长度和滑动步长是由人为给定,这样时间序列的压缩结果具有很强的人为性,挖掘结果也就具有很强的不确定性;(3)时间序列模式相似性的度量是获取模式序列中频繁模式的基础,决定着时序关联规则获取。目前,元模式单调距离和元模式向量距离中对元模式表示都存在缺陷,所以元模式相似性的度量存在一定问题。而且,现有度量序列模式相似性的方法不能用距离法度量不同长度的两个序列模式的相似性。
时间序列时序关联规则具有很强的实用价值,但正如上述,目前挖掘方法却不完善。因此,本文的研究重点是时间序列时序关联规则挖掘方法的改进和完善,提出理论模型与实证分析,力求从时间序列中获取更多可靠的时序关联规则,从而为决策者提供更好的决策帮助。
本文以挖掘步骤为主线展开论述,共分八章,每章的结构安排为:首先综述国内外对本步骤所涉及的理论和研究现状,其次分析研究中存在的问题,然后提出相应的改进方法,并用实证进行分析和论证。文章主要内容包括:
(1)时间序列预处理
时间序列的预处理是时间序列时序关联规则挖掘的第一步:怎样清洗时间序列中的噪声数据。这部分首先对时间序列的噪声数据进行界定,其次综述已有时间序列孤立点噪声数据的识别方法,并且分析这些方法的优缺点,最后提出基于数据相对变化率的时间序列孤立点噪声数据的识别方法。
(2)时间序列的压缩
时间序列压缩是时间序列时序关联规则挖掘的第二步:如何把时间序列转化成模式序列。首先分析时序关联规则挖掘过程中数据压缩的必要性、目的和意义,其次综述已有时间序列压缩方法,在此基础上提出时间序列压缩方法的评价体系,并对已有压缩方法进行比较分析,然后选择有利于时序关联规则挖掘的时间序列压缩方法,最后对所选择压缩方法分割点的确定加以改进。
(3)时间序列模式相似性的度量
时间序列模式间相似性度量是时间序列时序关联规则的重要内容之一。只有很好地度量模式间的相似性,才能更好地完成模式序列中频繁模式和时序关联规则的获取。本文认为已有度量两个元模式相似性的方法存在弊端,考虑到序列模式的相似性度量涉及两个不同长度的模式,因而把度量两个不同维数的点间的距离的方法应用到序列模式相似性的度量上,提出序列模式相似性的动态时间弯曲距离度量法。
(4)时间序列时序关联规则的获取
时间序列时序关联规则挖掘的第三步:怎样从模式序列中获取频繁模式进而生成强时序关联规则。在一般时序关联规则中,对象或者事件的频繁性由其出现的次数决定。但由于时间序列模式的差异性,模式出现的次数不能决定其频繁性,而应由与其相似模式的数目决定。在时序关联规则的生成过程中,针对时间序列模式频繁性的特殊性,本文提出时序关联规则的分层获取方法,并用实证加以分析。
(5)时间序列的相似性
本文对时间序列的相似性研究从两方面展开。一方面研究一元时间序列序列的相似性。首先综述国内外关于时间序列相似性的研究,并分析存在问题,然后针对时间序列的时序性特点提出度量时间序列相似性的图形相似法,并分析该方法的优缺点;另一方面研究多元时间序列的相似性。首先分析度量多元时间序列相似性的必要性,然后分析该研究的难点所在,最后提出两种度量时间序列相似性的方法:基于矩阵范数和基于综合属性的多元时间序列的相似性度量方法。
(6)时间序列时序关联规则挖掘平台
时间序列时序关联规则挖掘平台以JAVA作为开发语言,共有六个模块,实现数据加载、时间序列的预处理、时间序列压缩、时间序列模式相似性度量、时序关联规则获取、时序关联规则评价和时间序列相似性度量等功能。一方面对各个步骤的改进方法进行实证分析,另一方面实现从时间序列中挖掘时序关联规则。
本文的研究按照时序关联规则的挖掘步骤展开,从时间序列时序关联规则的第一步时间序列预处理到最后一步时序关联规则解释与评价。在每个步骤中,对已有研究进行梳理,对所涉及的理论模型进行推导,并提出改进方法。由于时间序列相似性在时间序列数据挖掘中起到重要作用,本文专门对时间序列的相似性进行探讨。本文的主要创新点归纳为:
(1)在时序关联规则挖掘的时间序列预处理中,提出基于数据相对变化率的孤立点噪声数据识别方法。时间序列一般都含有噪声数据,其存在对时序关联规则的挖掘有很大影响,因此,在挖掘前必须去除噪声数据。但由于时间序列压缩对孤立点噪声数据不具有容忍性,而且孤立点的存在会影响时间序列的分割和时间序列模式表示,所以识别和删除时间序列中的孤立点噪声数据便成为时间序列预处理的重要工作之一。数据是否是时间序列的孤立点,关键是看它与周围数据的跳跃程度。本文以时间序列数据相对变化率作为判断其跳跃程度的标准,提出新的孤立点噪声数据识别方法。
(2)在时间序列模式相似性度量中,提出度量两个元模式相似性的加权距离法以及可以度量两个不同长度序列模式相似性的动态时间弯曲距离法。在时序关联规则的挖掘中,元模式单调距离法、元模式向量距离法度量两个元模式相似性都不适合频繁模式的获取。因此,本文针对时间序列模式的特点提出元模式的加权距离,并在此基础之上提出度量两个序列模式相似性的动态时间弯曲距离法。
(3)在时间序列时序关联规则的获取中,提出分层时序关联规则获取方法。时序关联规则的时间约束、关联规则的前、后件长度决定时序关联规则的获取。为了降低获取中的难度,只有把时序关联规则的前件分成不同的长度,由此提出分层时序关联规则的获取方法。由于频繁模式界定上的差异,这种方法有别于一般的获取方法;但也由于这种方法考虑到各种长度的关联规则前件,所以具有其他时序关联规则获取方法所不具有的优点。
(4)在度量两个时间序列的相似性时,因为已有一元时间序列相似性的度量方法忽略了时间序列是以时间为变量的函数,本文经研究论证提出度量两个一元时间序列相似性的图形相似法。同时,在多元时间序列的相似性度量中,因考虑到多元时间序列的存储结构是矩阵,本文提出度量两个多元时间序列相似性的基于矩阵范数的多元时间序列相似性度量方法和基于综合性的多元时间序列相似性度量方法。
Temporal association rules of time series are the temporal constraining association among partly changes of time series. Partly changes of time series themselves have time sequence, so time order is a characteristic of the association. Time series have the characteristics of data denseness and stochastic fluctuation, and temporal association rules of partly changes are implied in the large data set, so the rules can be obtained only through data mining.
The mining of temporal association rules of time series is a systematic engineering, which can be divided into time series data pre-processing, time series data compression, time series data similarity measure, the requirement of temporal association rules and the interpretation and evaluation of temporal association rules. The research on mining methods of temporal association rules has gained a lot, but is far from perfection. The main points are as follows.
(1) In recognizing outlier, the method based on statistics is hard to gain the sample’s distribution parameter, the method based on wavelet transform will change the authenticity of original time series, and the method based on likelihood ratio has a large amount of calculation.
(2) In mining the classical temporal association rules, the time series are discredited into sequential patterns by the sliding window with the given length and steps. The frequent pattern will be acquired and it will end up with strengthened temporal association rules. Because the length and step for the sliding window are arbitrary, there is a lot of uncertainty in the result from the time series compression.
(3) Similarity measure of time series is the base for acquiring the frequent pattern in sequential patterns, and also decides the obtainment of temporal association rules. The meta-pattern monotony distance and the meta-pattern vector distance both have some flaws in defining the meta-pattern, so the similarity measure of meta-pattern has some problems. And the existing methods of measuring series pattern’s similarity cannot measure the series pattern’s similarity of two different lengths.
Temporal association rules of time series are practical valuable, but the existing mining methods have some flaws. So, the dissertation focuses on the improvement and perfection of the mining method of temporal association rules of time series, offering the theoretical models and empirical analysis, in order to gain more reliable temporal association rules from time series and help decision-making.
The dissertation addresses the mining of temporal association rules. Aiming at the faultiness of every step, the author summarizes the existing relative research, then offers solutions and carries out empirical analysis. The dissertation can be divided into 8 chapters, the main content are as following.
(1) Time Series Data Pre-processing
Time series data pre-processing is the first step of mining temporal association rules that is how to clean the noise data in time series. In this part, the author first defines the noise data, and then sums up the existing recognition methods of outlier of time series, as well as analyzes their advantages and disadvantages. At last comes up with the recognition method of outlier of time series based on relative variance rate of time series.
(2) Time Series Data Compression
Time series data compression is the second step of mining temporal association rules, which means how to transform time series into sequential patterns. Firstly the author analyzes the necessity, objective and meaning of compressing data in mining temporal association rules. And then analyzes the existing compressing ways, and then offers estimating system to value time series data compression. After comparative analysis, chooses time series data compression method, which is in favor of mining, and finally improves the reorganization of division point.
(3) Time Series Data Similarity Measure
Similarity measure of sequential patterns is the important content of temporal association rules of time series. Only the similarity among patterns is properly measured, the acquirement of frequent patterns in sequential patterns and temporal association rules can be successfully accomplished. The existing two methods have more or less disadvantages. Because the similarity among sequential patterns comes down to two models of different length, by using the method of measuring different dimensions distance, the author puts forward dynamic time warping distance means of sequential pattern.
(4) Acquirement of Temporal Association Rules
The third step of mining temporal association rules is how to get frequent patterns from sequential patters, and then to build strengthened temporal association rules. In common temporal association rules, the objects may appear or not, and its frequency depends on the appearing times of objects and incidents. Because of the difference of time series pattern, the frequency cannot be decided by single model’s appearing times, but by the amount of similar patterns. During the process of creating temporal association rules, according to the particularity of time series patterns, the author offers the layered means of getting temporal association rules and proves it.
(5) Similarity of Time Series
The dissertation clarifies similarity of time series from two aspects. On the one hand, the dissertation studied the similarity of one-variety time series. Based on the summary of existing research on time series, the author puts forward the graphic similarity measure-to-measure similarity of time series and analyzes the method. On the other hand, the dissertation researches similarity of multivariate time series. Firstly the author analyzes the necessity of researching it, and then the difficulty in it, finally comes up with two ways to measure similarity of time series, based on matrix and synthesis attribution.
(6)Mining Flat of Temporal association rules of time series
The mining flat of temporal association rules of time series uses JAVA as exploiting languages, and has 6 modules. It has several functions, such as loading data, time series data pre-processing, time series data compression, time series data similarity measure, the requirement of temporal association rules and the interpretation and evaluation of temporal association rules, etc. The dissertation proves every improvement by empirical analysis, and also realizes to mine temporal association rules from time series.
Combining with theories of mining temporal association rules, the dissertation carries out systemic research on every step, from the first step, time series data pre-processing, to the last step, the interpretation and evaluation of temporal association rules. In every step, the author combs the existing research, tests the relative theoretical models, offers improvement and proves it. Because the mining of multivariate time series is a hot issue, the author discusses it in the last part. The innovations of the dissertation can be included as follows.
(1) In time series data pre-processing, the author puts forwards recognition method of outlier noise data based on data variance ratio. Time series usually contains noise data, which will affect the mining temporal association rules, so it should be cleaned out before mining. Because time series compression is intolerant to outlier noise data, meanwhile the existence of outlier will affect the division of time series and representation of time series patterns, so identifying and deleting the outlier in time series will be one of the important works in time series data pre-processing. Whether a datum is the outlier, depends on its vibrancy with surrounding data. The author uses data variance ratio of time series data to estimate the vibrancy, and then offers recognition of outlier noise data.
(2) In time series and similarity measure, the author comes up with Euclid distance method to measure the similarity of two meta-patterns and, and also brings forward dynamic time warping distance means to measure the similarity of two time series patterns. In mining temporal association rules, the meta-pattern monotony distance method and the meta-pattern vector distance method both are not suitable for getting frequent pattern when measuring the similarity between two meta patterns. Aiming the specialty of time series pattern, the dissertation offers weighted distance method of meta-pattern, and then comes up with dynamic time warping distance means, which can measure the similarity between two sequential patterns.
(3) In the acquirement of temporal association rules, the author puts forwards the layered means. The time restriction of temporal association rules and…of association rules determines the difficulty of acquiring temporal association rules. In order to decrease the difficulty, we can divide the beforer of temporal association rules into different length and then mine, that is so called the layered mining of temporal association rules. Because of the difference in defining the frequent patterns, the method is different from other mining ways. Meanwhile because the method considers the beforer of different length, it has the unique advantages compared with other methods
(4) When measuring the similarity between two time series, because the existing measure of one-variety time series ignores that time series is the function of time, the dissertation puts forward the graphic similarity measure. Meanwhile, in measuring similarity of multivariate time series, considering the storing way of multivariate time series is matrix, the dissertation offers two methods based on matrix norm to measure the similarity of multivariate time series and based on comprehensive attribute to measure the similarity of multivariate time series.
引文
[1] Jiawei Han,范明.数据挖掘概念与技术.机械工业出版,2001年8月第1版,149~150.
[2]田铮。时间分析的理论与方法.高等教育出版社,2001年7月第1版,22~32.
[3] Hall P. The Bootstrap and Edge worth Expansion[M].Canberra: Springer Varlag, 1992.
[4]王小宜,卢正鼎,凌贺飞.一个基于小波的时序数据异常探测新算法.计算机工程与科学,2005年第27卷第6期,Vo1.27,NO.6,2005.
[5] Agrawal R.and Srikant. R. Mining sequential patterns. In Proceedings of the Eleventh International Conference on Data Engineering (ICDE’95) 3~4.
[6]王达,荣冈.时间序列的模式距离.浙江大学学报(工学版),第38卷第7期,2004年7月.
[7]兰秋军.金融时间序列隐含模式挖掘方法及其应用研究.湖南大学工商管理学院博士学位论文,2004年10月.
[8]吕庆吉吉.两种时问序列孤立点挖掘方法的比较.统计研究,2005年第1期.
[9] Atkinson,A.C.Koopmam,A.C.and N.Shepherd(1997). Detection Shocks:Outlier and breaks in time series.Journal of Econometrics,80,387~422.
[10]王建州,杨勇.基于统计分布的小波分析对时问序列孤立点数据的识别与挖掘.西北师范大学学报(自然科学版),第40卷2004年第2期.
[11] Bamet V,Levis T.Outliers in Statistical Data[M] New York:John Wilev&Sons,1994.
[12]冯红伟.数据挖掘技术的研究及应用.西北工业大学博士论文,2004年7月.
[13]陆声链,林士敏.基于距离的孤立点检测及其应用.计算机与数字工程,第32卷(2004)第5期.
[14] Keogh E.,Fast Similarity Search in the Presence of Longitudinal Scaling in Time Series Databases. In: Proceedings of the 9th international Conference on Tools with Artificial Intelligence. [s.1.]:IEEE Press, 1997.578~584.
[15]李斌,谭立湘,章劲松,庄镇泉.面向数据挖掘的时间序列符号化方法研究.电路与系统学报,2000年6月第5卷第2期.
[16] Popibanov I., Miller R J. Similarity search over time series data using wavelets proceedings of the 18th International Conference on Data Engineering (ICDE’02), 2002.
[17]周洪宝,闵珍.基于时间序列的城市用水量预测问题的研究.[J]微计算机信息,2006,10-3:82~84.
[18] WIJSEN J.Trends in data bases: reasoning and mining [J].IEEE Transactions on knowledge and data Engineering, 2001, 13(3):426~438.
[19] Keogh, E. & Pazzani, M. (2000). A simple dimensionality reduction technique for fast similarity search in large time series databases. In Proceedings of Pacific- Asia Conf. on Knowledge Discovery and Data Mining, 122~133.
[20] Kanth, K.V., Agrawal, D., & Singh, A. (1998). Dimensionality Reduction for Similarity Searching in Dynamic Databases. In Proc. ACM SIGMOD Conf., 166~176.
[21] Park, S., Lee, D., & Chu, W. (1999). Fast retrieval of similar subsequences in long sequence databases. In 3rd IEEE Knowledge and Data Engineering Exchange Workshop.
[22] Keogh E, et al. An online algorithm for segmenting time series. Proceedings of the IEEE International Conference on Data Mining, 2001:289~296.
[23] Chen B H, et al. Application of wavelets and neural networks to diagnostic system development, 1,feature extraction. Computers Chemical Engineering, 1999, 23(7): 899~906.
[24]王达.时间序列数据挖掘研究与应用.浙江大学博士学位论文,2004年2月。
[25]喻高瞻,彭宏,胡劲松,郑启伦.时间序列的相似性的分层查询.计算机工程与应用2006.23.
[26] Keogh E, Pazzani M. An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback[C].In:Proceedings of the 4th International Conference of Knowledge Discovery and Data Mining, 1998: 239~241.
[27] Keogh E, Pazzani Michael J. An indexing scheme for fast similarity search in large time series databases[C].In: Proceedings of the 11thInternational Conference on Scientific and Statistical Database Management, 1999: 56~67.
[28]张军,陈汉武,马志民.一种时间序列相似性的快速搜索算法.南京师范大学学报(工程技术版),第5卷第3期2005年9月.
[29]李斌,谭立湘.面向数据挖掘的时间序列符号化方法研究[J].电路与系统学报,2000,4(5).
[30]范强,彭宏.一种新的多项式拟合时间序列预测方法,吉首人学学报(自然科学版),第27卷第3期,2006年5月.
[31]李爱国,覃征.大规模时间序列数据库降维及相似搜索,计算机学报,第28卷第9期,2005年9月.
[32] Chu K. K. W. Wong M. H. Fast time series searching with scaling and shifting. In: Proceedings of the 18th ACM Symposium on Principles of Database Systems, Philadelphia, PA, 1999, 237~248.
[33]李爱国,覃征.在线分割时间序列数据.软件学报Vol.15,No.11.
[34] Guralnik V, Srivastava J. Event detection from time series data. In: Proc. of the 5th ACM SIGKDD Intl Conf. on Knowledge Discovery and Data Mining. New York: ACM Press, 1999. 33~42.
[35] Qin Z, Li AG. Roost optimization segment for time series data. Journal of Xi'an Jiaotong University, 2003, 37(4):338~342.
[36] Keogh E, Kasetty S. On the need for time series data mining benchmarks: A survey and empirical demonstration. In: Proc. of the 8th ACM SIGKDD Int' l Conf. on Knowledge Discovery and Data Mining. New York: ACM Press, 2002. 102.
[37]詹艳艳,徐荣聪,陈晓云.基于斜率提取边缘点的时间序列分段线性表示方法,计算机科学2006Vol133 No.111.
[38] Prat K B, Fink E. Search for patterns in compressed time series [J ] . International Journal of Image and Graphics, 2002, 2 (1): 89~106.
[39] Yi B K, Faloust sos C. Fast Time Sequence Indexing for Arbitrary L pNorms [C] . In :Proceedings of t he 26t h International Conference on Very LargeData Bases , San Francisco : Morgan Kaufmann Publishers Inc ,2000. 385~394.
[40] TSENG FC, HSU CC. Generating frequent patterns with the frequent pattern list [A].Proceedings of the Asia Pacific Conference of Data Mining and Knowledge Discovery[C]. Hong Kong, China WILLIAMS G J, L IQ. 2001. 376~386.
[41] Z. Yu, H. Peng, and Q. L. Zheng,“Pattern distance of timeseries based on segmentation by important points,”in Proc. 4th Int. Conf. on Machine Learning and Cybemetics, Aug. 2005, pp.1563-1567.
[42] E. Keogh, and M. Pazzani, Scaling up Dynamic Time Warping for Data Mining Applications”, In: Proceedings of the 6th ACM SIGMOD International Conference on Knowledge Discovery and Data Mining, 2000, 285~289.
[43] Hansheng Lei, Venu Govindaraju.Regression Time Warping for Similarity Measure of Sequence. Proceedings of the Fourth International Conference on Computer and Information Technology (CIT’04).
[44] E.Keogh, Exact Indexing of Dynamic Time Warping. Proc. 28th Int’l Conf. Very Large Data Bases (VLDB’02), 2002.
[45] S. Kim, S. Park, and W. Chu, An Indexed-Based Approach for Similarity Search Supporting Time Warping in Large Sequence Databases, Proc. 17th Int’l Conf. Data Eng. (ICDE’01), 2001.
[46] B-K. Yi, H. Jagadish, and C. Faloutsos, Efficient Retrieval of Similar Time Sequences under Time Warping.Proc. 14th Int’l Conf. Data Eng. (ICDE’98), 1998.
[47]武红江,赵军平,彭勤科,黄永宣.基于波动特征的时间序列数据挖掘.控制与决策.第22卷第2期Vol.22 No.2.
[48]曲文龙,张德政,杨炳儒.基于小波和动态时间弯曲的时间序列相似匹配北京科技大学学报.第28卷第4期2006年4月.
[49] Berndt, D. and Clifford, J. (1994).Using dynamic time warping tp find patterns in time series.AAAI Workshop on Knowledge Discovery in Databases, PP.229~248.
[50] Aach,.J.& Church,G(2001).Alidning gene expression time series with time warping algorithms Bioinformatics.Vol,17.
[51] Kim, S.W., Park, S., & Chu, W.W. (2004). Efficient processing of similarity search under time warping in sequence databases: an index-based approach. Inf. Syst. 29(5): 405~420.
[52] Das G, L in K.I, Marmila H, et al. Rule Discovery from Time Series [A].In Proc. of the 4th Int. Conf. on Knowledge Discovery and Data Mining[C]. [S. l.] : AAA I Press, 1998. 16~22.
[53]张保稳.时间序列数据挖掘研究.西北工业大学博士学位论文,2002年3月.
[54]王亮,姜丽红.快速挖掘最大频繁模式算法.计算机工程与应用2006.17.
[55] K.B.Prat,E.Fink.Search for patterns in compressed time series[J]International Journal of Image and Graphics, 2002; 2( 1): 89~106.
[56] H. Mannila, H. Toivonen, and A.I.Verkamo. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discover, 1(3):259~289, November 1997.
[57]杨建林,邓三鸿,苏新宁.关联规则兴趣度的度量,情报学报,第22卷第4期2003年8月.
[58] A Freitas. On rule interestingness measures. Knowledge Based Systems, December 1999, 303~315.
[59] Xiao Li,Li Dong,Cheng KuiGu,Zheng Ou.Research on Shaped-based time series similarity measure. Proceedings of the Fifth International Conference on Machine Learning and Cybernetics, Dalian, 13~16 August 2006.
[60] Jingwen,Yu Jian,Yin JunZhang. Comparison of Distance Measures in Evolutionary Time Series Segmentation. Third International Conference on Natural Computation (ICNC 2007).
[61]胡晓青,王波.基于数据挖掘的金融时序频繁模式的快速发现.上海理工大学学报, Vol.28, No.4,2006.
[62] Chan K, Fu W. Efficient time series matching by wavelets[C].In: Proceedings of the 15th IEEE International Conference on Data Engineering 1999: 126~133.
[63] Keogh E, Pazzani M.An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback[C].In: Proceedings of the 4th International Conference of Knowledge discovery and Data Mining, 1998: 239~241.
[64] K Par, S Kim, W Chu.Segment - based approach for subsequence searches in sequence databases[C].In: Proc of the 16th ACM Symp on Applied Computing, 2001: 248~252.
[65] Chan K, Fu W.Efficient time series matching by wavelets[C].In: Proceedings of the 15th IEEE International Conference on Data Engineering 1999: 126～133.
[66] Keogh E,Pazzani M.An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback[C].In: Proceedings of the 4th International Conference of Knowledge iscovery and Data Mining, 1998: 239～241.
[67] K Par ,S Kim,W Chu.Segment - based approach for subsequence searches in sequence databases[C].In: Proc of the 16th ACM Symp on Applied Computing, 2001: 248～252.
[68]刘世元,江浩.关于时间序列相似性概念体系的探讨与研究.华中科技大学学报(自然科学版),第32卷第7期,2004年7月.
[69] Burrus C S, Gopinath R A, Guo H. Introduction to Wavelets and Wavelet Transform: A Primer. New Jersey, USA: Prentice Hall, 1998.
[70] Chan K P, Fu A W. Efficient time series matching by wavelets. Proceedings of the 15th IEEE International Conference on Data Engineering, 1999. 126~133.
[71] Perng C S, Wang H X, and Zhang S R, et al. Landmarks: a new model for similarity based pattern in time series databases [A]. 16th IEEE Int Conf on Data Engineering ,San Diego ,CA ,2000.
[72]陆薛妹,胡轶,方建安.基于分段极值DTW距离的时间序列相似性度量,微计算机信息,2007年第23卷第9期.
[73]杨敏,王志坚,尹燕敏.时间序列相似性搜索算法研究.山东师大学报(自然科学版),2001年12月,第16卷第4期.
[74]翁颖钧,朱仲英.基于分段线性动态时间弯曲的时间序列聚类算法研究.研究与设计,微型电脑应用,2003年第19卷第9期.
[75] D. J. Berndt, J. Clifford. Finding patterns in time series: DB, 2000.A dynamic programming approach. In Advances in Knowledge Discovery and Data Mining, 1996.
[76] J. Berndt, D. & Clifford. Using dynamic time warping to find patterns in time series. AAAI-94 Workshop on Knowledge Discovery in Database, 1994, 229~248.
[77]肖辉,胡运发.基于分段时间弯曲距离的时间序列挖掘[J].计算机研究与发展,2005,42(1):72~78.
[78]Agrawal R, Srikant R. Mining sequential patterns [A]. Proc. Int. Conf. Data Engineering (ICDE’95) [C] Taipei, Taiwan, Mar. 1995: 3~14.
[79] Agrawal R, Faloutsos C, Swami A. Efficient similarity search in sequence databases [A]. Proc. 4th Int. Conf Foundations of Data Organizations and Algorithm s(FODO) [C ]. Chicago, Illinois,Oct. 1993: 69~84.
[80]李爱国,覃征,贺升平.时间序列数据的相似模式抽取[J].西安交通大学学报,2002,36(12):1275~1278.
[81]兰秋军,马超群.时序相似度的主观偏好模型及其系数估计的“锚点”方法,系统工程.第24卷第9期(总第153期)2006年9月.
[82] Kantz H, Schreiber T. Nonlinear Time Series Analysis. Cambridge: Cambridge University Press, 1997.
[83] Guralnik V, Srivastava J. Event detection from timeDiscovery and Data Minine. New York: ACM Press, series data. In: Proc. of the 5th ACM SIGKDD Int' l Conf. on Knowledge 1999.33~42.
[84] Firoiu L. Segmenting Artificial Intelligence time series with a hybrid neural networks-hidden markov model. In: Proc. of the 18th National Conf. on (AAAI). Memo Park: AAAI Press, 2002. 247~252.
[85]赵晓丹,张波.离散傅立叶变换误差对声强测量技术的影响.噪声与振动控制2007年12月第6期.
[86] Peter Kraniauskas.Transforms on Signals and systems [M]. The Great Britain, William Clowes Ltd, Beccles, Suffolk, 1992.
[87]郑君里,杨为里,应启珩.信号与系统[M].北京:高等教育出版社,2000.
[88]魏莲.变换域时间序列相似性搜索.河北理工学院学报,第26卷第4期,2004年11月.
[89]郑诚,蔡庆生.基于小波分析的时间序列数据挖掘模型.计算机工程与应用,2004,30.
[90]张军.一种时间序列相似性的快速搜索算法.南京师范大学学报,第5卷第3期2005年9月.
[91] Xia B B. Similarity search in time series data sets [Master dissertation]. SimonFraser University, Canada, 1997.
[92]董晓莉,顾成奎,王正欧.基于形态的时间序列相似性度量研究.电子与信息学报,第29卷第5期,2007年5月.
[93] Jiang Li, M. Narayanan,A Shape-Based Approach to Change Detection of Lakes Using Time Series Remote Sensing Images. IEEE Transactions on Geo-science and Remote sensing, VOL. 41, NO. 11, NOV. 2003.
[94]曾凡仔,岳建海,裘正定.基于形状的时间序列相似性度量及模式发现算法.信息处理,第20卷第6期,2004年12月.
[95] Peng Changshing, Wang Haixun, Zhang Sylvia R, Parker D Stott. Landmarks: A New Model for Similarity - Based Pattern Querying in Time Series Databases. Feb: Proc 16th IEEE Int’l Conf on Data Engineering, 2000. 675~693.
[96]汤胤.时间序列相似性分析方法研究,计算机工程与应用2006.01.
[97] KiyoungYang, CyrusShahabi. A Multilevel Distance-based Index Structure for Multivariate Time Series. IEEE Transactions on Knowledge and Data Engineering, Vol. 15, No. 8, September 2005.
[98]朱建平.数据挖掘的统计方法及实践.中国统计出版社.2005年10月: 95~98A.
[99] KiyoungYang, CyrusShahabi. A PCA ?based Similarity Measure for Multivariate Time Series. IEEE Transactions on Knowledge and Data Engineering, Vol. 17, No. 9, September 2005.
[100]周勇,林珣.多元时间序列的相似性及其应用.统计与决策,2007年第6期.
[2]田铮。时间分析的理论与方法.高等教育出版社,2001年7月第1版,22~32.
[3] Hall P. The Bootstrap and Edge worth Expansion[M].Canberra: Springer Varlag, 1992.
[4]王小宜,卢正鼎,凌贺飞.一个基于小波的时序数据异常探测新算法.计算机工程与科学,2005年第27卷第6期,Vo1.27,NO.6,2005.
[5] Agrawal R.and Srikant. R. Mining sequential patterns. In Proceedings of the Eleventh International Conference on Data Engineering (ICDE’95) 3~4.
[6]王达,荣冈.时间序列的模式距离.浙江大学学报(工学版),第38卷第7期,2004年7月.
[7]兰秋军.金融时间序列隐含模式挖掘方法及其应用研究.湖南大学工商管理学院博士学位论文,2004年10月.
[8]吕庆吉吉.两种时问序列孤立点挖掘方法的比较.统计研究,2005年第1期.
[9] Atkinson,A.C.Koopmam,A.C.and N.Shepherd(1997). Detection Shocks:Outlier and breaks in time series.Journal of Econometrics,80,387~422.
[10]王建州,杨勇.基于统计分布的小波分析对时问序列孤立点数据的识别与挖掘.西北师范大学学报(自然科学版),第40卷2004年第2期.
[11] Bamet V,Levis T.Outliers in Statistical Data[M] New York:John Wilev&Sons,1994.
[12]冯红伟.数据挖掘技术的研究及应用.西北工业大学博士论文,2004年7月.
[13]陆声链,林士敏.基于距离的孤立点检测及其应用.计算机与数字工程,第32卷(2004)第5期.
[14] Keogh E.,Fast Similarity Search in the Presence of Longitudinal Scaling in Time Series Databases. In: Proceedings of the 9th international Conference on Tools with Artificial Intelligence. [s.1.]:IEEE Press, 1997.578~584.
[15]李斌,谭立湘,章劲松,庄镇泉.面向数据挖掘的时间序列符号化方法研究.电路与系统学报,2000年6月第5卷第2期.
[16] Popibanov I., Miller R J. Similarity search over time series data using wavelets proceedings of the 18th International Conference on Data Engineering (ICDE’02), 2002.
[17]周洪宝,闵珍.基于时间序列的城市用水量预测问题的研究.[J]微计算机信息,2006,10-3:82~84.
[18] WIJSEN J.Trends in data bases: reasoning and mining [J].IEEE Transactions on knowledge and data Engineering, 2001, 13(3):426~438.
[19] Keogh, E. & Pazzani, M. (2000). A simple dimensionality reduction technique for fast similarity search in large time series databases. In Proceedings of Pacific- Asia Conf. on Knowledge Discovery and Data Mining, 122~133.
[20] Kanth, K.V., Agrawal, D., & Singh, A. (1998). Dimensionality Reduction for Similarity Searching in Dynamic Databases. In Proc. ACM SIGMOD Conf., 166~176.
[21] Park, S., Lee, D., & Chu, W. (1999). Fast retrieval of similar subsequences in long sequence databases. In 3rd IEEE Knowledge and Data Engineering Exchange Workshop.
[22] Keogh E, et al. An online algorithm for segmenting time series. Proceedings of the IEEE International Conference on Data Mining, 2001:289~296.
[23] Chen B H, et al. Application of wavelets and neural networks to diagnostic system development, 1,feature extraction. Computers Chemical Engineering, 1999, 23(7): 899~906.
[24]王达.时间序列数据挖掘研究与应用.浙江大学博士学位论文,2004年2月。
[25]喻高瞻,彭宏,胡劲松,郑启伦.时间序列的相似性的分层查询.计算机工程与应用2006.23.
[26] Keogh E, Pazzani M. An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback[C].In:Proceedings of the 4th International Conference of Knowledge Discovery and Data Mining, 1998: 239~241.
[27] Keogh E, Pazzani Michael J. An indexing scheme for fast similarity search in large time series databases[C].In: Proceedings of the 11thInternational Conference on Scientific and Statistical Database Management, 1999: 56~67.
[28]张军,陈汉武,马志民.一种时间序列相似性的快速搜索算法.南京师范大学学报(工程技术版),第5卷第3期2005年9月.
[29]李斌,谭立湘.面向数据挖掘的时间序列符号化方法研究[J].电路与系统学报,2000,4(5).
[30]范强,彭宏.一种新的多项式拟合时间序列预测方法,吉首人学学报(自然科学版),第27卷第3期,2006年5月.
[31]李爱国,覃征.大规模时间序列数据库降维及相似搜索,计算机学报,第28卷第9期,2005年9月.
[32] Chu K. K. W. Wong M. H. Fast time series searching with scaling and shifting. In: Proceedings of the 18th ACM Symposium on Principles of Database Systems, Philadelphia, PA, 1999, 237~248.
[33]李爱国,覃征.在线分割时间序列数据.软件学报Vol.15,No.11.
[34] Guralnik V, Srivastava J. Event detection from time series data. In: Proc. of the 5th ACM SIGKDD Intl Conf. on Knowledge Discovery and Data Mining. New York: ACM Press, 1999. 33~42.
[35] Qin Z, Li AG. Roost optimization segment for time series data. Journal of Xi'an Jiaotong University, 2003, 37(4):338~342.
[36] Keogh E, Kasetty S. On the need for time series data mining benchmarks: A survey and empirical demonstration. In: Proc. of the 8th ACM SIGKDD Int' l Conf. on Knowledge Discovery and Data Mining. New York: ACM Press, 2002. 102.
[37]詹艳艳,徐荣聪,陈晓云.基于斜率提取边缘点的时间序列分段线性表示方法,计算机科学2006Vol133 No.111.
[38] Prat K B, Fink E. Search for patterns in compressed time series [J ] . International Journal of Image and Graphics, 2002, 2 (1): 89~106.
[39] Yi B K, Faloust sos C. Fast Time Sequence Indexing for Arbitrary L pNorms [C] . In :Proceedings of t he 26t h International Conference on Very LargeData Bases , San Francisco : Morgan Kaufmann Publishers Inc ,2000. 385~394.
[40] TSENG FC, HSU CC. Generating frequent patterns with the frequent pattern list [A].Proceedings of the Asia Pacific Conference of Data Mining and Knowledge Discovery[C]. Hong Kong, China WILLIAMS G J, L IQ. 2001. 376~386.
[41] Z. Yu, H. Peng, and Q. L. Zheng,“Pattern distance of timeseries based on segmentation by important points,”in Proc. 4th Int. Conf. on Machine Learning and Cybemetics, Aug. 2005, pp.1563-1567.
[42] E. Keogh, and M. Pazzani, Scaling up Dynamic Time Warping for Data Mining Applications”, In: Proceedings of the 6th ACM SIGMOD International Conference on Knowledge Discovery and Data Mining, 2000, 285~289.
[43] Hansheng Lei, Venu Govindaraju.Regression Time Warping for Similarity Measure of Sequence. Proceedings of the Fourth International Conference on Computer and Information Technology (CIT’04).
[44] E.Keogh, Exact Indexing of Dynamic Time Warping. Proc. 28th Int’l Conf. Very Large Data Bases (VLDB’02), 2002.
[45] S. Kim, S. Park, and W. Chu, An Indexed-Based Approach for Similarity Search Supporting Time Warping in Large Sequence Databases, Proc. 17th Int’l Conf. Data Eng. (ICDE’01), 2001.
[46] B-K. Yi, H. Jagadish, and C. Faloutsos, Efficient Retrieval of Similar Time Sequences under Time Warping.Proc. 14th Int’l Conf. Data Eng. (ICDE’98), 1998.
[47]武红江,赵军平,彭勤科,黄永宣.基于波动特征的时间序列数据挖掘.控制与决策.第22卷第2期Vol.22 No.2.
[48]曲文龙,张德政,杨炳儒.基于小波和动态时间弯曲的时间序列相似匹配北京科技大学学报.第28卷第4期2006年4月.
[49] Berndt, D. and Clifford, J. (1994).Using dynamic time warping tp find patterns in time series.AAAI Workshop on Knowledge Discovery in Databases, PP.229~248.
[50] Aach,.J.& Church,G(2001).Alidning gene expression time series with time warping algorithms Bioinformatics.Vol,17.
[51] Kim, S.W., Park, S., & Chu, W.W. (2004). Efficient processing of similarity search under time warping in sequence databases: an index-based approach. Inf. Syst. 29(5): 405~420.
[52] Das G, L in K.I, Marmila H, et al. Rule Discovery from Time Series [A].In Proc. of the 4th Int. Conf. on Knowledge Discovery and Data Mining[C]. [S. l.] : AAA I Press, 1998. 16~22.
[53]张保稳.时间序列数据挖掘研究.西北工业大学博士学位论文,2002年3月.
[54]王亮,姜丽红.快速挖掘最大频繁模式算法.计算机工程与应用2006.17.
[55] K.B.Prat,E.Fink.Search for patterns in compressed time series[J]International Journal of Image and Graphics, 2002; 2( 1): 89~106.
[56] H. Mannila, H. Toivonen, and A.I.Verkamo. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discover, 1(3):259~289, November 1997.
[57]杨建林,邓三鸿,苏新宁.关联规则兴趣度的度量,情报学报,第22卷第4期2003年8月.
[58] A Freitas. On rule interestingness measures. Knowledge Based Systems, December 1999, 303~315.
[59] Xiao Li,Li Dong,Cheng KuiGu,Zheng Ou.Research on Shaped-based time series similarity measure. Proceedings of the Fifth International Conference on Machine Learning and Cybernetics, Dalian, 13~16 August 2006.
[60] Jingwen,Yu Jian,Yin JunZhang. Comparison of Distance Measures in Evolutionary Time Series Segmentation. Third International Conference on Natural Computation (ICNC 2007).
[61]胡晓青,王波.基于数据挖掘的金融时序频繁模式的快速发现.上海理工大学学报, Vol.28, No.4,2006.
[62] Chan K, Fu W. Efficient time series matching by wavelets[C].In: Proceedings of the 15th IEEE International Conference on Data Engineering 1999: 126~133.
[63] Keogh E, Pazzani M.An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback[C].In: Proceedings of the 4th International Conference of Knowledge discovery and Data Mining, 1998: 239~241.
[64] K Par, S Kim, W Chu.Segment - based approach for subsequence searches in sequence databases[C].In: Proc of the 16th ACM Symp on Applied Computing, 2001: 248~252.
[65] Chan K, Fu W.Efficient time series matching by wavelets[C].In: Proceedings of the 15th IEEE International Conference on Data Engineering 1999: 126～133.
[66] Keogh E,Pazzani M.An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback[C].In: Proceedings of the 4th International Conference of Knowledge iscovery and Data Mining, 1998: 239～241.
[67] K Par ,S Kim,W Chu.Segment - based approach for subsequence searches in sequence databases[C].In: Proc of the 16th ACM Symp on Applied Computing, 2001: 248～252.
[68]刘世元,江浩.关于时间序列相似性概念体系的探讨与研究.华中科技大学学报(自然科学版),第32卷第7期,2004年7月.
[69] Burrus C S, Gopinath R A, Guo H. Introduction to Wavelets and Wavelet Transform: A Primer. New Jersey, USA: Prentice Hall, 1998.
[70] Chan K P, Fu A W. Efficient time series matching by wavelets. Proceedings of the 15th IEEE International Conference on Data Engineering, 1999. 126~133.
[71] Perng C S, Wang H X, and Zhang S R, et al. Landmarks: a new model for similarity based pattern in time series databases [A]. 16th IEEE Int Conf on Data Engineering ,San Diego ,CA ,2000.
[72]陆薛妹,胡轶,方建安.基于分段极值DTW距离的时间序列相似性度量,微计算机信息,2007年第23卷第9期.
[73]杨敏,王志坚,尹燕敏.时间序列相似性搜索算法研究.山东师大学报(自然科学版),2001年12月,第16卷第4期.
[74]翁颖钧,朱仲英.基于分段线性动态时间弯曲的时间序列聚类算法研究.研究与设计,微型电脑应用,2003年第19卷第9期.
[75] D. J. Berndt, J. Clifford. Finding patterns in time series: DB, 2000.A dynamic programming approach. In Advances in Knowledge Discovery and Data Mining, 1996.
[76] J. Berndt, D. & Clifford. Using dynamic time warping to find patterns in time series. AAAI-94 Workshop on Knowledge Discovery in Database, 1994, 229~248.
[77]肖辉,胡运发.基于分段时间弯曲距离的时间序列挖掘[J].计算机研究与发展,2005,42(1):72~78.
[78]Agrawal R, Srikant R. Mining sequential patterns [A]. Proc. Int. Conf. Data Engineering (ICDE’95) [C] Taipei, Taiwan, Mar. 1995: 3~14.
[79] Agrawal R, Faloutsos C, Swami A. Efficient similarity search in sequence databases [A]. Proc. 4th Int. Conf Foundations of Data Organizations and Algorithm s(FODO) [C ]. Chicago, Illinois,Oct. 1993: 69~84.
[80]李爱国,覃征,贺升平.时间序列数据的相似模式抽取[J].西安交通大学学报,2002,36(12):1275~1278.
[81]兰秋军,马超群.时序相似度的主观偏好模型及其系数估计的“锚点”方法,系统工程.第24卷第9期(总第153期)2006年9月.
[82] Kantz H, Schreiber T. Nonlinear Time Series Analysis. Cambridge: Cambridge University Press, 1997.
[83] Guralnik V, Srivastava J. Event detection from timeDiscovery and Data Minine. New York: ACM Press, series data. In: Proc. of the 5th ACM SIGKDD Int' l Conf. on Knowledge 1999.33~42.
[84] Firoiu L. Segmenting Artificial Intelligence time series with a hybrid neural networks-hidden markov model. In: Proc. of the 18th National Conf. on (AAAI). Memo Park: AAAI Press, 2002. 247~252.
[85]赵晓丹,张波.离散傅立叶变换误差对声强测量技术的影响.噪声与振动控制2007年12月第6期.
[86] Peter Kraniauskas.Transforms on Signals and systems [M]. The Great Britain, William Clowes Ltd, Beccles, Suffolk, 1992.
[87]郑君里,杨为里,应启珩.信号与系统[M].北京:高等教育出版社,2000.
[88]魏莲.变换域时间序列相似性搜索.河北理工学院学报,第26卷第4期,2004年11月.
[89]郑诚,蔡庆生.基于小波分析的时间序列数据挖掘模型.计算机工程与应用,2004,30.
[90]张军.一种时间序列相似性的快速搜索算法.南京师范大学学报,第5卷第3期2005年9月.
[91] Xia B B. Similarity search in time series data sets [Master dissertation]. SimonFraser University, Canada, 1997.
[92]董晓莉,顾成奎,王正欧.基于形态的时间序列相似性度量研究.电子与信息学报,第29卷第5期,2007年5月.
[93] Jiang Li, M. Narayanan,A Shape-Based Approach to Change Detection of Lakes Using Time Series Remote Sensing Images. IEEE Transactions on Geo-science and Remote sensing, VOL. 41, NO. 11, NOV. 2003.
[94]曾凡仔,岳建海,裘正定.基于形状的时间序列相似性度量及模式发现算法.信息处理,第20卷第6期,2004年12月.
[95] Peng Changshing, Wang Haixun, Zhang Sylvia R, Parker D Stott. Landmarks: A New Model for Similarity - Based Pattern Querying in Time Series Databases. Feb: Proc 16th IEEE Int’l Conf on Data Engineering, 2000. 675~693.
[96]汤胤.时间序列相似性分析方法研究,计算机工程与应用2006.01.
[97] KiyoungYang, CyrusShahabi. A Multilevel Distance-based Index Structure for Multivariate Time Series. IEEE Transactions on Knowledge and Data Engineering, Vol. 15, No. 8, September 2005.
[98]朱建平.数据挖掘的统计方法及实践.中国统计出版社.2005年10月: 95~98A.
[99] KiyoungYang, CyrusShahabi. A PCA ?based Similarity Measure for Multivariate Time Series. IEEE Transactions on Knowledge and Data Engineering, Vol. 17, No. 9, September 2005.
[100]周勇,林珣.多元时间序列的相似性及其应用.统计与决策,2007年第6期.