时序项集挖掘的顺序方法

V. Radhakrishna, Shadi A. Aljawarneh, Aravind Cheruvu
{"title":"时序项集挖掘的顺序方法","authors":"V. Radhakrishna, Shadi A. Aljawarneh, Aravind Cheruvu","doi":"10.1145/3234698.3234731","DOIUrl":null,"url":null,"abstract":"Sequential approach for mining temporal itemsets initially proposed by Yoo and Sekhar uses the Euclidean distance measure to discover similarity profiled temporal associations. This paper extends the sequential approach proposed by Yoo by applying the proposed dissimilarity function. The proposed dissimilarity measure for sequential method is obtained by extending the basic Gaussian membership function. Experiments are conducted by applying naïve and sequential approaches using Lp-norm distance function over synthetic dataset generated and results are compared to the sequential approach using proposed Gaussian based distance function. Naïve and sequential methods using Euclidean distance function and sequential approach using proposed distance function are compared w.r.t computational time and computational space. Experiment results using synthetic datasets proved that the performance of proposed approach is better to naïve and sequential approaches in terms of computational time.","PeriodicalId":144334,"journal":{"name":"Proceedings of the Fourth International Conference on Engineering & MIS 2018","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"47","resultStr":"{\"title\":\"Sequential Approach for Mining of Temporal Itemsets\",\"authors\":\"V. Radhakrishna, Shadi A. Aljawarneh, Aravind Cheruvu\",\"doi\":\"10.1145/3234698.3234731\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sequential approach for mining temporal itemsets initially proposed by Yoo and Sekhar uses the Euclidean distance measure to discover similarity profiled temporal associations. This paper extends the sequential approach proposed by Yoo by applying the proposed dissimilarity function. The proposed dissimilarity measure for sequential method is obtained by extending the basic Gaussian membership function. Experiments are conducted by applying naïve and sequential approaches using Lp-norm distance function over synthetic dataset generated and results are compared to the sequential approach using proposed Gaussian based distance function. Naïve and sequential methods using Euclidean distance function and sequential approach using proposed distance function are compared w.r.t computational time and computational space. Experiment results using synthetic datasets proved that the performance of proposed approach is better to naïve and sequential approaches in terms of computational time.\",\"PeriodicalId\":144334,\"journal\":{\"name\":\"Proceedings of the Fourth International Conference on Engineering & MIS 2018\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"47\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fourth International Conference on Engineering & MIS 2018\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3234698.3234731\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fourth International Conference on Engineering & MIS 2018","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3234698.3234731","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 47

摘要

Yoo和Sekhar最初提出的挖掘时间项集的顺序方法使用欧几里得距离度量来发现相似剖面的时间关联。本文通过应用所提出的不相似函数扩展了Yoo提出的顺序方法。通过扩展基本高斯隶属函数,得到了序列方法的不相似测度。在合成数据集上应用naïve和使用lp范数距离函数的顺序方法进行了实验,并将结果与使用提出的基于高斯距离函数的顺序方法进行了比较。Naïve和顺序方法使用欧几里得距离函数和顺序方法使用提出的距离函数进行了比较,计算时间和计算空间。在合成数据集上的实验结果表明,该方法在计算时间方面优于naïve和顺序方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Sequential Approach for Mining of Temporal Itemsets
Sequential approach for mining temporal itemsets initially proposed by Yoo and Sekhar uses the Euclidean distance measure to discover similarity profiled temporal associations. This paper extends the sequential approach proposed by Yoo by applying the proposed dissimilarity function. The proposed dissimilarity measure for sequential method is obtained by extending the basic Gaussian membership function. Experiments are conducted by applying naïve and sequential approaches using Lp-norm distance function over synthetic dataset generated and results are compared to the sequential approach using proposed Gaussian based distance function. Naïve and sequential methods using Euclidean distance function and sequential approach using proposed distance function are compared w.r.t computational time and computational space. Experiment results using synthetic datasets proved that the performance of proposed approach is better to naïve and sequential approaches in terms of computational time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信