基于高斯不相似度量的相似时序关联模式挖掘方法

V. Radhakrishna, P. Kumar, V. Janaki
{"title":"基于高斯不相似度量的相似时序关联模式挖掘方法","authors":"V. Radhakrishna, P. Kumar, V. Janaki","doi":"10.1145/2832987.2833069","DOIUrl":null,"url":null,"abstract":"The problem of mining frequent patterns in non-temporal databases is studied extensively. Conventional frequent pattern algorithms are not applicable to find temporal frequent items from the temporal databases. Given a reference support time sequence, the problem of mining similar temporal association patterns has been the current interest among the researchers working in the area of temporal databases. The main objective of this research is to propose and validate the suitability of Gaussian distribution based dissimilarity measure to find similar and dissimilar temporal association patterns of interest. The measure designed serves as similarity measure for finding the similar temporal association patterns. Finally, in this research, we consider the problem of mining similarity profiled temporal patterns from the set of time stamped transaction of temporal database using proposed measure. We show using a case study how the proposed dissimilarity measure may be used to find the temporal frequent patterns and compare the same with the work carried in the literature. The proposed measure has the fixed lower bound and upper bound values as 0 and 1 respectively which is its advantage as compared to Euclidean distance measure which has no fixed upper bound.","PeriodicalId":416001,"journal":{"name":"Proceedings of the The International Conference on Engineering & MIS 2015","volume":"34 21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"67","resultStr":"{\"title\":\"An Approach for Mining Similarity Profiled Temporal Association Patterns Using Gaussian Based Dissimilarity Measure\",\"authors\":\"V. Radhakrishna, P. Kumar, V. Janaki\",\"doi\":\"10.1145/2832987.2833069\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of mining frequent patterns in non-temporal databases is studied extensively. Conventional frequent pattern algorithms are not applicable to find temporal frequent items from the temporal databases. Given a reference support time sequence, the problem of mining similar temporal association patterns has been the current interest among the researchers working in the area of temporal databases. The main objective of this research is to propose and validate the suitability of Gaussian distribution based dissimilarity measure to find similar and dissimilar temporal association patterns of interest. The measure designed serves as similarity measure for finding the similar temporal association patterns. Finally, in this research, we consider the problem of mining similarity profiled temporal patterns from the set of time stamped transaction of temporal database using proposed measure. We show using a case study how the proposed dissimilarity measure may be used to find the temporal frequent patterns and compare the same with the work carried in the literature. The proposed measure has the fixed lower bound and upper bound values as 0 and 1 respectively which is its advantage as compared to Euclidean distance measure which has no fixed upper bound.\",\"PeriodicalId\":416001,\"journal\":{\"name\":\"Proceedings of the The International Conference on Engineering & MIS 2015\",\"volume\":\"34 21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"67\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the The International Conference on Engineering & MIS 2015\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2832987.2833069\",\"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 The International Conference on Engineering & MIS 2015","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2832987.2833069","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 67

摘要

非时态数据库中频繁模式的挖掘问题得到了广泛的研究。传统的频繁模式算法不适用于从时态数据库中发现时态频繁项。在给定参考支持时间序列的情况下,挖掘相似时间关联模式的问题一直是时间数据库研究人员关注的问题。本研究的主要目的是提出并验证基于高斯分布的不相似度度量的适用性,以发现感兴趣的相似和不相似的时间关联模式。所设计的度量作为相似性度量,用于发现相似的时间关联模式。最后,在本文的研究中,我们考虑了使用所提出的度量从时间数据库的时间戳事务集中挖掘相似轮廓时间模式的问题。我们通过一个案例研究展示了如何使用提出的不相似性度量来发现时间频率模式,并将其与文献中进行的工作进行比较。该测度具有固定的下界和上界值分别为0和1,这是其相对于没有固定上界的欧氏距离测度的优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Approach for Mining Similarity Profiled Temporal Association Patterns Using Gaussian Based Dissimilarity Measure
The problem of mining frequent patterns in non-temporal databases is studied extensively. Conventional frequent pattern algorithms are not applicable to find temporal frequent items from the temporal databases. Given a reference support time sequence, the problem of mining similar temporal association patterns has been the current interest among the researchers working in the area of temporal databases. The main objective of this research is to propose and validate the suitability of Gaussian distribution based dissimilarity measure to find similar and dissimilar temporal association patterns of interest. The measure designed serves as similarity measure for finding the similar temporal association patterns. Finally, in this research, we consider the problem of mining similarity profiled temporal patterns from the set of time stamped transaction of temporal database using proposed measure. We show using a case study how the proposed dissimilarity measure may be used to find the temporal frequent patterns and compare the same with the work carried in the literature. The proposed measure has the fixed lower bound and upper bound values as 0 and 1 respectively which is its advantage as compared to Euclidean distance measure which has no fixed upper bound.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Hybrid Discrete Flower Pollination Algorithm for Graph Coloring Problem QoS web service Security Access Control case study using HTTP Secured Socket Layer Approach An improved k-Means Clustering algorithm for Intrusion Detection using Gaussian function A Feature Vector Based Approach for Software Component Clustering and Reuse Using K-means A Proposed Method to Recognize the Research Trends using Web-based Search Engines
×
引用
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