共查询到18条相似文献,搜索用时 125 毫秒
1.
时态数据库中数值型属性(项)的周期规律挖掘已经得到了研究,提出的方法能够计算时态数据库中某个非数值型属性的周期,并通过执行改造了的Apriori算法挖掘该属性的周期规律,与此同时,算法也能够提取时态数据库中其他属性的带时态信息的关联规则.提出的方法通过选取两个时间粒度,对时态数据库中的时间属性进行了两次划分和标记.通过划分和标记计算选出的某非数值型属性的周期;并用标记集合代替原时间区间,进行标记集合求交,根据求交的结果得到带时态信息的频繁项集.通过时间区间标记集合求交得到频繁项集的方法是一个特色.算法的这一特色使得Apriori算法的迭代过程迅速收敛,提高算法执行效率. 相似文献
2.
3.
4.
传统关联规则挖掘是在整个事务数据库的时间范围内进行的,但有时用户想得到某一特定时间范围(如商品的促销阶段)内的关联规则,该文对这一问题进行了详细讨论,提出了基于定制时间的时态支持度、时态频繁项集、时态置信度、时态关联规则等概念,在传统Apriori算法的基础上提出了挖掘时态频繁项集的算法。另一方面,讨论了当同时考虑正、负关联规则出现的矛盾规则问题以及用相关性解决这一问题的方法,提出了挖掘正负时态关联规则的算法,实例说明了算法的执行过程及有效性。 相似文献
5.
6.
挖掘时态关联规则的目的是为了发现带有时态信息的项集之间有趣的关系.由于数据库经常动态更新,时态关联规则的挖掘也应该适应数据库的更新.然而,现有的大多数算法不仅需要重新挖掘更新的数据库,浪费了大量的时间和效率,而且不能利用已存在的规则定量地预测某些项的变化趋势.本文提出了一个基于多维时态关联规则的演化模糊推理预测建模算法(Evolving fuzzy inference model based on multidimensional temporal association rules,EFI-MTAR),主要优势是构建了一种基于多维时态关联规则的模糊推理建模算法(Fuzzy inference modeling algorithm based on multidimensional temporal association rules,FI-MTAR),实现了对时间序列的定量预测.此外,为了降低规则更新的代价和加快规则预测的速度,提出了概念漂移检测策略来处理时间序列数据以适应数据库的动态更新.实验结果表明了本文提出算法的有效性和准确性. 相似文献
7.
8.
在多维时态近似周期模型的基础上,提出了一种基于时态数据库技术和层次聚类技术的多维时态近似周期挖掘算法,并应用于股票数据.实验表明此算法是有效的. 相似文献
9.
在多维时态近似周期模型的基础上,提出了一种基于时态数据库技术和层次聚类技术的多维时态近似周期挖掘算法,并应用于股票数据。实验表明此算法是有效的。 相似文献
10.
时态信息是管理决策中的重要支持信息,需求的不同造就了时态信息不同的表示方法.随着数据库与信息技术的深入发展,越来越需要简单高效的时态数据模型以方便时态信息的表示与处理.介绍了BCDM模型及其时态表示思想,讨论了模型中事务时间和有效时间表示在查询优化时存在的问题,提出了一种基于BCDM的时态信息简化方法,不但能够有效的保存数据库现有的时态信息,而且能够大大简化有效时间的表示,为时态数据的查询优化奠定了良好基础. 相似文献
11.
12.
Lucia Sacchi Cristiana Larizza Carlo Combi Riccardo Bellazzi 《Data mining and knowledge discovery》2007,15(2):217-247
A large volume of research in temporal data mining is focusing on discovering temporal rules from time-stamped data. The majority
of the methods proposed so far have been mainly devoted to the mining of temporal rules which describe relationships between
data sequences or instantaneous events and do not consider the presence of complex temporal patterns into the dataset. Such
complex patterns, such as trends or up and down behaviors, are often very interesting for the users. In this paper we propose
a new kind of temporal association rule and the related extraction algorithm; the learned rules involve complex temporal patterns
in both their antecedent and consequent. Within our proposed approach, the user defines a set of complex patterns of interest
that constitute the basis for the construction of the temporal rule; such complex patterns are represented and retrieved in
the data through the formalism of knowledge-based Temporal Abstractions. An Apriori-like algorithm looks then for meaningful
temporal relationships (in particular, precedence temporal relationships) among the complex patterns of interest. The paper
presents the results obtained by the rule extraction algorithm on a simulated dataset and on two different datasets related
to biomedical applications: the first one concerns the analysis of time series coming from the monitoring of different clinical
variables during hemodialysis sessions, while the other one deals with the biological problem of inferring relationships between
genes from DNA microarray data. 相似文献
13.
阐述在数据挖掘领域中的四种常用的数据挖掘技术方法,以数据挖掘技术中的关联规则挖掘为基础,阐述关联规则挖掘的经典算法Apriori算法的基本思想。通过关联规则挖掘算法实验给出该算法的具体使用方法,总结该算法存在的不足。 相似文献
14.
Yong Joon Lee Author Vitae 《Journal of Systems and Software》2009,82(1):155-167
Temporal data mining is still one of important research topic since there are application areas that need knowledge from temporal data such as sequential patterns, similar time sequences, cyclic and temporal association rules, and so on. Although there are many studies for temporal data mining, they do not deal with discovering knowledge from temporal interval data such as patient histories, purchaser histories, and web logs etc. We propose a new temporal data mining technique that can extract temporal interval relation rules from temporal interval data by using Allen’s theory: a preprocessing algorithm designed for the generalization of temporal interval data and a temporal relation algorithm for mining temporal relation rules from the generalized temporal interval data. This technique can provide more useful knowledge in comparison with conventional data mining techniques. 相似文献
15.
Yoo Jin Soung Shekhar Shashi 《Knowledge and Data Engineering, IEEE Transactions on》2009,21(8):1147-1161
Given a time stamped transaction database and a user-defined reference sequence of interest over time, similarity-profiled temporal association mining discovers all associated item sets whose prevalence variations over time are similar to the reference sequence. The similar temporal association patterns can reveal interesting relationships of data items which co-occur with a particular event over time. Most works in temporal association mining have focused on capturing special temporal regulation patterns such as cyclic patterns and calendar scheme-based patterns. However, our model is flexible in representing interesting temporal patterns using a user-defined reference sequence. The dissimilarity degree of the sequence of support values of an item set to the reference sequence is used to capture how well its temporal prevalence variation matches the reference pattern. By exploiting interesting properties such as an envelope of support time sequence and a lower bounding distance for early pruning candidate item sets, we develop an algorithm for effectively mining similarity-profiled temporal association patterns. We prove the algorithm is correct and complete in the mining results and provide the computational analysis. Experimental results on real data as well as synthetic data show that the proposed algorithm is more efficient than a sequential method using a traditional support-pruning scheme. 相似文献
16.
基于Unix系统调用的数据挖掘算法 总被引:1,自引:0,他引:1
将数据挖掘方法应用于入侵检测中研究的一个重要方向是,对Unix环境下特定程序运用关联、序列等数据挖掘算法该文简单描述了目前比较成熟的几种算法思想,重点介绍了RIPPER分类算法,并提出了一些改进思想。 相似文献
17.