Supporting Network Formation through Mining under Privacy Constraints

Florian Skopik, D. Schall, S. Dustdar
{"title":"Supporting Network Formation through Mining under Privacy Constraints","authors":"Florian Skopik, D. Schall, S. Dustdar","doi":"10.1109/SAINT.2010.10","DOIUrl":null,"url":null,"abstract":"Single professionals and small companies come together and form virtual communities to compete with global players. In these collaboration networks, the actual business partners are discovered and alliances formed on demand. However, it is impossible for single members to keep track of the dynamics in large-scale networks. With the wide adoption of service-oriented architectures (SOA), interactions between partners have become observable. Monitoring collaborations enables the inference of social relations and the identification of successful partner compositions. Measuring the quality of social relations, such as the degree of trust based on the success of past interactions, are a powerful means to support the formation of alliances. However, by applying monitoring, also privacy concerns arise. In this paper we deal with concepts and tools to support group formations. We consider the trade-off between the benefits of sharing personal profiles and accounting for privacy concerns of the individual network members.","PeriodicalId":381377,"journal":{"name":"2010 10th IEEE/IPSJ International Symposium on Applications and the Internet","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 10th IEEE/IPSJ International Symposium on Applications and the Internet","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SAINT.2010.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Single professionals and small companies come together and form virtual communities to compete with global players. In these collaboration networks, the actual business partners are discovered and alliances formed on demand. However, it is impossible for single members to keep track of the dynamics in large-scale networks. With the wide adoption of service-oriented architectures (SOA), interactions between partners have become observable. Monitoring collaborations enables the inference of social relations and the identification of successful partner compositions. Measuring the quality of social relations, such as the degree of trust based on the success of past interactions, are a powerful means to support the formation of alliances. However, by applying monitoring, also privacy concerns arise. In this paper we deal with concepts and tools to support group formations. We consider the trade-off between the benefits of sharing personal profiles and accounting for privacy concerns of the individual network members.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在隐私约束下通过挖掘支持网络形成
单身专业人士和小公司聚集在一起,形成虚拟社区,与全球玩家竞争。在这些协作网络中,可以根据需要发现实际的业务伙伴并形成联盟。然而,在大规模网络中,单个成员不可能跟踪动态。随着面向服务的体系结构(SOA)的广泛采用,合作伙伴之间的交互变得可以观察到。监测协作可以推断社会关系并确定成功的合作伙伴组合。衡量社会关系的质量,如基于过去互动成功的信任程度,是支持联盟形成的有力手段。然而,通过应用监控,也会产生隐私问题。在本文中,我们处理支持群体形成的概念和工具。我们考虑了共享个人资料的好处和考虑个人网络成员的隐私问题之间的权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Urgent Need of Ubiquitous Healthcare for Chronic Disease Management: Focused on Diabetes for the First Step Transforming the Interactive Response System to a Cloud Voting Service How to Locate a Target Binary Process and Its Derivatives in System Emulator Study of Log File Dispersion Management Method Supporting Network Formation through Mining under Privacy Constraints
×
引用
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