一种有效的数据流封闭加权频繁模式挖掘算法

Wang Jie, Zeng Yu
{"title":"一种有效的数据流封闭加权频繁模式挖掘算法","authors":"Wang Jie, Zeng Yu","doi":"10.1109/ICSESS.2012.6269428","DOIUrl":null,"url":null,"abstract":"Weighted frequent pattern mining is suggested to discover more important frequent pattern by considering different weights of each item, and closed frequent pattern mining can reduces the number of frequent patterns and keep sufficient result information. In this paper, we propose an efficient algorithm DS_CWFP to mine closed weighted frequent pattern mining over data streams. We present an efficient algorithm based on sliding window and can discover closed weighted frequent pattern from the recent data. A new efficient DS_CWFP data structure is used to dynamically maintain the information of transactions and also maintain the closed weighted frequent patterns has been found in the current sliding window. Three optimization strategies are present. The detail of the algorithm DS_CWFP is also discussed. Experimental studies are performed to evaluate the good effectiveness of DS_CWFP.","PeriodicalId":205738,"journal":{"name":"2012 IEEE International Conference on Computer Science and Automation Engineering","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"An efficient algorithm for mining closed weighted frequent pattern over data streams\",\"authors\":\"Wang Jie, Zeng Yu\",\"doi\":\"10.1109/ICSESS.2012.6269428\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Weighted frequent pattern mining is suggested to discover more important frequent pattern by considering different weights of each item, and closed frequent pattern mining can reduces the number of frequent patterns and keep sufficient result information. In this paper, we propose an efficient algorithm DS_CWFP to mine closed weighted frequent pattern mining over data streams. We present an efficient algorithm based on sliding window and can discover closed weighted frequent pattern from the recent data. A new efficient DS_CWFP data structure is used to dynamically maintain the information of transactions and also maintain the closed weighted frequent patterns has been found in the current sliding window. Three optimization strategies are present. The detail of the algorithm DS_CWFP is also discussed. Experimental studies are performed to evaluate the good effectiveness of DS_CWFP.\",\"PeriodicalId\":205738,\"journal\":{\"name\":\"2012 IEEE International Conference on Computer Science and Automation Engineering\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-06-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE International Conference on Computer Science and Automation Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSESS.2012.6269428\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE International Conference on Computer Science and Automation Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSESS.2012.6269428","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

建议采用加权频繁模式挖掘,通过考虑每个项目的不同权重来发现更重要的频繁模式,封闭式频繁模式挖掘可以减少频繁模式的数量并保留足够的结果信息。本文提出了一种有效的数据流封闭加权频繁模式挖掘算法DS_CWFP。提出了一种基于滑动窗口的有效算法,可以从近期数据中发现封闭加权频繁模式。采用一种新的高效的DS_CWFP数据结构来动态维护事务信息,同时维护当前滑动窗口中发现的封闭加权频繁模式。提出了三种优化策略。本文还详细讨论了DS_CWFP算法。实验验证了DS_CWFP的良好效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An efficient algorithm for mining closed weighted frequent pattern over data streams
Weighted frequent pattern mining is suggested to discover more important frequent pattern by considering different weights of each item, and closed frequent pattern mining can reduces the number of frequent patterns and keep sufficient result information. In this paper, we propose an efficient algorithm DS_CWFP to mine closed weighted frequent pattern mining over data streams. We present an efficient algorithm based on sliding window and can discover closed weighted frequent pattern from the recent data. A new efficient DS_CWFP data structure is used to dynamically maintain the information of transactions and also maintain the closed weighted frequent patterns has been found in the current sliding window. Three optimization strategies are present. The detail of the algorithm DS_CWFP is also discussed. Experimental studies are performed to evaluate the good effectiveness of DS_CWFP.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Recognizing Textual Entailment with synthetic analysis based on SVM and feature value control Remote authentication of software based on machine's fingerprint Promoting sustainable e-government with multichannel service delivery: A case study Prediction and analysis of the household savings based on the multiplicative seasonality model Analysis and improvement for MDS localization algorithm
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1