Extending the Gaussian membership function for finding similarity between temporal patterns

Shadi A. Aljawarneh, V. Radhakrishna, Aravind Cheruvu
{"title":"Extending the Gaussian membership function for finding similarity between temporal patterns","authors":"Shadi A. Aljawarneh, V. Radhakrishna, Aravind Cheruvu","doi":"10.1109/ICEMIS.2017.8273100","DOIUrl":null,"url":null,"abstract":"In this paper, the basic Gaussian membership function is extended to design the dissimilarity measure. We extend the dissimilarity measure proposed in the G-spamine by applying normal distribution. The dissimilarity measure proposed in this paper is designed by using the concept of standard normal distribution. For a pattern to be similar, the dissimilarity between reference and the temporal pattern has to be less than or equal to the dissimilarity constraint. This dissimilarity constraint is obtained by transforming the user threshold value to z-space. The dissimilarity measure has also been extended to compute the distance bounds by devising necessary expressions. These distance bounds can be used to prune the invalid temporal associations. The algorithm to obtain the similar temporal associations is outlined.","PeriodicalId":117908,"journal":{"name":"2017 International Conference on Engineering & MIS (ICEMIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"58","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Engineering & MIS (ICEMIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEMIS.2017.8273100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 58

Abstract

In this paper, the basic Gaussian membership function is extended to design the dissimilarity measure. We extend the dissimilarity measure proposed in the G-spamine by applying normal distribution. The dissimilarity measure proposed in this paper is designed by using the concept of standard normal distribution. For a pattern to be similar, the dissimilarity between reference and the temporal pattern has to be less than or equal to the dissimilarity constraint. This dissimilarity constraint is obtained by transforming the user threshold value to z-space. The dissimilarity measure has also been extended to compute the distance bounds by devising necessary expressions. These distance bounds can be used to prune the invalid temporal associations. The algorithm to obtain the similar temporal associations is outlined.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
扩展高斯隶属函数用于寻找时间模式之间的相似性
本文将基本高斯隶属函数扩展到设计不相似度量。我们应用正态分布扩展了G-spamine中提出的不相似测度。本文采用标准正态分布的概念设计了不相似度测度。要使模式相似,引用模式和时间模式之间的不相似度必须小于或等于不相似约束。这种不相似性约束是通过将用户阈值转换到z空间来获得的。通过设计必要的表达式,将不相似度度量扩展到计算距离界限。这些距离界限可以用来修剪无效的时间关联。概述了获取相似时间关联的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A mutlipath routing algorithm for wireless sensor networks under distance and energy consumption constraints for reliable data transmission Security of hardware architecture, design and performance of low drop-out voltage regulator LDO to protect power mobile applications Mining the Web for learning ontologies: State of art and critical review Robust PID controller design based on multi-objective Particle Swarm Optimization approach Mobility management of Internet of Things: Protocols, challenges and open issues
×
引用
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