{"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.