Fuzzy sequential pattern mining with sliding window constraint

F. Zabihi, M. Ramezan, M. Ramezan, A. Memariani
{"title":"Fuzzy sequential pattern mining with sliding window constraint","authors":"F. Zabihi, M. Ramezan, M. Ramezan, A. Memariani","doi":"10.1109/ICETC.2010.5530044","DOIUrl":null,"url":null,"abstract":"Sequential pattern mining is to discover all subsequences that are frequent. The classical sequential pattern mining algorithms do not allow processing of numerical data and require preprocessing of these data into a binary representation, which necessarily leads to a loss of information. Fuzzy sets are used to overcome this problem. In present fuzzy sequential pattern mining algorithms, there isn't any matter of itemset time and sequences are only found based on sequence of happening. In this paper, a novel fuzzy sequential pattern algorithm is proposed with sliding window constraint which permits elements of a pattern to span a set of transactions within a user-specified window. Therefore, loss of useful sequences is prevented in the search process. The proposed algorithm searches for a goal sequence within the defined fuzzy sliding window and the membership degree of sliding window is returned if the goal sequence is found.","PeriodicalId":299461,"journal":{"name":"2010 2nd International Conference on Education Technology and Computer","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 2nd International Conference on Education Technology and Computer","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICETC.2010.5530044","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Sequential pattern mining is to discover all subsequences that are frequent. The classical sequential pattern mining algorithms do not allow processing of numerical data and require preprocessing of these data into a binary representation, which necessarily leads to a loss of information. Fuzzy sets are used to overcome this problem. In present fuzzy sequential pattern mining algorithms, there isn't any matter of itemset time and sequences are only found based on sequence of happening. In this paper, a novel fuzzy sequential pattern algorithm is proposed with sliding window constraint which permits elements of a pattern to span a set of transactions within a user-specified window. Therefore, loss of useful sequences is prevented in the search process. The proposed algorithm searches for a goal sequence within the defined fuzzy sliding window and the membership degree of sliding window is returned if the goal sequence is found.
基于滑动窗口约束的模糊序列模式挖掘
顺序模式挖掘是发现所有频繁的子序列。经典的顺序模式挖掘算法不允许处理数值数据,并且需要将这些数据预处理为二进制表示,这必然导致信息丢失。模糊集被用来克服这个问题。在现有的模糊序列模式挖掘算法中,不存在项目集时间的问题,只根据事件发生的顺序来寻找序列。本文提出了一种具有滑动窗口约束的模糊序列模式算法,该算法允许模式元素在用户指定的窗口内跨越一组事务。因此,在搜索过程中避免了有用序列的丢失。该算法在定义的模糊滑动窗口内搜索目标序列,如果找到目标序列,则返回滑动窗口的隶属度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信