On Reducing Search Space in Discovering During Relationships

摘要：

Recent years have witnessed increasing effort in discovering interesting patterns from temporal databases, such as A after B, A during B, and so on. This paper focuses on during relationship, which is commonly encountered and important in the realworld applications. In line with the course of thinking of a previous approach (i.e., the DTP algorithm), this paper is aimed at addressing one critical issue of efficiency, namely the search space reduction, in discovering during relationships from large temporal databases. In doing so, a new approach, the C-DTP algorithm in that two operators are introduced to cut down the search space effectively. Data experiments with synthetic and real-world datasets show that the C-DTP algorithm outperforms the DTP algorithm significantly.

关键词： Temporal pattern During relationship Data mining

作者: Guoqing CHEN Li ZHANG

作者单位: School of Economic and Management,Tsinghua University,100084,Beijing,P.R.China

会议类型: 国际会议

会议名称: 工业工程与系统管理2007年国际会议(International Conference on Industrial Engineering and Systems Management)(IESM 2007)

会议地点: 北京

会议语种:英文

在线出版日期: 2007-05-30（万方平台首次上网日期，不代表论文的发表时间）