Dynamic Twitter friend grouping based on similarity, interaction, and trust to account for ever-evolving relationships

IF 1.5 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC IET Communications Pub Date : 2024-07-26 DOI:10.1049/cmu2.12807
Nisha P. Shetty, Balachandra Muniyal, Leander Melroy Maben, Rithika Jayaraj, Sameer Saxena
{"title":"Dynamic Twitter friend grouping based on similarity, interaction, and trust to account for ever-evolving relationships","authors":"Nisha P. Shetty,&nbsp;Balachandra Muniyal,&nbsp;Leander Melroy Maben,&nbsp;Rithika Jayaraj,&nbsp;Sameer Saxena","doi":"10.1049/cmu2.12807","DOIUrl":null,"url":null,"abstract":"<p>Online social networks have become ubiquitous, allowing users to share opinions on various topics. However, oversharing can compromise privacy, leading to potential blackmail or fraud. Current platforms lack friend categorization based on trust levels. This study proposes simulating real-world friendships by grouping users into three categories: acquaintances, friends, and close friends, based on trust and engagement. It also introduces a dynamic method to adjust relationship status over time, considering users' past and present offenses against peers. The proposed system automatically updates friend lists, eliminating manual grouping. It calculates relationship strength by considering all components of online social networks and trust variations caused by user attacks. This method can be integrated with clustering algorithms on popular platforms like Facebook, Twitter, and Instagram to enable constrained sharing. By implementing this system, users can better control their information sharing based on trust levels, reducing privacy risks. The dynamic nature of the relationship status adjustment ensures that the system remains relevant as user interactions evolve over time. This approach offers a more nuanced and secure social networking experience, reflecting real-world relationship dynamics in the digital sphere.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":"18 17","pages":"1018-1048"},"PeriodicalIF":1.5000,"publicationDate":"2024-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12807","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Communications","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/cmu2.12807","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

Online social networks have become ubiquitous, allowing users to share opinions on various topics. However, oversharing can compromise privacy, leading to potential blackmail or fraud. Current platforms lack friend categorization based on trust levels. This study proposes simulating real-world friendships by grouping users into three categories: acquaintances, friends, and close friends, based on trust and engagement. It also introduces a dynamic method to adjust relationship status over time, considering users' past and present offenses against peers. The proposed system automatically updates friend lists, eliminating manual grouping. It calculates relationship strength by considering all components of online social networks and trust variations caused by user attacks. This method can be integrated with clustering algorithms on popular platforms like Facebook, Twitter, and Instagram to enable constrained sharing. By implementing this system, users can better control their information sharing based on trust levels, reducing privacy risks. The dynamic nature of the relationship status adjustment ensures that the system remains relevant as user interactions evolve over time. This approach offers a more nuanced and secure social networking experience, reflecting real-world relationship dynamics in the digital sphere.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
根据相似性、互动性和信任度对 Twitter 好友进行动态分组,以考虑不断发展的关系
在线社交网络已变得无处不在,允许用户就各种话题分享观点。然而,过度分享可能会泄露隐私,导致潜在的勒索或欺诈。目前的平台缺乏基于信任度的好友分类。本研究建议模拟现实世界中的朋友关系,根据信任度和参与度将用户分为三类:熟人、朋友和密友。它还引入了一种动态方法,考虑到用户过去和现在对同伴的冒犯行为,随着时间的推移调整关系状态。建议的系统会自动更新好友列表,无需人工分组。它通过考虑在线社交网络的所有组成部分和用户攻击造成的信任变化来计算关系强度。这种方法可与 Facebook、Twitter 和 Instagram 等流行平台上的聚类算法相结合,实现有限制的共享。通过实施该系统,用户可以根据信任度更好地控制自己的信息共享,从而降低隐私风险。关系状态调整的动态性质确保了系统在用户互动随时间演变的过程中始终保持相关性。这种方法提供了一种更细致入微、更安全的社交网络体验,反映了数字领域中真实世界的关系动态。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IET Communications
IET Communications 工程技术-工程:电子与电气
CiteScore
4.30
自引率
6.20%
发文量
220
审稿时长
5.9 months
期刊介绍: IET Communications covers the fundamental and generic research for a better understanding of communication technologies to harness the signals for better performing communication systems using various wired and/or wireless media. This Journal is particularly interested in research papers reporting novel solutions to the dominating problems of noise, interference, timing and errors for reduction systems deficiencies such as wasting scarce resources such as spectra, energy and bandwidth. Topics include, but are not limited to: Coding and Communication Theory; Modulation and Signal Design; Wired, Wireless and Optical Communication; Communication System Special Issues. Current Call for Papers: Cognitive and AI-enabled Wireless and Mobile - https://digital-library.theiet.org/files/IET_COM_CFP_CAWM.pdf UAV-Enabled Mobile Edge Computing - https://digital-library.theiet.org/files/IET_COM_CFP_UAV.pdf
期刊最新文献
A deep learning-based approach for pseudo-satellite positioning Analysis of interference effect in VL-NOMA network considering signal power parameters performance An innovative model for an enhanced dual intrusion detection system using LZ-JC-DBSCAN, EPRC-RPOA and EG-GELU-GRU A high-precision timing and frequency synchronization algorithm for multi-h CPM signals Dual-user joint sensing and communications with time-divisioned bi-static radar
×
引用
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