序列挖掘算法的比较分析:以电信业为例

Doruk Tıktıklar, Gürsel Baltaoğlu, Efsa Çakır, Zeynep Küçük, M. Aktaş
{"title":"序列挖掘算法的比较分析:以电信业为例","authors":"Doruk Tıktıklar, Gürsel Baltaoğlu, Efsa Çakır, Zeynep Küçük, M. Aktaş","doi":"10.1109/UBMK52708.2021.9558935","DOIUrl":null,"url":null,"abstract":"This paper examines existing sequence mining algorithms. Sequence mining algorithms are used in many domains, including cyber-security, telecommunications, user behaviour, and air quality patterns. We draw the underlying principles of the representative sequence mining algorithms and introduce a comparative analysis methodology for them. To test the methodology, we provide a prototype testing framework. We conduct a comprehensive experimental study on publicly available data sets, real-life telecommunication data set and data sets generated by a data generator. We compare GSP, PrefixSpan and CMRules algorithms. Comparing these sequence mining algorithms, we conclude that the fastest among the targeted three algorithms may differ for different data sets. Furthermore, we search for situations where sequential pattern mining algorithms can be used instead of sequential rule mining algorithms.","PeriodicalId":106516,"journal":{"name":"2021 6th International Conference on Computer Science and Engineering (UBMK)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Comparative Analysis of Sequence Mining Algorithms: Case Study in Telecommunications\",\"authors\":\"Doruk Tıktıklar, Gürsel Baltaoğlu, Efsa Çakır, Zeynep Küçük, M. Aktaş\",\"doi\":\"10.1109/UBMK52708.2021.9558935\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper examines existing sequence mining algorithms. Sequence mining algorithms are used in many domains, including cyber-security, telecommunications, user behaviour, and air quality patterns. We draw the underlying principles of the representative sequence mining algorithms and introduce a comparative analysis methodology for them. To test the methodology, we provide a prototype testing framework. We conduct a comprehensive experimental study on publicly available data sets, real-life telecommunication data set and data sets generated by a data generator. We compare GSP, PrefixSpan and CMRules algorithms. Comparing these sequence mining algorithms, we conclude that the fastest among the targeted three algorithms may differ for different data sets. Furthermore, we search for situations where sequential pattern mining algorithms can be used instead of sequential rule mining algorithms.\",\"PeriodicalId\":106516,\"journal\":{\"name\":\"2021 6th International Conference on Computer Science and Engineering (UBMK)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-09-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 6th International Conference on Computer Science and Engineering (UBMK)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/UBMK52708.2021.9558935\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 6th International Conference on Computer Science and Engineering (UBMK)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UBMK52708.2021.9558935","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了现有的序列挖掘算法。序列挖掘算法用于许多领域,包括网络安全、电信、用户行为和空气质量模式。总结了具有代表性的序列挖掘算法的基本原理,并介绍了它们的比较分析方法。为了测试该方法,我们提供了一个原型测试框架。我们对公开可用的数据集、现实生活中的电信数据集和数据生成器生成的数据集进行了全面的实验研究。我们比较了GSP、PrefixSpan和cmrrules算法。比较这些序列挖掘算法,我们得出结论,对于不同的数据集,目标三种算法之间的最快速度可能不同。此外,我们寻找可以使用顺序模式挖掘算法而不是顺序规则挖掘算法的情况。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On the Comparative Analysis of Sequence Mining Algorithms: Case Study in Telecommunications
This paper examines existing sequence mining algorithms. Sequence mining algorithms are used in many domains, including cyber-security, telecommunications, user behaviour, and air quality patterns. We draw the underlying principles of the representative sequence mining algorithms and introduce a comparative analysis methodology for them. To test the methodology, we provide a prototype testing framework. We conduct a comprehensive experimental study on publicly available data sets, real-life telecommunication data set and data sets generated by a data generator. We compare GSP, PrefixSpan and CMRules algorithms. Comparing these sequence mining algorithms, we conclude that the fastest among the targeted three algorithms may differ for different data sets. Furthermore, we search for situations where sequential pattern mining algorithms can be used instead of sequential rule mining algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Emotion Analysis from Facial Expressions Using Convolutional Neural Networks Early Stage Fault Prediction via Inter-Project Rule Transfer Semantic Similarity Comparison of Word Representation Methods in the Field of Health Small Object Detection and Tracking from Aerial Imagery Anomaly Detection with Deep Long Short Term Memory Networks
×
引用
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