首页 > 最新文献

ACM Transactions on the Web最新文献

英文 中文
DCDIMB: Dynamic Community-based Diversified Influence Maximization using Bridge Nodes DCDIMB:利用桥节点实现基于社区的动态多元化影响力最大化
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-05-11 DOI: 10.1145/3664618
Sunil Meena, SHASHANK SINGH, Kuldeep Singh

Influence maximization (IM) is the fundamental study of social network analysis. The IM problem finds the top k nodes that have maximum influence in the network. Most of the studies in IM focus on maximizing the number of activated nodes in the static social network. But in real life, social networks are dynamic in nature. This work addresses the diversification of activated nodes in the dynamic social network. This work proposes an objective function that maximizes the number of communities by utilizing bridge nodes. We also propose a diffusion model that considers the role of inactive nodes in influencing a node. We prove the submodularity, and monotonicity of the objective function under the proposed diffusion model. This work analyzes the impact of different ratios of bridge nodes in the seed set on real-world and synthetic datasets. Further, we prove the NP-Hardness of the objective function under the proposed diffusion model. The experiments are conducted on various real-world and synthetic datasets with known and unknown community information. The proposed work experimentally shows that the objective function gives the maximum number of communities considering bridge nodes compared to the benchmark algorithms.

影响力最大化(IM)是社交网络分析的基础研究。IM 问题是找出网络中影响力最大的前 k 个节点。IM 的大多数研究都集中在最大化静态社交网络中被激活节点的数量上。但在现实生活中,社交网络是动态的。本作品针对动态社交网络中激活节点的多样化问题进行了研究。这项工作提出了一个目标函数,通过利用桥梁节点来最大化社群数量。我们还提出了一个扩散模型,该模型考虑了非活跃节点在影响节点中的作用。我们证明了所提出的扩散模型下目标函数的亚模块性和单调性。这项工作分析了种子集中不同比例的桥节点对真实世界和合成数据集的影响。此外,我们还证明了拟议扩散模型下目标函数的 NP-Hardness。实验在各种已知和未知社区信息的真实世界和合成数据集上进行。实验结果表明,与基准算法相比,考虑到桥节点,本文提出的目标函数能给出最大数量的社区。
{"title":"DCDIMB: Dynamic Community-based Diversified Influence Maximization using Bridge Nodes","authors":"Sunil Meena, SHASHANK SINGH, Kuldeep Singh","doi":"10.1145/3664618","DOIUrl":"https://doi.org/10.1145/3664618","url":null,"abstract":"<p>Influence maximization (IM) is the fundamental study of social network analysis. The IM problem finds the top <i>k</i> nodes that have maximum influence in the network. Most of the studies in IM focus on maximizing the number of activated nodes in the static social network. But in real life, social networks are dynamic in nature. This work addresses the diversification of activated nodes in the dynamic social network. This work proposes an objective function that maximizes the number of communities by utilizing bridge nodes. We also propose a diffusion model that considers the role of inactive nodes in influencing a node. We prove the submodularity, and monotonicity of the objective function under the proposed diffusion model. This work analyzes the impact of different ratios of bridge nodes in the seed set on real-world and synthetic datasets. Further, we prove the NP-Hardness of the objective function under the proposed diffusion model. The experiments are conducted on various real-world and synthetic datasets with known and unknown community information. The proposed work experimentally shows that the objective function gives the maximum number of communities considering bridge nodes compared to the benchmark algorithms.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"154 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2024-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140925933","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Know their Customers: An Empirical Study of Online Account Enumeration Attacks 了解他们的客户:在线账户枚举攻击实证研究
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-05-07 DOI: 10.1145/3664201
Maël Maceiras, Kavous Salehzadeh Niksirat, Gaël Bernard, Benoit Garbinato, Mauro Cherubini, Mathias Humbert, Kévin Huguenin

Internet users possess accounts on dozens of online services where they are often identified by one of their e-mail addresses. They often use the same address on multiple services and for communicating with their contacts. In this paper, we investigate attacks that enable an adversary (e.g., company, friend) to determine (stealthily or not) whether an individual, identified by their e-mail address, has an account on certain services (i.e., an account enumeration attack). Such attacks on account privacy have serious implications as information about one’s accounts can be used to (1) profile them and (2) improve the effectiveness of phishing. We take a multifaceted approach and study these attacks through a combination of experiments (63 services), surveys (318 respondents), and focus groups (13 participants). We demonstrate the high vulnerability of popular services (93.7%) and the concerns of users about their account privacy, as well as their increased susceptibility to phishing e-mails that impersonate services on which they have an account. We also provide findings on the challenges in implementing countermeasures for service providers and on users’ ideas for enhancing their account privacy. Finally, our interaction with national data protection authorities led to the inclusion of recommendations in their developers’ guide.

互联网用户拥有几十种在线服务的账户,他们通常通过其中一个电子邮件地址来识别。他们经常在多个服务上使用同一个地址,并与其联系人通信。在本文中,我们研究的攻击可使对手(如公司、朋友)确定(无论是否隐蔽)通过电子邮件地址识别的个人是否在某些服务上拥有账户(即账户枚举攻击)。这种对账户隐私的攻击具有严重的影响,因为有关个人账户的信息可用于:(1) 剖析个人档案;(2) 提高网络钓鱼的有效性。我们采取了一种多方面的方法,通过实验(63 项服务)、调查(318 名受访者)和焦点小组(13 名参与者)的组合来研究这些攻击。我们证明了流行服务的高度脆弱性(93.7%)和用户对其账户隐私的担忧,以及他们对冒充其拥有账户的服务的网络钓鱼电子邮件的易感性。我们还提供了有关服务提供商在实施应对措施方面所面临的挑战以及用户在提高账户隐私方面的想法的调查结果。最后,通过与各国数据保护机构的互动,我们在其开发人员指南中纳入了相关建议。
{"title":"Know their Customers: An Empirical Study of Online Account Enumeration Attacks","authors":"Maël Maceiras, Kavous Salehzadeh Niksirat, Gaël Bernard, Benoit Garbinato, Mauro Cherubini, Mathias Humbert, Kévin Huguenin","doi":"10.1145/3664201","DOIUrl":"https://doi.org/10.1145/3664201","url":null,"abstract":"<p>Internet users possess accounts on dozens of online services where they are often identified by one of their e-mail addresses. They often use the same address on multiple services and for communicating with their contacts. In this paper, we investigate attacks that enable an adversary (e.g., company, friend) to determine (stealthily or not) whether an individual, identified by their e-mail address, has an account on certain services (i.e., an <i>account enumeration attack</i>). Such attacks on <i>account privacy</i> have serious implications as information about one’s accounts can be used to (1) profile them and (2) improve the effectiveness of phishing. We take a multifaceted approach and study these attacks through a combination of experiments (63 services), surveys (318 respondents), and focus groups (13 participants). We demonstrate the high vulnerability of popular services (93.7%) and the concerns of users about their account privacy, as well as their increased susceptibility to phishing e-mails that impersonate services on which they have an account. We also provide findings on the challenges in implementing countermeasures for service providers and on users’ ideas for enhancing their account privacy. Finally, our interaction with national data protection authorities led to the inclusion of recommendations in their developers’ guide.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"80 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140885847","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Learning Dynamic Multimodal Network Slot Concepts from the Web for Forecasting Environmental, Social and Governance Ratings 从网络中学习动态多模态网络插槽概念,用于预测环境、社会和治理评级
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-05-03 DOI: 10.1145/3663674
Gary Ang, Ee-Peng Lim

Dynamic multimodal networks are networks with node attributes from different modalities where the attributes and network relationships evolve across time, i.e. both networks and multimodal attributes are dynamic. For example, dynamic relationship networks between companies that evolve across time due to changes in business strategies and alliances, which are associated with dynamic company attributes from multiple modalities such as textual online news, categorical events, and numerical financial-related data. Such information can be useful in predictive tasks involving companies. Environmental, social and governance (ESG) ratings of companies are important for assessing the sustainability risks of companies. The process of generating ESG ratings by expert analysts is however laborious and time-intensive. We thus explore the use of dynamic multimodal networks extracted from the web for forecasting ESG ratings. Learning such dynamic multimodal networks from the web for forecasting ESG ratings is however challenging due to its heterogeneity, and the low signal-to-noise ratios and non-stationary distributions of web information. Human analysts cope with such issues by learning concepts from past experience through relational thinking, and scanning for such concepts when analyzing new information about a company. In this paper, we propose the Dynamic Multimodal Slot Concept Attention-based Network (DynScan) model. DynScan utilizes slot attention mechanisms together with slot concept alignment and disentanglement loss functions to learn latent slot concepts from dynamic multimodal networks to improve performance on ESG rating forecasting tasks. DynScan is evaluated on forecasting tasks on six data sets, comprising three ESG ratings across two sets of companies. Our experiments show that DynScan outperforms other state-of-the-art models on these forecasting tasks. We also visualize the slot concepts learnt by DynScan on five synthetic datasets and three real-world datasets and observe distinct and meaningful slot concepts being learnt by DynScan across both synthetic and real-world datasets.

动态多模态网络是指节点属性来自不同模态的网络,其属性和网络关系随时间而变化,即网络和多模态属性都是动态的。例如,由于商业战略和联盟的变化,公司之间的动态关系网络会随着时间的推移而演变,这些关系网络与多种模式的动态公司属性相关联,如文本在线新闻、分类事件和数字财务相关数据。这些信息在涉及公司的预测任务中非常有用。公司的环境、社会和治理(ESG)评级对于评估公司的可持续发展风险非常重要。然而,专家分析师生成 ESG 评级的过程费时费力。因此,我们探索使用从网络中提取的动态多模态网络来预测 ESG 评级。然而,由于网络信息的异质性、低信噪比和非平稳分布,从网络中学习这种动态多模态网络来预测 ESG 评级具有挑战性。人类分析师通过关系思维从过去的经验中学习概念,并在分析公司的新信息时扫描这些概念,从而解决这些问题。在本文中,我们提出了基于动态多模态槽概念注意网络(DynScan)模型。DynScan 利用插槽注意机制以及插槽概念对齐和反切损失函数,从动态多模态网络中学习潜在插槽概念,从而提高 ESG 评级预测任务的性能。DynScan 在六个数据集上对预测任务进行了评估,其中包括两组公司的三个 ESG 评级。实验结果表明,DynScan 在这些预测任务中的表现优于其他最先进的模型。我们还对 DynScan 在五个合成数据集和三个真实世界数据集上学习到的插槽概念进行了可视化,并观察到 DynScan 在合成数据集和真实世界数据集上学习到了独特而有意义的插槽概念。
{"title":"Learning Dynamic Multimodal Network Slot Concepts from the Web for Forecasting Environmental, Social and Governance Ratings","authors":"Gary Ang, Ee-Peng Lim","doi":"10.1145/3663674","DOIUrl":"https://doi.org/10.1145/3663674","url":null,"abstract":"<p>Dynamic multimodal networks are networks with node attributes from different modalities where the attributes and network relationships evolve across time, i.e. both networks and multimodal attributes are dynamic. For example, dynamic relationship networks between companies that evolve across time due to changes in business strategies and alliances, which are associated with dynamic company attributes from multiple modalities such as textual online news, categorical events, and numerical financial-related data. Such information can be useful in predictive tasks involving companies. Environmental, social and governance (ESG) ratings of companies are important for assessing the sustainability risks of companies. The process of generating ESG ratings by expert analysts is however laborious and time-intensive. We thus explore the use of dynamic multimodal networks extracted from the web for forecasting ESG ratings. Learning such dynamic multimodal networks from the web for forecasting ESG ratings is however challenging due to its heterogeneity, and the low signal-to-noise ratios and non-stationary distributions of web information. Human analysts cope with such issues by learning concepts from past experience through relational thinking, and scanning for such concepts when analyzing new information about a company. In this paper, we propose the Dynamic Multimodal Slot Concept Attention-based Network (DynScan) model. DynScan utilizes slot attention mechanisms together with slot concept alignment and disentanglement loss functions to learn latent slot concepts from dynamic multimodal networks to improve performance on ESG rating forecasting tasks. DynScan is evaluated on forecasting tasks on six data sets, comprising three ESG ratings across two sets of companies. Our experiments show that DynScan outperforms other state-of-the-art models on these forecasting tasks. We also visualize the slot concepts learnt by DynScan on five synthetic datasets and three real-world datasets and observe distinct and meaningful slot concepts being learnt by DynScan across both synthetic and real-world datasets.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"18 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140830824","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
MuLX-QA: Classifying Multi-Labels and Extracting Rationale Spans in Social Media Posts MuLX-QA:对社交媒体帖子中的多标签进行分类并提取理由跨度
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-03-21 DOI: 10.1145/3653303
Soham Poddar, Rajdeep Mukherjee, Azlaan Mustafa Samad, Niloy Ganguly, Saptarshi Ghosh

While social media platforms play an important role in our daily lives in obtaining the latest news and trends from across the globe, they are known to be prone to widespread proliferation of harmful information in different forms leading to misconceptions among the masses. Accordingly, several prior works have attempted to tag social media posts with labels/classes reflecting their veracity, sentiments, hate content, etc. However, in order to have a convincing impact, it is important to additionally extract the post snippets on which the labelling decision is based. We call such a post snippet as the ‘rationale’. These rationales significantly improve human trust and debuggability of the predictions, especially when detecting misinformation or stigmas from social media posts. These rationale spans or snippets are also helpful in post-classification social analysis, such as for finding out the target communities in hate-speech, or for understanding the arguments or concerns against the intake of vaccines. Also it is observed that a post may express multiple notions of misinformation, hate, sentiment, etc. Thus, the task of determining (one or multiple) labels for a given piece of text, along with the text snippets explaining the rationale behind each of the identified labels is a challenging multi-label, multi-rationale classification task, which is still nascent in the literature.

While transformer-based encoder-decoder generative models such as BART and T5 are well-suited for the task, in this work we show how a relatively simpler encoder-only discriminative question-answering (QA) model can be effectively trained using simple template-based questions to accomplish the task. We thus propose MuLX-QA and demonstrate its utility in producing (label, rationale span) pairs in two different settings: multi-class (on the HateXplain dataset related to hate speech on social media), and multi-label (on the CAVES dataset related to COVID-19 anti-vaccine concerns). MuLX-QA outperforms heavier generative models in both settings. We also demonstrate the relative advantage of our proposed model MuLX-QA over strong baselines when trained with limited data. We perform several ablation studies, and experiments to better understand the effect of training MuLX-QA with different question prompts, and draw interesting inferences. Additionally, we show that MuLX-QA is effective on social media posts in resource-poor non-English languages as well. Finally, we perform a qualitative analysis of our model predictions and compare them with those of our strongest baseline.

虽然社交媒体平台在我们获取全球最新新闻和趋势的日常生活中发挥着重要作用,但众所周知,这些平台容易以不同形式广泛传播有害信息,导致大众产生误解。因此,以前的一些著作试图给社交媒体帖子贴标签/分类,以反映其真实性、情感、仇恨内容等。然而,为了产生令人信服的效果,还必须额外提取帖子片段,并据此做出贴标签的决定。我们称这样的帖子片段为 "理由"。这些理由大大提高了人类对预测的信任度和可调试性,尤其是在检测社交媒体帖子中的错误信息或污名时。这些理由跨度或片段还有助于分类后的社会分析,例如找出仇恨言论的目标群体,或了解反对接种疫苗的论点或担忧。此外,我们还发现,一个帖子可能表达了错误信息、仇恨、情绪等多种概念。因此,为给定文本确定(一个或多个)标签以及解释每个已识别标签背后原理的文本片段,是一项具有挑战性的多标签、多原理分类任务,目前在文献中尚属新生事物。虽然基于变换器的编码器-解码器生成模型(如 BART 和 T5)非常适合这项任务,但在这项工作中,我们展示了如何使用基于模板的简单问题有效地训练相对简单的纯编码器判别式问答(QA)模型来完成这项任务。因此,我们提出了 MuLX-QA,并展示了它在两种不同环境下生成(标签、理由跨度)对的实用性:多类(在与社交媒体上的仇恨言论有关的 HateXplain 数据集上)和多标签(在与 COVID-19 反疫苗问题有关的 CAVES 数据集上)。在这两种情况下,MuLX-QA 都优于较重的生成模型。我们还展示了我们提出的模型 MuLX-QA 在使用有限数据进行训练时相对于强基线的优势。我们进行了多项消融研究和实验,以更好地了解用不同问题提示训练 MuLX-QA 的效果,并得出了有趣的推论。此外,我们还表明,MuLX-QA 对资源贫乏的非英语语言社交媒体帖子也很有效。最后,我们对模型预测进行了定性分析,并将其与最强基线进行了比较。
{"title":"MuLX-QA: Classifying Multi-Labels and Extracting Rationale Spans in Social Media Posts","authors":"Soham Poddar, Rajdeep Mukherjee, Azlaan Mustafa Samad, Niloy Ganguly, Saptarshi Ghosh","doi":"10.1145/3653303","DOIUrl":"https://doi.org/10.1145/3653303","url":null,"abstract":"<p>While social media platforms play an important role in our daily lives in obtaining the latest news and trends from across the globe, they are known to be prone to widespread proliferation of harmful information in different forms leading to misconceptions among the masses. Accordingly, several prior works have attempted to tag social media posts with labels/classes reflecting their veracity, sentiments, hate content, etc. However, in order to have a convincing impact, it is important to additionally extract the post snippets on which the labelling decision is based. We call such a post snippet as the ‘rationale’. These rationales significantly improve human trust and debuggability of the predictions, especially when detecting misinformation or stigmas from social media posts. These rationale spans or snippets are also helpful in post-classification social analysis, such as for finding out the target communities in hate-speech, or for understanding the arguments or concerns against the intake of vaccines. Also it is observed that a post may express multiple notions of misinformation, hate, sentiment, etc. Thus, the task of determining (one or multiple) labels for a given piece of text, along with the <i>text snippets explaining the rationale behind each of the identified labels</i> is a challenging <i>multi-label, multi-rationale</i> classification task, which is still nascent in the literature. </p><p>While <i>transformer</i>-based encoder-decoder generative models such as BART and T5 are well-suited for the task, in this work we show how a relatively simpler <b>encoder-only</b> discriminative question-answering (QA) model can be effectively trained using <b>simple template-based questions</b> to accomplish the task. We thus propose <b>MuLX-QA</b> and demonstrate its utility in producing (label, rationale span) pairs in two different settings: <i>multi-class</i> (on the <i>HateXplain</i> dataset related to hate speech on social media), and <i>multi-label</i> (on the <i>CAVES</i> dataset related to COVID-19 anti-vaccine concerns). <b>MuLX-QA outperforms heavier generative models</b> in both settings. We also demonstrate the relative advantage of our proposed model MuLX-QA over strong baselines when trained with limited data. We perform several ablation studies, and experiments to better understand the effect of training MuLX-QA with different question prompts, and draw interesting inferences. Additionally, we show that MuLX-QA is effective on social media posts in resource-poor non-English languages as well. Finally, we perform a qualitative analysis of our model predictions and compare them with those of our strongest baseline.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"20 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2024-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140200422","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Heterogeneous Graph Neural Network with Personalized and Adaptive Diversity for News Recommendation 用于新闻推荐的具有个性化和自适应多样性的异构图神经网络
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-03-08 DOI: 10.1145/3649886
Guangping Zhang, Dongsheng Li, Hansu Gu, Tun Lu, Ning Gu

The emergence of online media has facilitated the dissemination of news, but has also introduced the problem of information overload. To address this issue, providing users with accurate and diverse news recommendations has become increasingly important. News possesses rich and heterogeneous content, and the factors that attract users to news reading are varied. Consequently, accurate news recommendation requires modeling of both the heterogeneous content of news and the heterogeneous user-news relationships. Furthermore, users’ news consumption is highly dynamic, which is reflected in the differences in topic concentration among different users and in the real-time changes in user interests. To this end, we propose a Heterogeneous Graph Neural Network with Personalized and Adaptive Diversity for News Recommendation (DivHGNN). DivHGNN first represents the heterogeneous content of news and the heterogeneous user-news relationships as an attributed heterogeneous graph. Then, through a heterogeneous node content adapter, it models the heterogeneous node attributes into aligned and fused node representations. With the proposed attributed heterogeneous graph neural network, DivHGNN integrates the heterogeneous relationships to enhance node representation for accurate news recommendations. We also discuss relation pruning, model deployment, and cold-start issues to further improve model efficiency. In terms of diversity, DivHGNN simultaneously models the variance of nodes through variational representation learning for providing personalized diversity. Additionally, a time-continuous exponentially decaying distribution cache is proposed to model the temporal dynamics of user real-time interests for providing adaptive diversity. Extensive experiments on real-world news datasets demonstrate the effectiveness of the proposed method.

网络媒体的出现为新闻传播提供了便利,但也带来了信息过载的问题。为解决这一问题,向用户提供准确、多样的新闻推荐变得越来越重要。新闻内容丰富多样,吸引用户阅读新闻的因素也多种多样。因此,准确的新闻推荐需要对新闻的异构内容和用户与新闻的异构关系进行建模。此外,用户的新闻消费是高度动态的,这体现在不同用户的话题集中度差异和用户兴趣的实时变化上。为此,我们提出了一种用于新闻推荐的具有个性化和自适应多样性的异构图神经网络(DivHGNN)。DivHGNN 首先将新闻的异构内容和用户与新闻的异构关系表示为一个归属异构图。然后,通过异构节点内容适配器,将异构节点属性建模为对齐和融合的节点表示。通过所提出的归属异构图神经网络,DivHGNN 整合了异构关系以增强节点表示,从而实现准确的新闻推荐。我们还讨论了关系剪枝、模型部署和冷启动问题,以进一步提高模型效率。在多样性方面,DivHGNN 通过变异表示学习同时对节点的方差进行建模,从而提供个性化的多样性。此外,还提出了一种时间连续指数衰减分布缓存,以模拟用户实时兴趣的时间动态,从而提供自适应多样性。在真实世界新闻数据集上进行的大量实验证明了所提方法的有效性。
{"title":"Heterogeneous Graph Neural Network with Personalized and Adaptive Diversity for News Recommendation","authors":"Guangping Zhang, Dongsheng Li, Hansu Gu, Tun Lu, Ning Gu","doi":"10.1145/3649886","DOIUrl":"https://doi.org/10.1145/3649886","url":null,"abstract":"<p>The emergence of online media has facilitated the dissemination of news, but has also introduced the problem of information overload. To address this issue, providing users with accurate and diverse news recommendations has become increasingly important. News possesses rich and heterogeneous content, and the factors that attract users to news reading are varied. Consequently, accurate news recommendation requires modeling of both the heterogeneous content of news and the heterogeneous user-news relationships. Furthermore, users’ news consumption is highly dynamic, which is reflected in the differences in topic concentration among different users and in the real-time changes in user interests. To this end, we propose a Heterogeneous Graph Neural Network with Personalized and Adaptive Diversity for News Recommendation (DivHGNN). DivHGNN first represents the heterogeneous content of news and the heterogeneous user-news relationships as an attributed heterogeneous graph. Then, through a heterogeneous node content adapter, it models the heterogeneous node attributes into aligned and fused node representations. With the proposed attributed heterogeneous graph neural network, DivHGNN integrates the heterogeneous relationships to enhance node representation for accurate news recommendations. We also discuss relation pruning, model deployment, and cold-start issues to further improve model efficiency. In terms of diversity, DivHGNN simultaneously models the variance of nodes through variational representation learning for providing personalized diversity. Additionally, a time-continuous exponentially decaying distribution cache is proposed to model the temporal dynamics of user real-time interests for providing adaptive diversity. Extensive experiments on real-world news datasets demonstrate the effectiveness of the proposed method.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"279 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2024-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140073483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Fuzzy Influence Maximization in Social Networks 社交网络中的模糊影响力最大化
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-03-01 DOI: 10.1145/3650179
Ahmad Zareie, Rizos Sakellariou

Influence maximization is a fundamental problem in social network analysis. This problem refers to the identification of a set of influential users as initial spreaders to maximize the spread of a message in a network. When such a message is spread, some users may be influenced by it. A common assumption of existing work is that the impact of a message is essentially binary: a user is either influenced (activated) or not influenced (non-activated). However, how strongly a user is influenced by a message may play an important role in this user’s attempt to influence subsequent users and spread the message further; existing methods may fail to model accurately the spreading process and identify influential users. In this paper, we propose a novel approach to model a social network as a fuzzy graph where a fuzzy variable is used to represent the extent to which a user is influenced by a message (user’s activation level). By extending a diffusion model to simulate the spreading process in such a fuzzy graph we conceptually formulate the fuzzy influence maximization problem for which three methods are proposed to identify influential users. Experimental results demonstrate the accuracy of the proposed methods in determining influential users in social networks.

影响力最大化是社交网络分析中的一个基本问题。这个问题指的是找出一组有影响力的用户作为初始传播者,以最大化信息在网络中的传播。当这样一条信息被传播时,一些用户可能会受到它的影响。现有工作的一个共同假设是,信息的影响基本上是二元的:用户要么受到影响(激活),要么没有受到影响(未激活)。然而,用户受信息影响的程度可能对该用户试图影响后续用户并进一步传播信息起到重要作用;现有方法可能无法准确模拟传播过程并识别有影响力的用户。在本文中,我们提出了一种将社交网络建模为模糊图的新方法,其中使用了一个模糊变量来表示用户受信息影响的程度(用户的激活水平)。通过扩展扩散模型来模拟模糊图中的传播过程,我们从概念上提出了模糊影响力最大化问题,并为此提出了三种方法来识别有影响力的用户。实验结果证明了所提出的方法在确定社交网络中有影响力用户方面的准确性。
{"title":"Fuzzy Influence Maximization in Social Networks","authors":"Ahmad Zareie, Rizos Sakellariou","doi":"10.1145/3650179","DOIUrl":"https://doi.org/10.1145/3650179","url":null,"abstract":"<p>Influence maximization is a fundamental problem in social network analysis. This problem refers to the identification of a set of influential users as initial spreaders to maximize the spread of a message in a network. When such a message is spread, some users may be influenced by it. A common assumption of existing work is that the impact of a message is essentially binary: a user is either influenced (activated) or not influenced (non-activated). However, how strongly a user is influenced by a message may play an important role in this user’s attempt to influence subsequent users and spread the message further; existing methods may fail to model accurately the spreading process and identify influential users. In this paper, we propose a novel approach to model a social network as a fuzzy graph where a fuzzy variable is used to represent the extent to which a user is influenced by a message (user’s activation level). By extending a diffusion model to simulate the spreading process in such a fuzzy graph we conceptually formulate the fuzzy influence maximization problem for which three methods are proposed to identify influential users. Experimental results demonstrate the accuracy of the proposed methods in determining influential users in social networks.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"13 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140003813","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Envisioning Information Access Systems: What Makes for Good Tools and a Healthy Web? 设想信息获取系统:什么是好的工具和健康的网络?
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-02-26 DOI: 10.1145/3649468
Chirag Shah, Emily M. Bender

We observe a recent trend towards applying large language models (LLMs) in search and positioning them as effective information access systems. While the interfaces may look appealing and the apparent breadth of applicability is exciting, we are concerned that the field is rushing ahead with a technology without sufficient study of the uses it is meant to serve, how it would be used, and what its use would mean. We argue that it is important to reassert the central research focus of the field of information retrieval, because information access is not merely an application to be solved by the so-called ‘AI’ techniques du jour. Rather, it is a key human activity, with impacts on both individuals and society. As information scientists, we should be asking what do people and society want and need from information access systems and how do we design and build systems to meet those needs? With that goal, in this conceptual paper we investigate fundamental questions concerning information access from user and societal viewpoints. We revisit foundational work related to information behavior, information seeking, information retrieval, information filtering, and information access to resurface what we know about these fundamental questions and what may be missing. We then provide our conceptual framing about how we could fill this gap, focusing on methods as well as experimental and evaluation frameworks. We consider the Web as an information ecosystem and explore the ways in which synthetic media, produced by LLMs and otherwise, endangers that ecosystem. The primary goal of this conceptual paper is to shed light on what we still do not know about the potential impacts of LLM-based information access systems, how to advance our understanding of user behaviors, and where the next generations of students, scholars, and developers could fruitfully invest their energies.

我们注意到最近有一种趋势,即在搜索中应用大型语言模型(LLM),并将其定位为有效的信息访问系统。虽然界面看起来很吸引人,适用范围也很广,但我们担心的是,该领域正在匆忙推出一种技术,而没有对其用途、使用方式和意义进行充分研究。我们认为,重申信息检索领域的核心研究重点是非常重要的,因为信息获取并不仅仅是一种应用,可以通过所谓的 "人工智能 "技术来解决。相反,它是人类的一项重要活动,对个人和社会都有影响。作为信息科学家,我们应该问一问,人们和社会希望和需要从信息获取系统中获得什么,我们又该如何设计和构建系统来满足这些需求?本着这一目标,在这篇概念性论文中,我们从用户和社会的角度探讨了有关信息获取的基本问题。我们重温了与信息行为、信息搜索、信息检索、信息过滤和信息获取相关的基础性工作,以重现我们对这些基本问题的了解以及可能存在的缺失。然后,我们提供了如何填补这一空白的概念框架,重点是方法以及实验和评估框架。我们将网络视为一个信息生态系统,并探讨由 LLM 或其他方式制作的合成媒体如何危害该生态系统。这篇概念性论文的主要目的是阐明我们对基于 LLM 的信息访问系统的潜在影响还有哪些不了解的地方,如何增进我们对用户行为的了解,以及下一代学生、学者和开发人员可以在哪些方面投入精力,以取得丰硕成果。
{"title":"Envisioning Information Access Systems: What Makes for Good Tools and a Healthy Web?","authors":"Chirag Shah, Emily M. Bender","doi":"10.1145/3649468","DOIUrl":"https://doi.org/10.1145/3649468","url":null,"abstract":"<p>We observe a recent trend towards applying large language models (LLMs) in search and positioning them as effective information access systems. While the interfaces may look appealing and the apparent breadth of applicability is exciting, we are concerned that the field is rushing ahead with a technology without sufficient study of the uses it is meant to serve, how it would be used, and what its use would mean. We argue that it is important to reassert the central research focus of the field of information retrieval, because information access is not merely an application to be solved by the so-called ‘AI’ techniques du jour. Rather, it is a key human activity, with impacts on both individuals and society. As information scientists, we should be asking what do people and society want and need from information access systems and how do we design and build systems to meet those needs? With that goal, in this conceptual paper we investigate fundamental questions concerning information access from user and societal viewpoints. We revisit foundational work related to information behavior, information seeking, information retrieval, information filtering, and information access to resurface what we know about these fundamental questions and what may be missing. We then provide our conceptual framing about how we could fill this gap, focusing on methods as well as experimental and evaluation frameworks. We consider the Web as an information ecosystem and explore the ways in which synthetic media, produced by LLMs and otherwise, endangers that ecosystem. The primary goal of this conceptual paper is to shed light on what we still do not know about the potential impacts of LLM-based information access systems, how to advance our understanding of user behaviors, and where the next generations of students, scholars, and developers could fruitfully invest their energies.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"35 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2024-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139968433","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Exif2Vec: A Framework to Ascertain Untrustworthy Crowdsourced Images Using Metadata Exif2Vec:利用元数据确定不可信的众包图像的框架
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-02-13 DOI: 10.1145/3645094
Muhammad Umair, Athman Bouguettaya, Abdallah Lakhdari, Mourad Ouzzani, Yuyun Liu

In the context of social media, the integrity of images is often dubious. To tackle this challenge, we introduce Exif2Vec, a novel framework specifically designed to discover modifications in social media images. The proposed framework leverages an image’s metadata to discover changes in an image. We use a service-oriented approach that considers discovery of changes in images as a service. A novel word-embedding based approach is proposed to discover semantic inconsistencies in an image metadata that are reflective of the changes in an image. These inconsistencies are used to measure the severity of changes. The novelty of the approach resides in that it does not require the use of images to determine the underlying changes. We use a pretrained Word2Vec model to conduct experiments. The model is validated on two different fact-checked image datasets, i.e., images related to general context and a context specific image dataset. Notably, our findings showcase the remarkable efficacy of our approach, yielding results of up to 80% accuracy. This underscores the potential of our framework.

在社交媒体中,图像的完整性往往令人怀疑。为了应对这一挑战,我们引入了 Exif2Vec,这是一个新颖的框架,专门用于发现社交媒体图像中的修改。该框架利用图像的元数据来发现图像中的变化。我们采用面向服务的方法,将发现图像中的变化视为一项服务。我们提出了一种基于词嵌入的新方法,用于发现图像元数据中反映图像变化的语义不一致之处。这些不一致之处可用于衡量变化的严重程度。这种方法的新颖之处在于它不需要使用图像来确定潜在的变化。我们使用预先训练好的 Word2Vec 模型进行实验。该模型在两个不同的事实检查图像数据集上进行了验证,即与一般上下文相关的图像和特定上下文图像数据集。值得注意的是,我们的研究结果展示了我们方法的显著功效,准确率高达 80%。这凸显了我们框架的潜力。
{"title":"Exif2Vec: A Framework to Ascertain Untrustworthy Crowdsourced Images Using Metadata","authors":"Muhammad Umair, Athman Bouguettaya, Abdallah Lakhdari, Mourad Ouzzani, Yuyun Liu","doi":"10.1145/3645094","DOIUrl":"https://doi.org/10.1145/3645094","url":null,"abstract":"<p>In the context of social media, the integrity of images is often dubious. To tackle this challenge, we introduce <i>Exif2Vec</i>, a novel framework specifically designed to discover modifications in social media images. The proposed framework leverages an image’s metadata to discover changes in an image. We use a service-oriented approach that considers <i>discovery of changes in images</i> as a <i>service</i>. A novel word-embedding based approach is proposed to discover semantic inconsistencies in an image metadata that are reflective of the changes in an image. These inconsistencies are used to measure the severity of changes. The novelty of the approach resides in that it does not require the use of images to determine the underlying changes. We use a pretrained Word2Vec model to conduct experiments. The model is validated on two different fact-checked image datasets, i.e., images related to general context and a context specific image dataset. Notably, our findings showcase the remarkable efficacy of our approach, yielding results of up to 80% accuracy. This underscores the potential of our framework.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"15 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2024-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139770919","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
DeLink: An Adversarial Framework for Defending against Cross-site User Identity Linkage DeLink:防御跨站用户身份链接的对抗框架
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-02-05 DOI: 10.1145/3643828
Peng Zhang, Qi Zhou, Tun Lu, Hansu Gu, Ning Gu

Cross-site user identity linkage (UIL) aims to link the identities of the same person across different social media platforms. Social media practitioners and service providers can construct composite user portraits based on cross-site UIL, which helps understand user behavior holistically and conduct accurate recommendations and personalization. However, many social media users expect each profile to stay within the platform where it was created and thus do not want the identities of different platforms to be linked. For this problem, we first investigate the approaches people would like to use to defend against cross-site UIL and the corresponding challenges. Based on the findings, we build an adversarial framework - DeLink based on the thoughts of adversarial text generation to help people improve their social media screen names to defend against cross-site UIL. DeLink can support both Chinese and English languages and has good generalizability to the varying numbers of social media accounts and different cross-site user identity linkage models. Extensive evaluations validate DeLink’s better performance, including a higher success rate, higher efficiency, less impact on human perception, and capability to defend against different cross-site UIL models.

跨站用户身份关联(UIL)旨在关联同一人在不同社交媒体平台上的身份。社交媒体从业者和服务提供商可以根据跨站用户身份链接构建复合用户画像,这有助于全面了解用户行为,并进行准确的推荐和个性化服务。然而,许多社交媒体用户希望每个人的个人资料都能保留在其创建的平台上,因此不希望不同平台的身份被链接起来。针对这一问题,我们首先调查了人们希望用来抵御跨站 UIL 的方法以及相应的挑战。在此基础上,我们基于对抗式文本生成的思想建立了一个对抗式框架--DeLink,以帮助人们改进其社交媒体网名,从而抵御跨站 UIL。DeLink 支持中英文两种语言,对不同数量的社交媒体账户和不同的跨站用户身份关联模型具有良好的普适性。广泛的评估验证了 DeLink 更好的性能,包括更高的成功率、更高的效率、对人类感知的影响更小,以及防御不同跨站 UIL 模型的能力。
{"title":"DeLink: An Adversarial Framework for Defending against Cross-site User Identity Linkage","authors":"Peng Zhang, Qi Zhou, Tun Lu, Hansu Gu, Ning Gu","doi":"10.1145/3643828","DOIUrl":"https://doi.org/10.1145/3643828","url":null,"abstract":"<p>Cross-site user identity linkage (UIL) aims to link the identities of the same person across different social media platforms. Social media practitioners and service providers can construct composite user portraits based on cross-site UIL, which helps understand user behavior holistically and conduct accurate recommendations and personalization. However, many social media users expect each profile to stay within the platform where it was created and thus do not want the identities of different platforms to be linked. For this problem, we first investigate the approaches people would like to use to defend against cross-site UIL and the corresponding challenges. Based on the findings, we build an adversarial framework - DeLink based on the thoughts of adversarial text generation to help people improve their social media screen names to defend against cross-site UIL. DeLink can support both Chinese and English languages and has good generalizability to the varying numbers of social media accounts and different cross-site user identity linkage models. Extensive evaluations validate DeLink’s better performance, including a higher success rate, higher efficiency, less impact on human perception, and capability to defend against different cross-site UIL models.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"297 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2024-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139689969","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
“HOT” ChatGPT: The Promise of ChatGPT in Detecting and Discriminating Hateful, Offensive, and Toxic Comments on Social Media "HOT" ChatGPT:ChatGPT 在检测和鉴别社交媒体上的仇恨、攻击性和有毒评论方面的前景
IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-02-02 DOI: 10.1145/3643829
Lingyao Li, Lizhou Fan, Shubham Atreja, Libby Hemphill

Harmful textual content is pervasive on social media, poisoning online communities and negatively impacting participation. A common approach to this issue is developing detection models that rely on human annotations. However, the tasks required to build such models expose annotators to harmful and offensive content and may require significant time and cost to complete. Generative AI models have the potential to understand and detect harmful textual content. We used ChatGPT to investigate this potential and compared its performance with MTurker annotations for three frequently discussed concepts related to harmful textual content on social media: Hateful, Offensive, and Toxic (HOT). We designed five prompts to interact with ChatGPT and conducted four experiments eliciting HOT classifications. Our results show that ChatGPT can achieve an accuracy of approximately 80% when compared to MTurker annotations. Specifically, the model displays a more consistent classification for non-HOT comments than HOT comments compared to human annotations. Our findings also suggest that ChatGPT classifications align with the provided HOT definitions. However, ChatGPT classifies “hateful” and “offensive” as subsets of “toxic.” Moreover, the choice of prompts used to interact with ChatGPT impacts its performance. Based on these insights, our study provides several meaningful implications for employing ChatGPT to detect HOT content, particularly regarding the reliability and consistency of its performance, its understanding and reasoning of the HOT concept, and the impact of prompts on its performance. Overall, our study provides guidance on the potential of using generative AI models for moderating large volumes of user-generated textual content on social media.

有害的文字内容在社交媒体上无处不在,毒害着网络社区并对参与产生负面影响。解决这一问题的常见方法是开发依赖于人类注释的检测模型。然而,建立此类模型所需的任务会让注释者接触到有害和攻击性内容,可能需要花费大量时间和成本才能完成。生成式人工智能模型具有理解和检测有害文本内容的潜力。我们使用 ChatGPT 对这一潜力进行了研究,并针对社交媒体上与有害文本内容相关的三个经常被讨论的概念,将其性能与 MTurker 注释进行了比较:仇恨性、攻击性和毒性(HOT)。我们设计了五种与 ChatGPT 互动的提示,并进行了四次 HOT 分类实验。结果表明,与 MTurker 注释相比,ChatGPT 的准确率约为 80%。具体来说,与人工注释相比,该模型对非 HOT 评论的分类比对 HOT 评论的分类更一致。我们的研究结果还表明,ChatGPT 的分类与所提供的 HOT 定义一致。不过,ChatGPT 将 "仇恨性 "和 "攻击性 "归类为 "毒性 "的子集。此外,用于与 ChatGPT 互动的提示的选择也会影响其性能。基于这些见解,我们的研究为使用 ChatGPT 检测 HOT 内容提供了一些有意义的启示,特别是在其性能的可靠性和一致性、对 HOT 概念的理解和推理以及提示对其性能的影响方面。总之,我们的研究为使用生成式人工智能模型调节社交媒体上大量用户生成的文本内容提供了指导。
{"title":"“HOT” ChatGPT: The Promise of ChatGPT in Detecting and Discriminating Hateful, Offensive, and Toxic Comments on Social Media","authors":"Lingyao Li, Lizhou Fan, Shubham Atreja, Libby Hemphill","doi":"10.1145/3643829","DOIUrl":"https://doi.org/10.1145/3643829","url":null,"abstract":"<p>Harmful textual content is pervasive on social media, poisoning online communities and negatively impacting participation. A common approach to this issue is developing detection models that rely on human annotations. However, the tasks required to build such models expose annotators to harmful and offensive content and may require significant time and cost to complete. Generative AI models have the potential to understand and detect harmful textual content. We used ChatGPT to investigate this potential and compared its performance with MTurker annotations for three frequently discussed concepts related to harmful textual content on social media: Hateful, Offensive, and Toxic (HOT). We designed five prompts to interact with ChatGPT and conducted four experiments eliciting HOT classifications. Our results show that ChatGPT can achieve an accuracy of approximately 80% when compared to MTurker annotations. Specifically, the model displays a more consistent classification for non-HOT comments than HOT comments compared to human annotations. Our findings also suggest that ChatGPT classifications align with the provided HOT definitions. However, ChatGPT classifies “hateful” and “offensive” as subsets of “toxic.” Moreover, the choice of prompts used to interact with ChatGPT impacts its performance. Based on these insights, our study provides several meaningful implications for employing ChatGPT to detect HOT content, particularly regarding the reliability and consistency of its performance, its understanding and reasoning of the HOT concept, and the impact of prompts on its performance. Overall, our study provides guidance on the potential of using generative AI models for moderating large volumes of user-generated textual content on social media.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"8 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2024-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139689758","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
ACM Transactions on the Web
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
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