加权有向网络规则模式挖掘

Anand Gupta, H. Thakur, Pragya Kishore
{"title":"加权有向网络规则模式挖掘","authors":"Anand Gupta, H. Thakur, Pragya Kishore","doi":"10.1109/ICIT.2014.44","DOIUrl":null,"url":null,"abstract":"Mining of regular patterns in dynamic networks finds immense application in characterizing the local properties of the networks, like behaviour (friendship relation), event occurrence (football matches). They in then are used to predict their future trends. But if they do not entail weight and direction aspects of the dynamic network, there can be loss of several significant details, such as strength of a relationship or event, specification of the person responsible for it in a relationship, winning or losing in case of events. To the best of our knowledge, no work has been reported yet to extract regular patterns that take into account weight and direction aspects of dynamic networks. We thus propose a novel method to mine regular patterns in weighted and directed networks. In the proposed method, different snapshots of the dynamic network are taken, and through the concept of Regular Expression, we obtain repetition rule for each of: occurrence sequence, weight sequence, direction sequence and weight-direction sequence. For each of these four categories, edges having same rule are grouped to obtain evolution patterns. To ensure the practical feasibility of the approach, experimental evaluation is done on the real world dataset of Enron emails. The results obtained show that, 2.39%, 6.92%, 9.96% and 1.81% of the edges are found to be regular on weight, direction, occurrence and weight-direction respectively.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"17 1","pages":"215-220"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Mining Regular Patterns in Weighted-Directed Networks\",\"authors\":\"Anand Gupta, H. Thakur, Pragya Kishore\",\"doi\":\"10.1109/ICIT.2014.44\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mining of regular patterns in dynamic networks finds immense application in characterizing the local properties of the networks, like behaviour (friendship relation), event occurrence (football matches). They in then are used to predict their future trends. But if they do not entail weight and direction aspects of the dynamic network, there can be loss of several significant details, such as strength of a relationship or event, specification of the person responsible for it in a relationship, winning or losing in case of events. To the best of our knowledge, no work has been reported yet to extract regular patterns that take into account weight and direction aspects of dynamic networks. We thus propose a novel method to mine regular patterns in weighted and directed networks. In the proposed method, different snapshots of the dynamic network are taken, and through the concept of Regular Expression, we obtain repetition rule for each of: occurrence sequence, weight sequence, direction sequence and weight-direction sequence. For each of these four categories, edges having same rule are grouped to obtain evolution patterns. To ensure the practical feasibility of the approach, experimental evaluation is done on the real world dataset of Enron emails. The results obtained show that, 2.39%, 6.92%, 9.96% and 1.81% of the edges are found to be regular on weight, direction, occurrence and weight-direction respectively.\",\"PeriodicalId\":6486,\"journal\":{\"name\":\"2014 17th International Conference on Computer and Information Technology (ICCIT)\",\"volume\":\"17 1\",\"pages\":\"215-220\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 17th International Conference on Computer and Information Technology (ICCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIT.2014.44\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 17th International Conference on Computer and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIT.2014.44","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

动态网络中规则模式的挖掘在描述网络的局部属性方面有着巨大的应用,比如行为(友谊关系)、事件发生(足球比赛)。然后用它们来预测它们的未来趋势。但是,如果它们不涉及动态网络的权重和方向方面,则可能会丢失几个重要的细节,例如关系或事件的强度,在一段关系中负责该事件的人的规格,在事件发生时的输赢。据我们所知,目前还没有关于提取考虑到动态网络的权重和方向方面的规则模式的报道。因此,我们提出了一种新的方法来挖掘加权和有向网络中的规则模式。在该方法中,对动态网络进行不同的快照,通过正则表达式的概念,得到发生序列、权值序列、方向序列和权值-方向序列的重复规则。对于这四种类型中的每一种,将具有相同规则的边分组以获得进化模式。为了确保该方法的实际可行性,在安然电子邮件的真实世界数据集上进行了实验评估。结果表明:2.39%、6.92%、9.96%和1.81%的边缘在权值、方向、出现率和权值方向上都是规则的;
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Mining Regular Patterns in Weighted-Directed Networks
Mining of regular patterns in dynamic networks finds immense application in characterizing the local properties of the networks, like behaviour (friendship relation), event occurrence (football matches). They in then are used to predict their future trends. But if they do not entail weight and direction aspects of the dynamic network, there can be loss of several significant details, such as strength of a relationship or event, specification of the person responsible for it in a relationship, winning or losing in case of events. To the best of our knowledge, no work has been reported yet to extract regular patterns that take into account weight and direction aspects of dynamic networks. We thus propose a novel method to mine regular patterns in weighted and directed networks. In the proposed method, different snapshots of the dynamic network are taken, and through the concept of Regular Expression, we obtain repetition rule for each of: occurrence sequence, weight sequence, direction sequence and weight-direction sequence. For each of these four categories, edges having same rule are grouped to obtain evolution patterns. To ensure the practical feasibility of the approach, experimental evaluation is done on the real world dataset of Enron emails. The results obtained show that, 2.39%, 6.92%, 9.96% and 1.81% of the edges are found to be regular on weight, direction, occurrence and weight-direction respectively.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Android IR - Full-Text Search for Android Impurity Measurement in Selecting Decision Node Tree that Tolerate Noisy Cases A Comparative Study of IXP in Europe and US from a Complex Network Perspective Ensemble Features Selection Algorithm by Considering Features Ranking Priority User Independency of SSVEP Based Brain Computer Interface Using ANN Classifier: Statistical Approach
×
引用
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