Contextual Sub-network Extraction in Contextual Social Networks

Xiaoming Zheng, Yan Wang, M. Orgun
{"title":"Contextual Sub-network Extraction in Contextual Social Networks","authors":"Xiaoming Zheng, Yan Wang, M. Orgun","doi":"10.1109/Trustcom.2015.365","DOIUrl":null,"url":null,"abstract":"Predicting the trust between a source participant and a target participant in a social network is important in many applications, e.g., assessing the recommendation from a target participant from the perspective of a source participant. In general, social networks contain participants, the links and trust relations between them and the contextual information for their interactions. All such information has important influence on trust prediction. However, predicting the trust between two participants based on the whole network is ineffective and inefficient. Thus, prior to trust prediction, it is necessary to extract a small-scale contextual network that contains most of the important participants as well as trust and contextual information. However, extracting such a sub-network has been proved to be an NP-Complete problem. To solve this challenging problem, we propose a social context-aware trust sub-network extraction model to search near-optimal solutions effectively and efficiently. In our proposed model, we first present the important factors that affect the trust between participants in OSNs. Then, we define a utility function to measure the trust factors of each node in a social network. At last, we design an ant colony algorithm with a newly designed mutation process for sub-network extraction. The experiments, conducted on two popular datasets of Epinions and Slashdot, demonstrate that our approach can extract those sub-networks covering important participants and contextual information while keeping a high density rate. Our approach is superior to the state-of-the-art approaches in terms of the quality of extracted sub-networks within the same execution time.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Trustcom/BigDataSE/ISPA","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/Trustcom.2015.365","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Predicting the trust between a source participant and a target participant in a social network is important in many applications, e.g., assessing the recommendation from a target participant from the perspective of a source participant. In general, social networks contain participants, the links and trust relations between them and the contextual information for their interactions. All such information has important influence on trust prediction. However, predicting the trust between two participants based on the whole network is ineffective and inefficient. Thus, prior to trust prediction, it is necessary to extract a small-scale contextual network that contains most of the important participants as well as trust and contextual information. However, extracting such a sub-network has been proved to be an NP-Complete problem. To solve this challenging problem, we propose a social context-aware trust sub-network extraction model to search near-optimal solutions effectively and efficiently. In our proposed model, we first present the important factors that affect the trust between participants in OSNs. Then, we define a utility function to measure the trust factors of each node in a social network. At last, we design an ant colony algorithm with a newly designed mutation process for sub-network extraction. The experiments, conducted on two popular datasets of Epinions and Slashdot, demonstrate that our approach can extract those sub-networks covering important participants and contextual information while keeping a high density rate. Our approach is superior to the state-of-the-art approaches in terms of the quality of extracted sub-networks within the same execution time.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
情境社交网络中的情境子网络提取
预测社交网络中源参与者和目标参与者之间的信任在许多应用中都很重要,例如,从源参与者的角度评估目标参与者的推荐。一般来说,社交网络包含参与者、他们之间的链接和信任关系以及他们互动的上下文信息。这些信息都对信任预测有重要影响。然而,基于整个网络来预测两个参与者之间的信任是无效和低效的。因此,在进行信任预测之前,有必要提取一个包含大多数重要参与者以及信任和上下文信息的小规模上下文网络。然而,这种子网络的提取已被证明是一个np完全问题。为了解决这一具有挑战性的问题,我们提出了一种社会上下文感知的信任子网络提取模型,以有效地搜索近最优解。在我们提出的模型中,我们首先提出了影响osn中参与者之间信任的重要因素。然后,我们定义了一个效用函数来衡量社会网络中每个节点的信任系数。最后,采用蚁群算法设计了一种新的变异过程,用于子网络的提取。在Epinions和Slashdot两个流行的数据集上进行的实验表明,我们的方法可以在保持高密度率的同时提取覆盖重要参与者和上下文信息的子网络。我们的方法在相同执行时间内提取子网络的质量方面优于最先进的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Novel Sensor Deployment Approach Using Fruit Fly Optimization Algorithm in Wireless Sensor Networks Study on the Coverage of Adaptive Wireless Sensor Network Based on Trust A Security Topology Protocol of Wireless Sensor Networks Based on Community Detection and Energy Aware WAVE: Secure Wireless Pairing Exploiting Human Body Movements Quantitative Trustworthy Evaluation Scheme for Trust Routing Scheme in Wireless Sensor Networks
×
引用
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