Timed Sequential Pattern Mining Based on Confidence in Accumulated Intervals

淡江大學機構典藏 > 商管學院 > 資訊管理學系暨研究所 > 會議論文 > Item 987654321/99535

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/99535

题名:	Timed Sequential Pattern Mining Based on Confidence in Accumulated Intervals
作者:	Jou, Chichang;Shyur, Huan-Jyh;Yen, Chih-Yu
贡献者:	淡江大學資訊管理學系
关键词:	timed sequential pattern mining;accumulated interval;PrefixSpan
日期:	2014-08-15
上传时间:	2014-11-20 12:59:19 (UTC+8)
出版者:	IEEE
摘要:	Many applications of sequential patterns require a guarantee of a particular event happening within a period of time. We propose CAI-PrefixSpan, a new data mining algorithm to obtain confident timed sequential patterns from sequential databases. Based on PrefixSpan, it takes advantage of the pattern-growth approach. After a particular event sequence, it would first calculate the confidence level regarding the eventual occurrence of a particular event. For those pass the minimal confidence requirement, it then computes the minimal time interval that satisfies the support requirement. It then generates corresponding projected databases, and applies itself recursively on the projected databases. With the timing information, it obtains fewer but more confident sequential patterns. CAI-PrefixSpan is implemented along with PrefixSpan. They are compared in terms of numbers of patterns obtained and execution efficiency. Our effectiveness and performance study shows that CAI-PrefixSpan is a valuable and efficient approach in obtaining timed sequential patterns.
關聯:	Proceedings of the 15th International Conference on Information Reuse and Integration
显示于类别:	[資訊管理學系暨研究所] 會議論文

文件中的档案:

档案	描述	大小	格式	浏览次数
IRI-2014-submitted.pdf		220Kb	Adobe PDF	413	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章

数据加载中.....