首页 > 最新文献

Decision Support Systems最新文献

英文 中文
Social capital matters: Towards comprehensive user preference for product recommendation with deep learning 社会资本问题:通过深度学习实现产品推荐的综合用户偏好
IF 6.8 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-09-08 DOI: 10.1016/j.dss.2025.114527
Weiyue Li , Ming Gao , Bowei Chen , Jingmin An , Yeming Gong
Social recommender systems help address data sparsity in user–product interactions by leveraging social relationships to infer user preferences. However, existing models often overlook the role of social capital that influence decision-making in social commerce. Social capital consists of structural, relational, and cognitive dimensions, all of which shape user preferences. To better understand these influences, we propose a multi-task learning framework named DeepSC that integrates social capital theory into preference modeling. Its user preference learning module extracts structural features through graph-based pre-training, learns relational features from dynamic user embeddings, and models cognitive features using a hypergraph attention network. Additionally, the dual graph-based product feature learning module enhances cognitive feature extraction by incorporating product co-interactions. DeepSC is optimized through a joint learning objective, combining point-wise and pair-wise learning with an auxiliary social link prediction task to refine user representations. Experiments on three e-commerce datasets demonstrate that DeepSC significantly outperforms the state-of-the-art recommendation models, highlighting the effectiveness of integrating social capital into social preference learning. Our research advances social recommendation by providing a social capital theory-driven approach to modeling user behavior in digital commerce.
社会推荐系统通过利用社会关系来推断用户偏好,帮助解决用户-产品交互中的数据稀疏问题。然而,现有的模型往往忽略了社会资本在社交商务中影响决策的作用。社会资本由结构、关系和认知维度组成,所有这些维度都影响用户偏好。为了更好地理解这些影响,我们提出了一个名为DeepSC的多任务学习框架,该框架将社会资本理论整合到偏好建模中。其用户偏好学习模块通过基于图的预训练提取结构特征,从动态用户嵌入中学习关系特征,并使用超图注意网络对认知特征建模。此外,基于双图的产品特征学习模块通过结合产品协同交互增强了认知特征提取。DeepSC通过联合学习目标进行优化,将点学习和成对学习与辅助的社会链接预测任务相结合,以优化用户表示。在三个电子商务数据集上的实验表明,DeepSC显著优于最先进的推荐模型,突出了将社会资本整合到社会偏好学习中的有效性。我们的研究通过提供社会资本理论驱动的方法来为数字商务中的用户行为建模,从而推动了社会推荐。
{"title":"Social capital matters: Towards comprehensive user preference for product recommendation with deep learning","authors":"Weiyue Li ,&nbsp;Ming Gao ,&nbsp;Bowei Chen ,&nbsp;Jingmin An ,&nbsp;Yeming Gong","doi":"10.1016/j.dss.2025.114527","DOIUrl":"10.1016/j.dss.2025.114527","url":null,"abstract":"<div><div>Social recommender systems help address data sparsity in user–product interactions by leveraging social relationships to infer user preferences. However, existing models often overlook the role of social capital that influence decision-making in social commerce. Social capital consists of structural, relational, and cognitive dimensions, all of which shape user preferences. To better understand these influences, we propose a multi-task learning framework named DeepSC that integrates social capital theory into preference modeling. Its user preference learning module extracts structural features through graph-based pre-training, learns relational features from dynamic user embeddings, and models cognitive features using a hypergraph attention network. Additionally, the dual graph-based product feature learning module enhances cognitive feature extraction by incorporating product co-interactions. DeepSC is optimized through a joint learning objective, combining point-wise and pair-wise learning with an auxiliary social link prediction task to refine user representations. Experiments on three e-commerce datasets demonstrate that DeepSC significantly outperforms the state-of-the-art recommendation models, highlighting the effectiveness of integrating social capital into social preference learning. Our research advances social recommendation by providing a social capital theory-driven approach to modeling user behavior in digital commerce.</div></div>","PeriodicalId":55181,"journal":{"name":"Decision Support Systems","volume":"198 ","pages":"Article 114527"},"PeriodicalIF":6.8,"publicationDate":"2025-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145097011","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Modeling hybrid firm relationships with graph neural networks for stock investment decisions 基于图神经网络的混合企业关系股票投资决策建模
IF 6.8 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-09-07 DOI: 10.1016/j.dss.2025.114528
Yang Du , Biao Li , Zhichen Lu , Gang Kou
The highly volatile nature of the stock market makes predicting data patterns challenging. Significant efforts have been dedicated to modeling complex stock correlations to improve stock return forecasting and support better investor decision-making. Although various predefined intrinsic associations and learned implicit graph structures have been discovered, they have limitations in fully exploring and leveraging both types of graph information. In this paper, we proposed a Hybrid Structure-aware Graph Neural Network (HSGNN) framework. Unlike models that rely solely on predefined or learned graphs, HSGNN utilizes money-flow graphs to complementarily learn implicit graph structures and applies sparse supply-chain graphs to jointly enhance stock return forecasting. Extensive experiments on real stock benchmarks demonstrate our proposed HSGNN outperforms various state-of-the-art forecasting methods, offering a robust decision-support system for financial stakeholders.
股市的高度波动性使得预测数据模式具有挑战性。大量的研究致力于建立复杂的股票相关性模型,以改善股票收益预测并支持更好的投资者决策。尽管已经发现了各种预定义的内在关联和习得的隐式图结构,但它们在充分探索和利用这两种类型的图信息方面存在局限性。本文提出了一种混合结构感知图神经网络(HSGNN)框架。与单纯依赖预定义图或学习图的模型不同,HSGNN利用现金流图互补学习隐式图结构,并应用稀疏供应链图共同增强股票收益预测。在真实股票基准上的大量实验表明,我们提出的HSGNN优于各种最先进的预测方法,为金融利益相关者提供了强大的决策支持系统。
{"title":"Modeling hybrid firm relationships with graph neural networks for stock investment decisions","authors":"Yang Du ,&nbsp;Biao Li ,&nbsp;Zhichen Lu ,&nbsp;Gang Kou","doi":"10.1016/j.dss.2025.114528","DOIUrl":"10.1016/j.dss.2025.114528","url":null,"abstract":"<div><div>The highly volatile nature of the stock market makes predicting data patterns challenging. Significant efforts have been dedicated to modeling complex stock correlations to improve stock return forecasting and support better investor decision-making. Although various predefined intrinsic associations and learned implicit graph structures have been discovered, they have limitations in fully exploring and leveraging both types of graph information. In this paper, we proposed a Hybrid Structure-aware Graph Neural Network (HSGNN) framework. Unlike models that rely solely on predefined or learned graphs, HSGNN utilizes money-flow graphs to complementarily learn implicit graph structures and applies sparse supply-chain graphs to jointly enhance stock return forecasting. Extensive experiments on real stock benchmarks demonstrate our proposed HSGNN outperforms various state-of-the-art forecasting methods, offering a robust decision-support system for financial stakeholders.</div></div>","PeriodicalId":55181,"journal":{"name":"Decision Support Systems","volume":"198 ","pages":"Article 114528"},"PeriodicalIF":6.8,"publicationDate":"2025-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145050101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Decision support for integrated trade agent's procurement and sales planning under uncertainty 不确定条件下综合贸易代理采购销售计划的决策支持
IF 6.8 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-09-05 DOI: 10.1016/j.dss.2025.114537
An Liu , Xinyu Wang , Jiafu Tang
This paper investigates a trade agent decision optimization problem (TADOP), in which a trade agent (TA) selects a subset of retailers and suppliers to maximize its profit under uncertain demand and spot price. The TA operates between suppliers and retailers as a third-party platform and decide which subset of retailers to serve, taking into account capacity reservations with option suppliers in advance. Once demand and spot price are realized, the TA decides how much to procure from each channel to fulfill retailers' demand. The problem is formulated as a two-stage stochastic program. Due to the high complexity and large number of scenarios, we reformulate the problem as a set-partition model, where the master problem (MP) selects the combination of retailers to serve, and the subproblem (SP) identifies the optimal procurement plans, thus reducing the number of variables and constraints. To further enhance tractability, the SP is transformed into an equivalent shortest-path problem (SPP) to address issues of non-linearity and non-convexity. Experimental results demonstrate the effectiveness of the decomposition approach, providing TAs with a practical decision-making tool for procurement and sales. Furthermore, the insights gained into TAs' procurement and sales strategies across various scenarios offer valuable guidance for decision-making in uncertain supply chain environments.
本文研究了一个贸易代理决策优化问题(TADOP),该问题是在需求和现货价格不确定的情况下,贸易代理选择零售商和供应商的一个子集,使其利润最大化。TA作为第三方平台在供应商和零售商之间运作,并决定服务哪一部分零售商,提前考虑与备选供应商的容量预留。一旦需求和现货价格实现,TA决定从每个渠道采购多少来满足零售商的需求。该问题被表述为一个两阶段随机规划。由于问题复杂且场景多,我们将问题重新表述为集-分区模型,其中主问题(MP)选择要服务的零售商组合,子问题(SP)确定最优采购计划,从而减少了变量和约束的数量。为了进一步提高可追溯性,将等效最短路径问题(SP)转化为等效最短路径问题(SPP)来解决非线性和非凸性问题。实验结果证明了该分解方法的有效性,为TAs的采购和销售决策提供了一个实用的工具。此外,对不同情景下TAs采购和销售策略的洞察为不确定供应链环境下的决策提供了有价值的指导。
{"title":"Decision support for integrated trade agent's procurement and sales planning under uncertainty","authors":"An Liu ,&nbsp;Xinyu Wang ,&nbsp;Jiafu Tang","doi":"10.1016/j.dss.2025.114537","DOIUrl":"10.1016/j.dss.2025.114537","url":null,"abstract":"<div><div>This paper investigates a trade agent decision optimization problem (TADOP), in which a trade agent (TA) selects a subset of retailers and suppliers to maximize its profit under uncertain demand and spot price. The TA operates between suppliers and retailers as a third-party platform and decide which subset of retailers to serve, taking into account capacity reservations with option suppliers in advance. Once demand and spot price are realized, the TA decides how much to procure from each channel to fulfill retailers' demand. The problem is formulated as a two-stage stochastic program. Due to the high complexity and large number of scenarios, we reformulate the problem as a set-partition model, where the master problem (MP) selects the combination of retailers to serve, and the subproblem (SP) identifies the optimal procurement plans, thus reducing the number of variables and constraints. To further enhance tractability, the SP is transformed into an equivalent shortest-path problem (SPP) to address issues of non-linearity and non-convexity. Experimental results demonstrate the effectiveness of the decomposition approach, providing TAs with a practical decision-making tool for procurement and sales. Furthermore, the insights gained into TAs' procurement and sales strategies across various scenarios offer valuable guidance for decision-making in uncertain supply chain environments.</div></div>","PeriodicalId":55181,"journal":{"name":"Decision Support Systems","volume":"198 ","pages":"Article 114537"},"PeriodicalIF":6.8,"publicationDate":"2025-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145027230","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Decoding LLMs' verbal deception in online reviews 破解法学硕士在线评论中的口头欺骗
IF 6.8 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-09-02 DOI: 10.1016/j.dss.2025.114529
Yinghui Huang , Jinyi Zhou , Wanghao Dong , Weiqing Li , Maomao Chi , Changbin Jiang , Weijun Wang , Shasha Deng
The proliferation of fake online reviews, a long-standing threat to platform trust, is now exacerbated by large language models (LLMs) capable of generating highly convincing deceptive text. Understanding the linguistic strategies LLMs employ is crucial for developing effective mitigation. To address this gap, we develop an explainable artificial intelligence (XAI)-based computational framework, grounded in deception detection theories, to analyze and distinguish the deceptive patterns of LLMs. A core component of our methodology is a novel Turing-style test designed for LLM-generated online reviews. When applied to three purpose-built datasets, our framework not only achieves high detection accuracy for both human-authored fakes (96.57 %) and LLM-generated fakes (96.13 %)—substantially outperforming two current general-purpose detectors—but also indicates that LLMs possess a human-level deceptive capability (metric gaps <0.72 %). The analysis reveals that while cues related to cognitive load and perceptual-contextual details are powerful discriminators for both human and machine deception, certainty uniquely signals LLM-generated text, whereas emotion is a primary predictor only for human fakes. These findings support a central dissociation hypothesis between linguistic generation and cognitive representation: LLM deception is characterized by strategies like surface-level fluency, content realism without experiential grounding, and positivity bias. This study probes the mechanistic differences between human and machine deception, delivers a robust computational detection framework, and advances the theoretical discourse on AI's capacity for deceit.
虚假在线评论的激增是对平台信任的长期威胁,如今,能够生成高度令人信服的欺骗性文本的大型语言模型(llm)加剧了这种威胁。理解法学硕士采用的语言策略对于制定有效的缓解措施至关重要。为了解决这一差距,我们开发了一个可解释的基于人工智能(XAI)的计算框架,以欺骗检测理论为基础,分析和区分法学硕士的欺骗模式。我们方法论的一个核心组成部分是为法学硕士生成的在线评论设计的新颖的图灵风格测试。当应用于三个专门构建的数据集时,我们的框架不仅对人为伪造(96.57%)和llm生成的伪造(96.13%)都达到了很高的检测精度——大大优于目前的两种通用检测器——而且还表明llm具有人类水平的欺骗能力(度量差距<; 0.72%)。分析表明,虽然与认知负荷和感知上下文细节相关的线索是人类和机器欺骗的强大判别器,但确定性唯一地表明llm生成的文本,而情感仅是人类骗局的主要预测因素。这些发现支持了语言生成和认知表征之间的中心分离假设:法学硕士欺骗的特点是表面流利、没有经验基础的内容现实主义和积极偏见等策略。本研究探讨了人类和机器欺骗之间的机制差异,提供了一个强大的计算检测框架,并推进了人工智能欺骗能力的理论论述。
{"title":"Decoding LLMs' verbal deception in online reviews","authors":"Yinghui Huang ,&nbsp;Jinyi Zhou ,&nbsp;Wanghao Dong ,&nbsp;Weiqing Li ,&nbsp;Maomao Chi ,&nbsp;Changbin Jiang ,&nbsp;Weijun Wang ,&nbsp;Shasha Deng","doi":"10.1016/j.dss.2025.114529","DOIUrl":"10.1016/j.dss.2025.114529","url":null,"abstract":"<div><div>The proliferation of fake online reviews, a long-standing threat to platform trust, is now exacerbated by large language models (LLMs) capable of generating highly convincing deceptive text. Understanding the linguistic strategies LLMs employ is crucial for developing effective mitigation. To address this gap, we develop an explainable artificial intelligence (XAI)-based computational framework, grounded in deception detection theories, to analyze and distinguish the deceptive patterns of LLMs. A core component of our methodology is a novel Turing-style test designed for LLM-generated online reviews. When applied to three purpose-built datasets, our framework not only achieves high detection accuracy for both human-authored fakes (96.57 %) and LLM-generated fakes (96.13 %)—substantially outperforming two current general-purpose detectors—but also indicates that LLMs possess a human-level deceptive capability (metric gaps &lt;0.72 %). The analysis reveals that while cues related to cognitive load and perceptual-contextual details are powerful discriminators for both human and machine deception, certainty uniquely signals LLM-generated text, whereas emotion is a primary predictor only for human fakes. These findings support a central dissociation hypothesis between linguistic generation and cognitive representation: LLM deception is characterized by strategies like surface-level fluency, content realism without experiential grounding, and positivity bias. This study probes the mechanistic differences between human and machine deception, delivers a robust computational detection framework, and advances the theoretical discourse on AI's capacity for deceit.</div></div>","PeriodicalId":55181,"journal":{"name":"Decision Support Systems","volume":"200 ","pages":"Article 114529"},"PeriodicalIF":6.8,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145468745","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A field study on the impact of the counter ad-blocking wall strategy on user engagement 反广告拦截墙策略对用户粘性影响的实地研究
IF 6.8 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-09-02 DOI: 10.1016/j.dss.2025.114525
Michael K. Chen , Shuai Zhao , Cristian Borcea , Yi Chen
Ad-blocking tools prevent ads from being shown to web users. Their increasingly widespread usage poses an existential risk to online publishers who provide free content and rely on display ads for revenue. Studies on counter ad-blocking strategies taken by publishers are limited, especially with regard to how these strategies affect user engagement, thus posing additional uncertainties to the selection of a suitable counter ad-blocking strategy. Through a randomized field experiment with a large global publisher, our study seeks to understand how the two most common counter ad-blocking strategies, (i) Wall and (ii) Acceptable Ads Exchange (AAX), affect user engagement differently. Our results show that the Wall strategy causes a lower overall engagement compared to AAX, mainly due to users who refuse to whitelist and leave the website. Over time, the negative impact increases, albeit at a slower speed. Furthermore, heavier users, identified based on the amount of engagement in the pre-treatment period, are less affected by the Wall strategy than lighter users; instrumental users, who read for practical purposes, are less affected than entertainment users. Finally, the Wall strategy has a bigger negative impact on the engagement of popular and new articles, compared to niche and old articles, respectively, as observed by a longer tail in engagement distribution with respect to content. These results on the heterogeneous effects of counter ad-blocking strategies on engagement offer novel and important managerial implications on a publisher’s choice of counter ad-blocking strategy and editorial decisions.
广告拦截工具可以防止广告显示给网络用户。它们日益广泛的使用给那些提供免费内容、依靠展示广告获得收入的在线出版商带来了生存风险。关于发布商采取的反广告拦截策略的研究有限,特别是关于这些策略如何影响用户参与度的研究,从而给选择合适的反广告拦截策略带来了额外的不确定性。通过对一家大型全球发行商的随机实地实验,我们的研究旨在了解两种最常见的反广告拦截策略(1)Wall和(2)Acceptable Ads Exchange (AAX)对用户粘性的不同影响。我们的研究结果显示,与AAX相比,Wall策略导致的整体参与度较低,主要原因是用户拒绝加入白名单并离开网站。随着时间的推移,负面影响会增加,尽管速度会放缓。此外,根据前处理阶段的用户粘性确定的重度用户受“墙”策略的影响要小于轻度用户;以实用为目的的工具性阅读用户受影响要小于娱乐性阅读用户。最后,与小众文章和老文章相比,墙策略对流行文章和新文章的粘性有更大的负面影响,这可以从内容粘性分布的长尾中观察到。这些关于反广告拦截策略对用户粘性的异质性影响的结果,为出版商选择反广告拦截策略和编辑决策提供了新颖而重要的管理启示。
{"title":"A field study on the impact of the counter ad-blocking wall strategy on user engagement","authors":"Michael K. Chen ,&nbsp;Shuai Zhao ,&nbsp;Cristian Borcea ,&nbsp;Yi Chen","doi":"10.1016/j.dss.2025.114525","DOIUrl":"10.1016/j.dss.2025.114525","url":null,"abstract":"<div><div>Ad-blocking tools prevent ads from being shown to web users. Their increasingly widespread usage poses an existential risk to online publishers who provide free content and rely on display ads for revenue. Studies on counter ad-blocking strategies taken by publishers are limited, especially with regard to how these strategies affect user engagement, thus posing additional uncertainties to the selection of a suitable counter ad-blocking strategy. Through a randomized field experiment with a large global publisher, our study seeks to understand how the two most common counter ad-blocking strategies, (i) Wall and (ii) Acceptable Ads Exchange (AAX), affect user engagement differently. Our results show that the Wall strategy causes a lower overall engagement compared to AAX, mainly due to users who refuse to whitelist and leave the website. Over time, the negative impact increases, albeit at a slower speed. Furthermore, heavier users, identified based on the amount of engagement in the pre-treatment period, are less affected by the Wall strategy than lighter users; instrumental users, who read for practical purposes, are less affected than entertainment users. Finally, the Wall strategy has a bigger negative impact on the engagement of popular and new articles, compared to niche and old articles, respectively, as observed by a longer tail in engagement distribution with respect to content. These results on the heterogeneous effects of counter ad-blocking strategies on engagement offer novel and important managerial implications on a publisher’s choice of counter ad-blocking strategy and editorial decisions.</div></div>","PeriodicalId":55181,"journal":{"name":"Decision Support Systems","volume":"198 ","pages":"Article 114525"},"PeriodicalIF":6.8,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145097010","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A cross-platform rumor detection framework considering data privacy protection and different detection capabilities of online social platforms 一个考虑数据隐私保护和网络社交平台不同检测能力的跨平台谣言检测框架
IF 6.8 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-08-28 DOI: 10.1016/j.dss.2025.114524
Xuelong Chen , Jinchao Pan
The anonymity and widespread popularity of online social platforms (OSPs) allow users to share uncertain posts freely, leading to numerous rumors. Similar rumors spread widely across OSPs, resulting in frequent cross-platform rumors (CPRs). Owing to the unique nature of the cross-platform spread, the dual challenges of data privacy protection constraints and differences in the data and detection capabilities of OSPs exacerbate the difficulty of CPR detection. Thus, to detect CPRs effectively, we designed and implemented a novel deep learning framework named Cross Platform Rumor Detection based on Improved Federated Learning (CPRDIFL), which integrates and improves federated learning and the pre-trained Masked and Contextualized BERT (MacBERT). Our framework uses FL to analyze data from OSPs independently, thus avoiding the need for data integration and ensuring the data privacy protection of OSPs. Moreover, MacBERT is deployed on the clients of CPRDIFL to extract contextual features from posts and dynamically update local weights based on the data and detection performance. Weight parameters are dynamically shared between clients and servers and between clients to achieve complementary advantages across OSPs. Our framework was used in six comprehensive experiments in different scenarios, and the experimental results showed that it achieved the best results in CPR detection. This study not only provides an effective solution for CPR detection but also marks a significant step toward the automated detection of cross-OSP information pollution.
网络社交平台的匿名性和广泛普及使得用户可以自由地分享不确定的帖子,从而导致大量谣言。类似的谣言在各个osp中广泛传播,导致跨平台谣言(cpr)频繁出现。由于跨平台传播的独特性,数据隐私保护约束的双重挑战以及各平台数据和检测能力的差异加剧了心肺复苏检测的难度。因此,为了有效地检测谣言,我们设计并实现了一种新的深度学习框架,称为基于改进联邦学习的跨平台谣言检测(CPRDIFL),该框架集成并改进了联邦学习和预训练的蒙面和情境化BERT (MacBERT)。我们的框架使用FL对来自osp的数据进行独立分析,从而避免了数据集成的需要,保证了osp的数据隐私保护。此外,在CPRDIFL的客户端部署MacBERT,从帖子中提取上下文特征,并根据数据和检测性能动态更新局部权重。权重参数在客户端和服务器之间以及客户端之间动态共享,实现跨osp优势互补。我们的框架在不同场景下进行了6次综合实验,实验结果表明,该框架在心肺复苏检测中取得了最好的效果。本研究不仅为CPR检测提供了有效的解决方案,而且标志着跨osp信息污染的自动化检测迈出了重要的一步。
{"title":"A cross-platform rumor detection framework considering data privacy protection and different detection capabilities of online social platforms","authors":"Xuelong Chen ,&nbsp;Jinchao Pan","doi":"10.1016/j.dss.2025.114524","DOIUrl":"10.1016/j.dss.2025.114524","url":null,"abstract":"<div><div>The anonymity and widespread popularity of online social platforms (OSPs) allow users to share uncertain posts freely, leading to numerous rumors. Similar rumors spread widely across OSPs, resulting in frequent cross-platform rumors (CPRs). Owing to the unique nature of the cross-platform spread, the dual challenges of data privacy protection constraints and differences in the data and detection capabilities of OSPs exacerbate the difficulty of CPR detection. Thus, to detect CPRs effectively, we designed and implemented a novel deep learning framework named Cross Platform Rumor Detection based on Improved Federated Learning (CPRDIFL), which integrates and improves federated learning and the pre-trained Masked and Contextualized BERT (MacBERT). Our framework uses FL to analyze data from OSPs independently, thus avoiding the need for data integration and ensuring the data privacy protection of OSPs. Moreover, MacBERT is deployed on the clients of CPRDIFL to extract contextual features from posts and dynamically update local weights based on the data and detection performance. Weight parameters are dynamically shared between clients and servers and between clients to achieve complementary advantages across OSPs. Our framework was used in six comprehensive experiments in different scenarios, and the experimental results showed that it achieved the best results in CPR detection. This study not only provides an effective solution for CPR detection but also marks a significant step toward the automated detection of cross-OSP information pollution.</div></div>","PeriodicalId":55181,"journal":{"name":"Decision Support Systems","volume":"198 ","pages":"Article 114524"},"PeriodicalIF":6.8,"publicationDate":"2025-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144989984","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
How manipulating information affects information diffusion during disasters: The effects of modifying falsehoods versus corrections 在灾难中操纵信息如何影响信息扩散:修改虚假与更正的效果
IF 6.8 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-08-13 DOI: 10.1016/j.dss.2025.114523
Kelvin K. King
Information evolves as it is disseminated on social media. However, studies have largely overlooked a major aspect of the diffusion process: how information is modified, the various dimensions of these modifications, and their roles in the diffusion process. To fill these research gaps, we utilize the Information Manipulation Theory (IMT) as a theoretical lens and a unique panel dataset of 71 falsehoods, propagated during five disasters, to investigate how modifying information affects its diffusion. Our exploratory analysis suggests that at least 65 % of the messages shared are half-truths. Although falsehoods had a higher modification rate for the first 700 h, corrections were modified more aggressively and for 100 h longer after that period, owing to competition. Our empirical analysis suggests that modified information, i.e., information that includes unrelated responses such as deflections, self-referents, additional details, and more information, is generally shared more frequently than unmodified information.
Furthermore, for falsehoods, a one-unit increase in these modifications increases diffusion; however, when manner and quantity modifications increase by one unit for corrections, sharing increases by 115.1 % and 102.2 %, respectively. Although relation modifications from corrections cause an over 149 % increase in sharing at the information diffusion introduction stages, they do not occur in the maturity and decline stages, and are counterproductive in the growth stages. We also find that negatively charged corrections stimulate virality more than positive ones.
These findings have important implications for researchers and decision-makers.
信息随着在社交媒体上的传播而演变。然而,研究在很大程度上忽视了传播过程的一个主要方面:信息是如何被修改的,这些修改的各个方面,以及它们在传播过程中的作用。为了填补这些研究空白,我们利用信息操纵理论(IMT)作为理论透镜和在五次灾难中传播的71个虚假信息的独特面板数据集,来研究修改信息如何影响其传播。我们的探索性分析表明,至少65%的分享信息是半真半假的。虽然谎言在前700小时有较高的修改率,但由于竞争,在此之后更正的修改更积极,并且持续时间更长100小时。我们的实证分析表明,修改后的信息,即包含不相关反应的信息,如偏转、自我指涉、附加细节和更多信息,通常比未修改的信息共享得更频繁。此外,对于谎言,这些修改每增加一个单位,就会增加传播;然而,当修正的方式和数量增加一个单位时,共享分别增加115.1%和102.2%。虽然修正带来的关系修正在信息扩散引入阶段会使共享增加149%以上,但在成熟期和衰退期不会发生,在成长阶段会产生反效果。我们还发现,带负电荷的修正比带正电荷的修正更能刺激病毒式传播。这些发现对研究人员和决策者具有重要意义。
{"title":"How manipulating information affects information diffusion during disasters: The effects of modifying falsehoods versus corrections","authors":"Kelvin K. King","doi":"10.1016/j.dss.2025.114523","DOIUrl":"10.1016/j.dss.2025.114523","url":null,"abstract":"<div><div>Information evolves as it is disseminated on social media. However, studies have largely overlooked a major aspect of the diffusion process: how information is modified, the various dimensions of these modifications, and their roles in the diffusion process. To fill these research gaps, we utilize the Information Manipulation Theory (IMT) as a theoretical lens and a unique panel dataset of 71 falsehoods, propagated during five disasters, to investigate how modifying information affects its diffusion. Our exploratory analysis suggests that at least 65 % of the messages shared are half-truths. Although falsehoods had a higher modification rate for the first 700 h, corrections were modified more aggressively and for 100 h longer after that period, owing to competition. Our empirical analysis suggests that modified information, i.e., information that includes unrelated responses such as deflections, self-referents, additional details, and more information, is generally shared more frequently than unmodified information.</div><div>Furthermore, for falsehoods, a one-unit increase in these modifications increases diffusion; however, when <em>manner</em> and <em>quantity</em> modifications increase by one unit for corrections, sharing increases by 115.1 % and 102.2 %, respectively. Although <em>relation</em> modifications from corrections cause an over 149 % increase in sharing at the information diffusion introduction stages, they do not occur in the maturity and decline stages, and are counterproductive in the growth stages. We also find that negatively charged corrections stimulate virality more than positive ones.</div><div>These findings have important implications for researchers and decision-makers.</div></div>","PeriodicalId":55181,"journal":{"name":"Decision Support Systems","volume":"197 ","pages":"Article 114523"},"PeriodicalIF":6.8,"publicationDate":"2025-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144878488","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Data disclosure strategy: Navigating the balance between privacy and profit in a dynamic system 数据披露策略:动态系统中隐私与利润的平衡
IF 6.8 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-08-11 DOI: 10.1016/j.dss.2025.114510
Cheng-Han Wu
Digital platforms play a crucial role in our interconnected society, relying on user-disclosed data to enhance advertising revenue and user experiences and provide free services. While data accumulation benefits both platforms and users, it raises privacy concerns. This study explores the interaction between user data disclosure strategies and profitability for a platform and a developer, considering three strategies: mandatory data disclosure with free-to-use, mandatory disclosure with pay-to-use, and user-selective disclosure, allowing payment without data sharing. We formulate a dynamic optimization problem to capture how user data accumulation evolves and influences firm decisions. This framework also degenerates into a static setting for comparison, allowing us to assess the impact of dynamic evolution. Our findings reveal that while static models favor payment-based strategies, dynamic models entail a transition from a free-to-use model, facilitating early-stage data accumulation, to a selective disclosure model that balances privacy concerns and profitability. These findings offer guidance for managers in developing adaptive data disclosure strategies that optimize profitability while addressing user privacy concerns.
数字平台在我们这个互联的社会中扮演着至关重要的角色,依靠用户披露的数据来提高广告收入和用户体验,并提供免费服务。虽然数据积累对平台和用户都有利,但它引发了隐私问题。本研究探讨了用户数据披露策略与平台和开发商盈利能力之间的相互作用,考虑了三种策略:免费使用的强制性数据披露,付费使用的强制性数据披露,以及用户选择性披露,允许在不共享数据的情况下付费。我们制定了一个动态优化问题来捕捉用户数据积累如何演变和影响公司决策。这个框架也退化为一个静态的比较设置,允许我们评估动态进化的影响。我们的研究结果表明,静态模式有利于基于付费的策略,而动态模式则需要从免费使用模式(促进早期数据积累)过渡到平衡隐私问题和盈利能力的选择性披露模式。这些发现为管理人员开发适应性数据披露策略提供了指导,这些策略可以在解决用户隐私问题的同时优化盈利能力。
{"title":"Data disclosure strategy: Navigating the balance between privacy and profit in a dynamic system","authors":"Cheng-Han Wu","doi":"10.1016/j.dss.2025.114510","DOIUrl":"10.1016/j.dss.2025.114510","url":null,"abstract":"<div><div>Digital platforms play a crucial role in our interconnected society, relying on user-disclosed data to enhance advertising revenue and user experiences and provide free services. While data accumulation benefits both platforms and users, it raises privacy concerns. This study explores the interaction between user data disclosure strategies and profitability for a platform and a developer, considering three strategies: mandatory data disclosure with free-to-use, mandatory disclosure with pay-to-use, and user-selective disclosure, allowing payment without data sharing. We formulate a dynamic optimization problem to capture how user data accumulation evolves and influences firm decisions. This framework also degenerates into a static setting for comparison, allowing us to assess the impact of dynamic evolution. Our findings reveal that while static models favor payment-based strategies, dynamic models entail a transition from a free-to-use model, facilitating early-stage data accumulation, to a selective disclosure model that balances privacy concerns and profitability. These findings offer guidance for managers in developing adaptive data disclosure strategies that optimize profitability while addressing user privacy concerns.</div></div>","PeriodicalId":55181,"journal":{"name":"Decision Support Systems","volume":"197 ","pages":"Article 114510"},"PeriodicalIF":6.8,"publicationDate":"2025-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144841753","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A friend or a foe? The effect of generative artificial intelligence on creator contributions on original work sharing platforms 朋友还是敌人?生成式人工智能对原创作品分享平台创作者贡献的影响
IF 6.8 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-08-07 DOI: 10.1016/j.dss.2025.114513
Shan Liu , Wenxuan Hu , Baojun Gao
While generative artificial intelligence (GAI) is increasingly used to create content, it is often criticized for collecting and training private data and induces potential copy infringement issue. This dilemma leaves a question of whether GAI increases or decreases creators' work sharing. Drawn on protection motivation theory, this study examines how the launch of a GAI system affects creators' contributions on an original work sharing platform. We discover that GAI poses a threat to drawing-category creators, leading to a significant crowding-out effect on their contributions. Specifically, compared with that of non-drawing-category creators, the work sharing of drawing-category creators decreases by 19.64 % and 14.29 % within a short period after the launch and removal of the GAI system, respectively. We discover that creators' protective behavior is driven by GAI-related copyright infringement. Compared with creators without copyright protection, those with copyright protection are more inclined to cease contributions or even leave the platform. We further find that among copyright-protected creators, top creators, evidenced by their acquisition of a large number of supporters or platform honor titles, exhibit more pronounced responses to protect their works due to their higher coping efficacy. Notably, this threat reduces creators' sharing behavior or even lead to their exit from the platform. Nevertheless, such reduction is likely to gradually recover once the threat subsides. Overall, our findings have important implications for whether and how platform managers adopt GAI systems, especially in an original work sharing context.
虽然生成式人工智能(GAI)越来越多地用于创建内容,但它经常因收集和训练私人数据而受到批评,并引发潜在的复制侵权问题。这种困境带来了一个问题,即GAI是增加还是减少了创作者的作品分享。本研究运用保护动机理论,考察GAI制度的推出对创作者在原创作品分享平台上的贡献有何影响。我们发现GAI对绘画类创作者构成了威胁,导致他们的贡献受到明显的挤出效应。具体而言,与非绘图类创作者相比,在GAI系统上线和下线后的短时间内,绘图类创作者的作品分享率分别下降了19.64%和14.29%。我们发现创作者的保护行为是由与人工智能相关的版权侵权驱动的。与没有版权保护的创作者相比,有版权保护的创作者更倾向于停止创作甚至离开平台。我们进一步发现,在受版权保护的创作者中,获得大量支持者或平台荣誉称号的顶级创作者由于其更高的应对效能而表现出更明显的保护作品的反应。值得注意的是,这种威胁减少了创作者的分享行为,甚至导致他们退出平台。然而,一旦威胁消退,这种减少可能会逐渐恢复。总的来说,我们的发现对于平台管理者是否以及如何采用GAI系统具有重要意义,特别是在原始工作共享环境中。
{"title":"A friend or a foe? The effect of generative artificial intelligence on creator contributions on original work sharing platforms","authors":"Shan Liu ,&nbsp;Wenxuan Hu ,&nbsp;Baojun Gao","doi":"10.1016/j.dss.2025.114513","DOIUrl":"10.1016/j.dss.2025.114513","url":null,"abstract":"<div><div>While generative artificial intelligence (GAI) is increasingly used to create content, it is often criticized for collecting and training private data and induces potential copy infringement issue. This dilemma leaves a question of whether GAI increases or decreases creators' work sharing. Drawn on protection motivation theory, this study examines how the launch of a GAI system affects creators' contributions on an original work sharing platform. We discover that GAI poses a threat to drawing-category creators, leading to a significant crowding-out effect on their contributions. Specifically, compared with that of non-drawing-category creators, the work sharing of drawing-category creators decreases by 19.64 % and 14.29 % within a short period after the launch and removal of the GAI system, respectively. We discover that creators' protective behavior is driven by GAI-related copyright infringement. Compared with creators without copyright protection, those with copyright protection are more inclined to cease contributions or even leave the platform. We further find that among copyright-protected creators, top creators, evidenced by their acquisition of a large number of supporters or platform honor titles, exhibit more pronounced responses to protect their works due to their higher coping efficacy. Notably, this threat reduces creators' sharing behavior or even lead to their exit from the platform. Nevertheless, such reduction is likely to gradually recover once the threat subsides. Overall, our findings have important implications for whether and how platform managers adopt GAI systems, especially in an original work sharing context.</div></div>","PeriodicalId":55181,"journal":{"name":"Decision Support Systems","volume":"197 ","pages":"Article 114513"},"PeriodicalIF":6.8,"publicationDate":"2025-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144828542","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Exploring users' post-adoption use of generative AI: An attitudinal ambivalence perspective 探索用户采用生成式人工智能后的使用:态度矛盾的观点
IF 6.8 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2025-08-05 DOI: 10.1016/j.dss.2025.114521
Jing Zhang , Zhen Shao , Lin Zhang , Jose Benitez
As generative AI (genAI) has advanced, the intricate interplay of its technical potential and ethical perils has become more pronounced, fostering a growing ambivalence in users' attitudes towards genAI technology. Drawing upon the attitudinal ambivalence perspective (i.e., the simultaneous occurrence of positive and negative evaluations of genAI use) and cognitive appraisal theory of emotion, our study proposes and tests an integrative research model to understand how users' attitudinal ambivalence towards genAI technology navigates their negative and positive emotional responses and shapes their post-adoption behaviors. We surveyed 530 genAI users and employed the structural equation modeling approach to test our research model. We find that attitudinal ambivalence is significantly associated with users' extended use and avoidance through the mediation of user trust and fear. Additionally, transparency significantly moderates the effects of attitudinal ambivalence on user trust and fear. Our study advances nature and consequences of attitudinal ambivalence towards genAI and provides insights for practitioners contemplating deploying genAI.
随着生成式人工智能(genAI)的发展,其技术潜力和伦理风险之间错综复杂的相互作用变得更加明显,导致用户对基因人工智能技术的态度日益矛盾。基于态度矛盾观(即对基因人工智能的正面和负面评价同时出现)和情绪认知评价理论,本研究提出并检验了一个综合研究模型,以了解用户对基因人工智能技术的态度矛盾如何引导他们的消极和积极情绪反应,并影响他们的采用后行为。我们调查了530名genAI用户,并采用结构方程建模方法对我们的研究模型进行了测试。研究发现,通过用户信任和恐惧的中介,态度矛盾心理与用户的扩展使用和回避显著相关。此外,透明度显著调节态度矛盾心理对用户信任和恐惧的影响。我们的研究推进了对基因人工智能态度矛盾的本质和后果,并为考虑部署基因人工智能的从业者提供了见解。
{"title":"Exploring users' post-adoption use of generative AI: An attitudinal ambivalence perspective","authors":"Jing Zhang ,&nbsp;Zhen Shao ,&nbsp;Lin Zhang ,&nbsp;Jose Benitez","doi":"10.1016/j.dss.2025.114521","DOIUrl":"10.1016/j.dss.2025.114521","url":null,"abstract":"<div><div>As generative AI (genAI) has advanced, the intricate interplay of its technical potential and ethical perils has become more pronounced, fostering a growing ambivalence in users' attitudes towards genAI technology. Drawing upon the attitudinal ambivalence perspective (i.e., the simultaneous occurrence of positive and negative evaluations of genAI use) and cognitive appraisal theory of emotion, our study proposes and tests an integrative research model to understand how users' attitudinal ambivalence towards genAI technology navigates their negative and positive emotional responses and shapes their post-adoption behaviors. We surveyed 530 genAI users and employed the structural equation modeling approach to test our research model. We find that attitudinal ambivalence is significantly associated with users' extended use and avoidance through the mediation of user trust and fear. Additionally, transparency significantly moderates the effects of attitudinal ambivalence on user trust and fear. Our study advances nature and consequences of attitudinal ambivalence towards genAI and provides insights for practitioners contemplating deploying genAI.</div></div>","PeriodicalId":55181,"journal":{"name":"Decision Support Systems","volume":"197 ","pages":"Article 114521"},"PeriodicalIF":6.8,"publicationDate":"2025-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144841759","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Decision Support Systems
全部 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学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1