Decision Support Systems最新文献

{"title":"What can we learn from multimorbidity? A deep dive from its risk patterns to the corresponding patient profiles","authors":"Xiaochen Wang ,&nbsp;Runtong Zhang ,&nbsp;Xiaomin Zhu","doi":"10.1016/j.dss.2024.114313","DOIUrl":"10.1016/j.dss.2024.114313","url":null,"abstract":"<div><p>Multimorbidity, the presence of two or more chronic conditions within an individual, represents one of the most intricate challenges for global health systems. Traditional single-disease management often fails to address the multifaceted nature of multimorbidity. Network model emerges as a growing field for elucidating the interconnections among multimorbidity. However, the field lacks a standardized method to compute and visually represent of these networks. Given the challenges, this study proposes a three-stage methodology to decipher multimorbidity. First, we integrate the Failure Modes and Effects Analysis (FMEA) method with the multimorbidity encapsulation framework to develop the Multimorbidity Risk Network (MRN). Second, we use complex network techniques to identify high-risk patterns within MRN communities. Finally, we apply machine learning techniques to correlate these communities with the biological attributes of patients that have been marginalized in most studies. Our approach advocates a paradigm shift from the conventional focus on single diseases to a holistic, patient-centric approach, providing decision-makers with integrated information technology artifacts for deciphering the multimorbidity.</p></div>","PeriodicalId":55181,"journal":{"name":"Decision Support Systems","volume":"186 ","pages":"Article 114313"},"PeriodicalIF":6.7,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142151015","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}

{"title":"Emotional expressions of care and concern by customer service chatbots: Improved customer attitudes despite perceived inauthenticity","authors":"Junbo Zhang ,&nbsp;Jiandong Lu ,&nbsp;Xiaolei Wang ,&nbsp;Luning Liu ,&nbsp;Yuqiang Feng","doi":"10.1016/j.dss.2024.114314","DOIUrl":"10.1016/j.dss.2024.114314","url":null,"abstract":"<div><p>In customer service, emotional expressions by chatbots are considered a promising direction to improve customer experience. However, there is a lack of comprehensive understanding of how and when chatbots' emotional expressions improve customer attitudes. Although chatbots' emotional expressions of care and concern may feel inauthentic to customers in the inferential path, which can negatively affects customer attitudes, we propose that the positive effect of the affective reactions path can result in a positive effect on customer attitude based on the dual-path view of Emotions as Social Information (EASI). The relative strengths of the two EASI paths can be moderated, and we explored the moderating effects of rational thinking styles (information processing in EASI) and beliefs in computer emotion (perceived appropriateness in EASI). According to EASI, situation can affect the meaning of emotions, so we conducted experiments in two situations. With chatbot identity disclosure, we found that the chatbot's emotional expressions reduce customers' perceived authenticity (reflecting the inferential path in EASI) but ultimately improve customer attitudes. Belief in computer emotions and rational thinking style moderated the negative relationship between emotional expressions and authenticity. With chatbot identity non-disclosure, the chatbot's emotional expressions still improve customer attitudes but with no effect on authenticity. Because there is high likelihood of chatbot identities being discovered by customers, this finding of the moderating effect of perceived humanness on authenticity is highly relevant. Our findings make important contributions to research on computer emotion and service authenticity.</p></div>","PeriodicalId":55181,"journal":{"name":"Decision Support Systems","volume":"186 ","pages":"Article 114314"},"PeriodicalIF":6.7,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142150984","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}

{"title":"Approaches to improve preprocessing for Latent Dirichlet Allocation topic modeling","authors":"Jamie Zimmermann ,&nbsp;Lance E. Champagne ,&nbsp;John M. Dickens ,&nbsp;Benjamin T. Hazen","doi":"10.1016/j.dss.2024.114310","DOIUrl":"10.1016/j.dss.2024.114310","url":null,"abstract":"<div><p>As a part of natural language processing (NLP), the intent of topic modeling is to identify topics in textual corpora with limited human input. Current topic modeling techniques, like Latent Dirichlet Allocation (LDA), are limited in the pre-processing steps and currently require human judgement, increasing analysis time and opportunities for error. The purpose of this research is to allay some of those limitations by introducing new approaches to improve coherence without adding computational complexity and provide an objective method for determining the number of topics within a corpus. First, we identify a requirement for a more robust stop words list and introduce a new dimensionality-reduction heuristic that exploits the number of words within a document to infer importance to word choice. Second, we develop an eigenvalue technique to determine the number of topics within a corpus. Third, we combine all of these techniques into the Zimm Approach, which produces higher quality results than LDA in determining the number of topics within a corpus. The Zimm Approach, when tested against various subsets of the 20newsgroup dataset, produced the correct number of topics in 7 of 9 subsets vs. 0 of 9 using highest coherence value produced by LDA.</p></div>","PeriodicalId":55181,"journal":{"name":"Decision Support Systems","volume":"185 ","pages":"Article 114310"},"PeriodicalIF":6.7,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142088817","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}

{"title":"Learning-based dynamic pricing strategy with pay-per-chapter mode for online publisher with case study of COL","authors":"Lang Fang,&nbsp;Zhendong Pan,&nbsp;Jiafu Tang","doi":"10.1016/j.dss.2024.114311","DOIUrl":"10.1016/j.dss.2024.114311","url":null,"abstract":"<div><p>We consider how to make dynamic pricing decision for Chinese Online (COL) at <em>T</em> time-points, an online publisher that allow authors to sell their ongoing book projects. Instead of paying for a book, readers pay for each chapter (pay-per-chapter mode) of the ongoing book project. This mode allows readers to pay for as many chapters as they want without taking the risk that the releasing of new chapters might be delayed or stopped. Despite of the dynamics of chapter-by-chapter released of COL products, the fixed pricing strategy (FPS) does not make fully use of the reading data generated by releasing chapters of the ongoing book. We propose a learning-based dynamic pricing strategy (LDPS) that exploits the newly information to maximize cumulative revenue for the publisher. The LDPS captures the ever changing features of readers. It employs the Thompson sampling method to balance the exploration of investigating different prices sufficiently with the exploitation of settling on the optimal price. Taking COL as a case study and implementing our strategy in the context of the aforementioned real-life data set, we show that LDPS outperform several classical strategies such as Greedy, Prior-Free TS and Prior-Given TS, and average revenue of LDPS is increased by 0.5 % average per time-point compared to the publisher's historical decisions. We also provide some management implications for the COL publisher by analyzing the pricing range of different genres of books and the choice of the exploration threshold parameter.</p></div>","PeriodicalId":55181,"journal":{"name":"Decision Support Systems","volume":"186 ","pages":"Article 114311"},"PeriodicalIF":6.7,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142150986","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}

{"title":"Reliability estimation for individual predictions in machine learning systems: A model reliability-based approach","authors":"Xiaoge Zhang ,&nbsp;Indranil Bose","doi":"10.1016/j.dss.2024.114305","DOIUrl":"10.1016/j.dss.2024.114305","url":null,"abstract":"&lt;div&gt;&lt;p&gt;The conventional aggregated performance measure (i.e., mean squared error) with respect to the whole dataset would not provide desired safety and quality assurance for each individual prediction made by a machine learning model in risk-sensitive regression problems. In this paper, we propose an informative indicator &lt;span&gt;&lt;math&gt;&lt;mi&gt;ℛ&lt;/mi&gt;&lt;mfenced&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;/mfenced&gt;&lt;/math&gt;&lt;/span&gt; to quantify model reliability for individual prediction (MRIP) for the purpose of safeguarding the usage of machine learning (ML) models in mission-critical applications. Specifically, we define the reliability of a ML model with respect to its prediction on each individual input &lt;span&gt;&lt;math&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; as the probability of the observed difference between the prediction of ML model and the actual observation falling within a small interval when the input &lt;span&gt;&lt;math&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; varies within a small range subject to a preset distance constraint, namely &lt;span&gt;&lt;math&gt;&lt;mi&gt;ℛ&lt;/mi&gt;&lt;mfenced&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;/mfenced&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mi&gt;P&lt;/mi&gt;&lt;mfenced&gt;&lt;mrow&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;msup&gt;&lt;mi&gt;y&lt;/mi&gt;&lt;mo&gt;∗&lt;/mo&gt;&lt;/msup&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;msup&gt;&lt;mover&gt;&lt;mi&gt;y&lt;/mi&gt;&lt;mo&gt;̂&lt;/mo&gt;&lt;/mover&gt;&lt;mo&gt;∗&lt;/mo&gt;&lt;/msup&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mspace&gt;&lt;/mspace&gt;&lt;mo&gt;≤&lt;/mo&gt;&lt;mi&gt;ε&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;msup&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;mo&gt;∗&lt;/mo&gt;&lt;/msup&gt;&lt;mo&gt;∈&lt;/mo&gt;&lt;mi&gt;B&lt;/mi&gt;&lt;mfenced&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;/mfenced&gt;&lt;/mrow&gt;&lt;/mfenced&gt;&lt;/math&gt;&lt;/span&gt;, where &lt;span&gt;&lt;math&gt;&lt;msup&gt;&lt;mi&gt;y&lt;/mi&gt;&lt;mo&gt;∗&lt;/mo&gt;&lt;/msup&gt;&lt;/math&gt;&lt;/span&gt; denotes the observed target value for the input &lt;span&gt;&lt;math&gt;&lt;msup&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;mo&gt;∗&lt;/mo&gt;&lt;/msup&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; &lt;span&gt;&lt;math&gt;&lt;msup&gt;&lt;mover&gt;&lt;mi&gt;y&lt;/mi&gt;&lt;mo&gt;̂&lt;/mo&gt;&lt;/mover&gt;&lt;mo&gt;∗&lt;/mo&gt;&lt;/msup&gt;&lt;/math&gt;&lt;/span&gt; denotes the model prediction for the input &lt;span&gt;&lt;math&gt;&lt;msup&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;mo&gt;∗&lt;/mo&gt;&lt;/msup&gt;&lt;/math&gt;&lt;/span&gt;, and &lt;span&gt;&lt;math&gt;&lt;msup&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;mo&gt;∗&lt;/mo&gt;&lt;/msup&gt;&lt;/math&gt;&lt;/span&gt; is an input in the neighborhood of &lt;span&gt;&lt;math&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; subject to the constraint &lt;span&gt;&lt;math&gt;&lt;mi&gt;B&lt;/mi&gt;&lt;mfenced&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;/mfenced&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mfenced&gt;&lt;mrow&gt;&lt;mfenced&gt;&lt;msup&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;mo&gt;∗&lt;/mo&gt;&lt;/msup&gt;&lt;/mfenced&gt;&lt;mspace&gt;&lt;/mspace&gt;&lt;mfenced&gt;&lt;mrow&gt;&lt;msup&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;mo&gt;∗&lt;/mo&gt;&lt;/msup&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;/mrow&gt;&lt;/mfenced&gt;&lt;mo&gt;≤&lt;/mo&gt;&lt;mi&gt;δ&lt;/mi&gt;&lt;/mrow&gt;&lt;/mfenced&gt;&lt;/math&gt;&lt;/span&gt;. The developed MRIP indicator &lt;span&gt;&lt;math&gt;&lt;mi&gt;ℛ&lt;/mi&gt;&lt;mfenced&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;/mfenced&gt;&lt;/math&gt;&lt;/span&gt; provides a direct, objective, quantitative, and general-purpose measure of “reliability” or the probability of success of the ML model for each individual prediction by fully exploiting the local information associated with the input &lt;span&gt;&lt;math&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; and ML model. Next, to mitigate the intensive computational effort involved in MRIP estimation, we develop a two-stage ML-based framework to directly learn the relationship between &lt;span&gt;&lt;math&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; and its MRIP &lt;span&gt;&lt;math&gt;&lt;mi&gt;ℛ&lt;/mi&gt;&lt;mfenced&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;/mfenced&gt;&lt;/math&gt;&lt;/span&gt;, thus enabling to provide the reliability estimate &lt;span&gt;&lt;math&gt;&lt;mi&gt;ℛ&lt;/mi&gt;&lt;mfenced&gt;&lt;mi&gt;x&lt;/mi&gt;&lt;/mfenced&gt;&lt;/math&gt;&lt;/span&gt; for any unseen input instantly. Thirdly, we pr","PeriodicalId":55181,"journal":{"name":"Decision Support Systems","volume":"186 ","pages":"Article 114305"},"PeriodicalIF":6.7,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142151016","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}

{"title":"HEX: Human-in-the-loop explainability via deep reinforcement learning","authors":"Michael T. Lash","doi":"10.1016/j.dss.2024.114304","DOIUrl":"10.1016/j.dss.2024.114304","url":null,"abstract":"<div><div>The use of machine learning (ML) models in decision-making contexts, particularly those used in high-stakes decision-making, are fraught with issue and peril since a person – not a machine – must ultimately be held accountable for the consequences of decisions made using such systems. Machine learning explainability (MLX) promises to provide decision-makers with prediction-specific rationale, assuring them that the model-elicited predictions are made <em>for the right reasons</em> and are thus reliable. Few works explicitly consider this key human-in-the-loop (HITL) component, however. In this work we propose HEX, a human-in-the-loop deep reinforcement learning approach to MLX. HEX incorporates 0-distrust projection to synthesize decider-specific explainers that produce explanations strictly in terms of a decider’s preferred explanatory features using any classification model. Our formulation explicitly considers the decision boundary of the ML model in question using a proposed <em>explanatory point</em> mode of explanation, thus ensuring explanations are specific to the ML model in question. We empirically evaluate HEX against other competing methods, finding that HEX is competitive with the state-of-the-art and outperforms other methods in human-in-the-loop scenarios. We conduct a randomized, controlled laboratory experiment utilizing actual explanations elicited from both HEX and competing methods. We causally establish that our method increases decider’s trust and tendency to rely on trusted features.</div></div>","PeriodicalId":55181,"journal":{"name":"Decision Support Systems","volume":"187 ","pages":"Article 114304"},"PeriodicalIF":6.7,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142531486","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Paradigm changing metaverse: Future research directions in design, technology adoption and use, and impacts","authors":"Viswanath Venkatesh","doi":"10.1016/j.dss.2024.114307","DOIUrl":"10.1016/j.dss.2024.114307","url":null,"abstract":"<div><div>Rooted in the paradigm changes that accompany the metaverse, this essay proposes research directions covering three major and interconnected aspects of the metaverse ecosystem. First, I propose five research directions connected to the design of technological solutions for the metaverse. Second, I propose five research directions tied to the study of the impact of the adoption and use of these developed technological solutions. Third, I propose the five research directions that relate to understanding the impacts of the so-developed and so-adopted technological solutions. Finally, I propose five overarching research directions that cut across the design-adoption-impacts framework. Taken together, these directions provide holistic guidance for the investigation of the metaverse ecosystem and its short-, medium-, and long-term implications for research.</div></div>","PeriodicalId":55181,"journal":{"name":"Decision Support Systems","volume":"188 ","pages":"Article 114307"},"PeriodicalIF":6.7,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142702534","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}

{"title":"Generalized visible curvature: An indicator for bubble identification and price trend prediction in cryptocurrencies","authors":"Qun Zhang ,&nbsp;Canxuan Xie ,&nbsp;Zhaoju Weng ,&nbsp;Didier Sornette ,&nbsp;Ke Wu","doi":"10.1016/j.dss.2024.114309","DOIUrl":"10.1016/j.dss.2024.114309","url":null,"abstract":"<div><p>We propose a novel curvature-based indicator constructed on log-price time series that captures an interplay between trend, acceleration, and volatility found relevant to quantify risks and improve trading strategies. We apply it to diagnose explosive bubble-like behaviors in cryptocurrency price time series and provide early warning signals of impending market shifts or increased volatility. This improves significantly on standard statistical tests such as the Generalized Supremum Augmented Dickey–Fuller (GSADF) and the Backward SADF tests. Furthermore, the incorporation of our curvature-based indicator as a feature into the Light Gradient Boosting Machine enhances its predictive capabilities, as measured by classification accuracy and trading performance.</p></div>","PeriodicalId":55181,"journal":{"name":"Decision Support Systems","volume":"185 ","pages":"Article 114309"},"PeriodicalIF":6.7,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142083568","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}

{"title":"Enhanced (cyber) situational awareness: Using interpretable principal component analysis (iPCA) to automate vulnerability severity scoring","authors":"Motahareh Pourbehzadi ,&nbsp;Giti Javidi ,&nbsp;C. Jordan Howell ,&nbsp;Eden Kamar ,&nbsp;Ehsan Sheybani","doi":"10.1016/j.dss.2024.114308","DOIUrl":"10.1016/j.dss.2024.114308","url":null,"abstract":"<div><p>The Common Vulnerability Scoring System (CVSS) is widely used in the cybersecurity industry to assess the severity of vulnerabilities. However, manual assessments and human error can lead to delays and inconsistencies. This study employs situational awareness theory to develop an automated decision support system, integrating perception, comprehension, and projection components to enhance effectiveness. Specifically, an interpretable principal component analysis (iPCA) combined with machine learning is utilized to forecast CVSS scores using text descriptions from the Common Vulnerabilities and Exposures (CVE) database. Different forecasting approaches, including traditional machine learning models, Long-Short Term Memory Neural Networks, and Transformer architectures (ChatGPT) are compared to determine the best performance. The results show that iPCA combined with support vector regression achieves a high performance (R² = 98%) in predicting CVSS scores using CVE text descriptions. The results indicate that the variability, length, and details in the vulnerability description contribute to the performance of the transformer model. These findings are consistent across vulnerability descriptions from six companies between 2017 and 2019. The study's outcomes have the potential to enhance organizations' security posture, improving situational awareness and enabling better managerial decision-making in cybersecurity.</p></div>","PeriodicalId":55181,"journal":{"name":"Decision Support Systems","volume":"186 ","pages":"Article 114308"},"PeriodicalIF":6.7,"publicationDate":"2024-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142150985","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}

{"title":"Analyzing the online word of mouth dynamics: A novel approach","authors":"Xian Cao ,&nbsp;Timothy B. Folta ,&nbsp;Hongfei Li ,&nbsp;Ruoqing Zhu","doi":"10.1016/j.dss.2024.114306","DOIUrl":"10.1016/j.dss.2024.114306","url":null,"abstract":"<div><p>In today's digital economy, virtually everything from products and services to political debates and cultural phenomena can spark WOM on social media. Analyzing online WOM poses at least three challenges. First, online WOM typically consists of unstructured data that can transform into myriad variables, necessitating effective dimension reduction. Second, online WOM is often continuous and dynamic, with the potential for rapid, time-varying changes. Third, significant events may trigger symmetric or asymmetric responses across various entities, resulting in “bursty” and intense WOM from multiple sources. To address these challenges, we introduce a new computationally efficient method—multi-view sequential canonical covariance analysis. This method is designed to solve the myriad online WOM conversational dimensions, detect online WOM dynamic trends, and examine the shared online WOM across different entities. This approach not only enhances the capability to swiftly interpret and respond to online WOM data but also shows potential to significantly improve decision-making processes across various contexts. We illustrate the method's benefits through two empirical examples, demonstrating its potential to provide profound insights into online WOM dynamics and its extensive applicability in both academic research and practical scenarios.</p></div>","PeriodicalId":55181,"journal":{"name":"Decision Support Systems","volume":"185 ","pages":"Article 114306"},"PeriodicalIF":6.7,"publicationDate":"2024-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141998137","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}