Towards composable prediction of contact groups

Andrew Ghobrial, Jacob W. Bartel, P. Dewan
{"title":"Towards composable prediction of contact groups","authors":"Andrew Ghobrial, Jacob W. Bartel, P. Dewan","doi":"10.4108/ICST.COLLABORATECOM.2014.257329","DOIUrl":null,"url":null,"abstract":"Users' contacts often need to be grouped into equivalence classes for various purposes such as easily sending a message to all members of the group. Several approaches have been recently developed to make such predictions (a) for both ephemeral and persistent groups (b) in both email and social networks systems. However, no research has attempted to compare these approaches or compose them by using ideas of one in another. We have taken a step in this direction. We have developed and compared multiple approaches to predicting persistent contact groups in email. These approaches compose an algorithm that generates friend lists in Facebook from a social graph with different techniques for generating the social graph. One of these techniques is based on a scoring algorithm used by Google to predict ephemeral groups incrementally. To compare the approaches we ran a user study involving 19 participants and used two simple metrics that calculated the average percentage difference between a predicted group and the group of addresses in a future message. The evaluation showed that using the Google score was the best approach though it offered very small improvements over all but one of the simpler methods.","PeriodicalId":432345,"journal":{"name":"10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4108/ICST.COLLABORATECOM.2014.257329","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Users' contacts often need to be grouped into equivalence classes for various purposes such as easily sending a message to all members of the group. Several approaches have been recently developed to make such predictions (a) for both ephemeral and persistent groups (b) in both email and social networks systems. However, no research has attempted to compare these approaches or compose them by using ideas of one in another. We have taken a step in this direction. We have developed and compared multiple approaches to predicting persistent contact groups in email. These approaches compose an algorithm that generates friend lists in Facebook from a social graph with different techniques for generating the social graph. One of these techniques is based on a scoring algorithm used by Google to predict ephemeral groups incrementally. To compare the approaches we ran a user study involving 19 participants and used two simple metrics that calculated the average percentage difference between a predicted group and the group of addresses in a future message. The evaluation showed that using the Google score was the best approach though it offered very small improvements over all but one of the simpler methods.
面向接触组的可组合预测
出于各种目的,用户的联系人通常需要被分组到等价类中,例如方便地向组中的所有成员发送消息。最近已经开发了几种方法来做出这样的预测(a)短期和持久的群体(b)在电子邮件和社会网络系统。然而,没有研究试图比较这些方法,或者通过使用另一种方法的想法来组合它们。我们已经朝这个方向迈出了一步。我们已经开发并比较了多种方法来预测电子邮件中的持久联系组。这些方法组成了一个算法,该算法使用不同的技术从社交图谱中生成Facebook中的好友列表。其中一种技术是基于谷歌使用的评分算法,该算法用于增量预测短暂的群体。为了比较这两种方法,我们进行了一项涉及19名参与者的用户研究,并使用了两个简单的指标来计算预测组和未来消息中地址组之间的平均百分比差异。评估显示,使用谷歌评分是最好的方法,尽管除了一种更简单的方法外,它提供的改进很小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信