An integrated sequential patterns mining with fuzzy time-intervals

Chung-I Chang, H. Chueh, Yu-Chun Luo
{"title":"An integrated sequential patterns mining with fuzzy time-intervals","authors":"Chung-I Chang, H. Chueh, Yu-Chun Luo","doi":"10.1109/ICSAI.2012.6223511","DOIUrl":null,"url":null,"abstract":"One important issue in the sequential pattern mining is to discover frequent sequential patterns in a sequence database. The order of times is the focus of the previous works. However, there is seldom discussion on the time interval between successive items in patterns before. With the time interval to make decision, sequential pattern is better than which with the order of items. In this paper, we propose an algorithm called integrated sequential pattern mining with fuzzy time intervals (ISPFTI). The main idea of ISPFTI algorithm is to use the a priori-like method to mine the frequent sequential patterns of sequence database and use fuzzy theory to mine the time interval between frequent sequences. Firstly, find the candidate sequential patterns. Then, the frequent sequential patterns are found with the minimum fuzzy support. In the step of finding frequent sequential patterns, use the fuzzy number to find each time cluster by computing its fuzzy support. And the results are the frequent fuzzy time sequential patterns. Finally, the experimental result verifies that result of our proposed ISPFTI algorithm performs the excellence of which only with the fuzzy sequential patterns mining or fixed time interval.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"685 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Systems and Informatics (ICSAI2012)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSAI.2012.6223511","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

One important issue in the sequential pattern mining is to discover frequent sequential patterns in a sequence database. The order of times is the focus of the previous works. However, there is seldom discussion on the time interval between successive items in patterns before. With the time interval to make decision, sequential pattern is better than which with the order of items. In this paper, we propose an algorithm called integrated sequential pattern mining with fuzzy time intervals (ISPFTI). The main idea of ISPFTI algorithm is to use the a priori-like method to mine the frequent sequential patterns of sequence database and use fuzzy theory to mine the time interval between frequent sequences. Firstly, find the candidate sequential patterns. Then, the frequent sequential patterns are found with the minimum fuzzy support. In the step of finding frequent sequential patterns, use the fuzzy number to find each time cluster by computing its fuzzy support. And the results are the frequent fuzzy time sequential patterns. Finally, the experimental result verifies that result of our proposed ISPFTI algorithm performs the excellence of which only with the fuzzy sequential patterns mining or fixed time interval.
基于模糊时间区间的集成序列模式挖掘
序列模式挖掘中的一个重要问题是在序列数据库中发现频繁的序列模式。时间的顺序是前几部作品的焦点。然而,以往对模式中连续项之间的时间间隔却鲜有讨论。在进行决策的时间间隔上,顺序模式优于项目顺序模式。本文提出了一种基于模糊时间区间的集成顺序模式挖掘算法(ISPFTI)。ISPFTI算法的主要思想是利用类优先级方法挖掘序列数据库中的频繁序列模式,并利用模糊理论挖掘频繁序列之间的时间间隔。首先,找出候选序列模式。然后,利用最小模糊支持度找到频繁序列模式。在寻找频繁序列模式的步骤中,利用模糊数通过计算其模糊支持度来找到每个时间聚类。结果是频繁的模糊时间序列模式。最后,实验结果验证了所提出的ISPFTI算法在模糊序列模式挖掘和固定时间间隔挖掘方面的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信