Email recipient prediction using reverse chronologically arranged implicit groups

Akash Desai, S. Dash
{"title":"Email recipient prediction using reverse chronologically arranged implicit groups","authors":"Akash Desai, S. Dash","doi":"10.1109/IC3.2014.6897217","DOIUrl":null,"url":null,"abstract":"Although social networking has significantly influenced online communication, email still has managed to retain its importance. There are number of techniques proposed in past by researchers for recipient prediction/suggestion. Most of them are complex to implement and takes good amount of computation time. The major factor behind higher time complexity and space complexity is the prediction models these methods use. These days mobile device applications are being widely used for emailing and thus appropriate techniques should be found considering constraints of mobile devices. Keeping this in view our research focuses on proposing prediction model, which takes very less computational efforts to be maintained. Apart from this, existing methods focus on maximizing number of intended recipients in one prediction cycle. In this paper, we also propose a different way of looking at the problem, by targeting 1 intended recipient in each iteration. For this, we introduce hit rate as a good measurement technique to measure the effectiveness of recipient prediction algorithm. We also present a flaw in the compiled version of Enron data set, and show some novel analysis on Enron data set which will help immensely in creating efficient recipient prediction algorithm.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Seventh International Conference on Contemporary Computing (IC3)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3.2014.6897217","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Although social networking has significantly influenced online communication, email still has managed to retain its importance. There are number of techniques proposed in past by researchers for recipient prediction/suggestion. Most of them are complex to implement and takes good amount of computation time. The major factor behind higher time complexity and space complexity is the prediction models these methods use. These days mobile device applications are being widely used for emailing and thus appropriate techniques should be found considering constraints of mobile devices. Keeping this in view our research focuses on proposing prediction model, which takes very less computational efforts to be maintained. Apart from this, existing methods focus on maximizing number of intended recipients in one prediction cycle. In this paper, we also propose a different way of looking at the problem, by targeting 1 intended recipient in each iteration. For this, we introduce hit rate as a good measurement technique to measure the effectiveness of recipient prediction algorithm. We also present a flaw in the compiled version of Enron data set, and show some novel analysis on Enron data set which will help immensely in creating efficient recipient prediction algorithm.
电子邮件收件人预测使用反向时间顺序安排隐式组
尽管社交网络对在线交流产生了重大影响,但电子邮件仍然保持着它的重要性。过去,研究者们提出了许多预测/建议接受者的技术。它们中的大多数实现起来很复杂,并且需要大量的计算时间。高时间复杂度和空间复杂度背后的主要因素是这些方法使用的预测模型。如今,移动设备应用程序被广泛用于电子邮件,因此应该找到适当的技术来考虑移动设备的限制。考虑到这一点,我们的研究重点是提出预测模型,这需要非常少的计算工作量来维护。除此之外,现有的方法侧重于在一个预测周期内最大化预期接受者的数量。在本文中,我们还提出了一种不同的看待问题的方法,即在每次迭代中针对一个预期的接收者。为此,我们引入命中率作为一种很好的测量技术来衡量收件人预测算法的有效性。本文还提出了安然数据集编译版本的一个缺陷,并对安然数据集进行了一些新颖的分析,这将极大地有助于创建高效的收件人预测算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信