用于生成社交图表和从电子邮件中推荐命名组的测试平台

Andrew Ghobrial, Jacob W. Bartel, Andrew Vitkus, P. Dewan
{"title":"用于生成社交图表和从电子邮件中推荐命名组的测试平台","authors":"Andrew Ghobrial, Jacob W. Bartel, Andrew Vitkus, P. Dewan","doi":"10.1145/2808797.2808800","DOIUrl":null,"url":null,"abstract":"Named groups are persistent groups of contacts with whom a user may wish to share the same information. We have engineered a test-bed for evaluating algorithms that recommend such groups. It assumes that these algorithms first generate social graphs from email logs and then mine these graphs to recommend the lists. It supports a variety of mechanisms to gather user data to support users with different privacy needs. It can be attached to a variety of algorithms for mining the data collected. It accommodates different kinds of models for using named groups and offers an evaluation mechanism that requires no effort from the user. The test-bed also provides visualizations of the generated social graphs and generated lists. Thus, it frees algorithm designers from gathering data and evaluating and understanding the output. It has been used to evaluate and compare multiple algorithms for recommending contact groups.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A test-bed for generating social graphs and recommending named groups from email\",\"authors\":\"Andrew Ghobrial, Jacob W. Bartel, Andrew Vitkus, P. Dewan\",\"doi\":\"10.1145/2808797.2808800\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Named groups are persistent groups of contacts with whom a user may wish to share the same information. We have engineered a test-bed for evaluating algorithms that recommend such groups. It assumes that these algorithms first generate social graphs from email logs and then mine these graphs to recommend the lists. It supports a variety of mechanisms to gather user data to support users with different privacy needs. It can be attached to a variety of algorithms for mining the data collected. It accommodates different kinds of models for using named groups and offers an evaluation mechanism that requires no effort from the user. The test-bed also provides visualizations of the generated social graphs and generated lists. Thus, it frees algorithm designers from gathering data and evaluating and understanding the output. It has been used to evaluate and compare multiple algorithms for recommending contact groups.\",\"PeriodicalId\":371988,\"journal\":{\"name\":\"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-08-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2808797.2808800\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2808797.2808800","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

命名组是用户可能希望与之共享相同信息的联系人的持久组。我们设计了一个测试平台,用于评估推荐这类组的算法。它假设这些算法首先从电子邮件日志中生成社交图表,然后挖掘这些图表来推荐列表。它支持多种机制来收集用户数据,以支持具有不同隐私需求的用户。它可以附加到各种算法来挖掘收集到的数据。它为使用命名组提供了不同类型的模型,并提供了一种不需要用户付出任何努力的评估机制。测试平台还提供了生成的社交图和生成的列表的可视化。因此,它将算法设计者从收集数据、评估和理解输出中解放出来。它已被用于评估和比较推荐联络小组的多种算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A test-bed for generating social graphs and recommending named groups from email
Named groups are persistent groups of contacts with whom a user may wish to share the same information. We have engineered a test-bed for evaluating algorithms that recommend such groups. It assumes that these algorithms first generate social graphs from email logs and then mine these graphs to recommend the lists. It supports a variety of mechanisms to gather user data to support users with different privacy needs. It can be attached to a variety of algorithms for mining the data collected. It accommodates different kinds of models for using named groups and offers an evaluation mechanism that requires no effort from the user. The test-bed also provides visualizations of the generated social graphs and generated lists. Thus, it frees algorithm designers from gathering data and evaluating and understanding the output. It has been used to evaluate and compare multiple algorithms for recommending contact groups.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信