The influence maximization problem has several issues, including low infection rates and high time complexity. Many proposed methods are not suitable for large-scale networks due to their time complexity or free parameter usage. To address these challenges, this article proposes a local heuristic called Embedding Technique for Influence Maximization (ETIM) that uses shell decomposition, graph embedding, and reduction, as well as combined local structural features. The algorithm selects candidate nodes based on their connections among network shells and topological features, reducing the search space and computational overhead. It uses a deep learning-based node embedding technique to create a multidimensional vector of candidate nodes and calculates the dependency on spreading for each node based on local topological features. Finally, influential nodes are identified using the results of the previous phases and newly defined local features. The proposed algorithm is evaluated using the independent cascade model, showing its competitiveness and ability to achieve the best performance in terms of solution quality. Compared with the collective influence global algorithm, ETIM is significantly faster and improves the infection rate by an average of 12%.
{"title":"Maximizing Influence in Social Networks Using Combined Local Features and Deep Learning-Based Node Embedding.","authors":"Asgarali Bouyer, Hamid Ahmadi Beni, Amin Golzari Oskouei, Alireza Rouhi, Bahman Arasteh, Xiaoyang Liu","doi":"10.1089/big.2023.0117","DOIUrl":"10.1089/big.2023.0117","url":null,"abstract":"<p><p>The influence maximization problem has several issues, including low infection rates and high time complexity. Many proposed methods are not suitable for large-scale networks due to their time complexity or free parameter usage. To address these challenges, this article proposes a local heuristic called Embedding Technique for Influence Maximization (ETIM) that uses shell decomposition, graph embedding, and reduction, as well as combined local structural features. The algorithm selects candidate nodes based on their connections among network shells and topological features, reducing the search space and computational overhead. It uses a deep learning-based node embedding technique to create a multidimensional vector of candidate nodes and calculates the dependency on spreading for each node based on local topological features. Finally, influential nodes are identified using the results of the previous phases and newly defined local features. The proposed algorithm is evaluated using the independent cascade model, showing its competitiveness and ability to achieve the best performance in terms of solution quality. Compared with the collective influence global algorithm, ETIM is significantly faster and improves the infection rate by an average of 12%.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":"379-397"},"PeriodicalIF":2.6,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142480288","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}
Pub Date : 2025-10-01Epub Date: 2024-10-23DOI: 10.1089/big.2023.0131
Qi Ouyang, Hongchang Chen, Shuxin Liu, Liming Pu, Dongdong Ge, Ke Fan
Predicting propagation cascades is crucial for understanding information propagation in social networks. Existing methods always focus on structure or order of infected users in a single cascade sequence, ignoring the global dependencies of cascades and users, which is insufficient to characterize their dynamic interaction preferences. Moreover, existing methods are poor at addressing the problem of model robustness. To address these issues, we propose a predication model named DropMessage Hypergraph Attention Networks, which constructs a hypergraph based on the cascade sequence. Specifically, to dynamically obtain user preferences, we divide the diffusion hypergraph into multiple subgraphs according to the time stamps, develop hypergraph attention networks to explicitly learn complete interactions, and adopt a gated fusion strategy to connect them for user cascade prediction. In addition, a new drop immediately method DropMessage is added to increase the robustness of the model. Experimental results on three real-world datasets indicate that proposed model significantly outperforms the most advanced information propagation prediction model in both MAP@k and Hits@K metrics, and the experiment also proves that the model achieves more significant prediction performance than the existing model under data perturbation.
{"title":"DMHANT: DropMessage Hypergraph Attention Network for Information Propagation Prediction.","authors":"Qi Ouyang, Hongchang Chen, Shuxin Liu, Liming Pu, Dongdong Ge, Ke Fan","doi":"10.1089/big.2023.0131","DOIUrl":"10.1089/big.2023.0131","url":null,"abstract":"<p><p>Predicting propagation cascades is crucial for understanding information propagation in social networks. Existing methods always focus on structure or order of infected users in a single cascade sequence, ignoring the global dependencies of cascades and users, which is insufficient to characterize their dynamic interaction preferences. Moreover, existing methods are poor at addressing the problem of model robustness. To address these issues, we propose a predication model named DropMessage Hypergraph Attention Networks, which constructs a hypergraph based on the cascade sequence. Specifically, to dynamically obtain user preferences, we divide the diffusion hypergraph into multiple subgraphs according to the time stamps, develop hypergraph attention networks to explicitly learn complete interactions, and adopt a gated fusion strategy to connect them for user cascade prediction. In addition, a new drop immediately method DropMessage is added to increase the robustness of the model. Experimental results on three real-world datasets indicate that proposed model significantly outperforms the most advanced information propagation prediction model in both MAP@k and Hits@K metrics, and the experiment also proves that the model achieves more significant prediction performance than the existing model under data perturbation.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":"364-378"},"PeriodicalIF":2.6,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142512575","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}
Pub Date : 2025-10-01Epub Date: 2025-07-08DOI: 10.1089/big.2024.0094
Kenan Menguc, Alper Yilmaz
This research highlights the importance of accurately analyzing real-world multilayer network problems and introduces effective solutions. Whether simulating protein-protein network, transportation network, or a social network, representation and analysis over these networks are crucial. Multilayer networks, that contain added layers, may undergo dynamic transformations over time akin to single-layer networks that experience changes over time. These dynamic networks, that expand and contract, can be optimized by guidance from human operators if the transient changes are known and can be controlled. For the expansion and contraction of networks, this study introduces two distinct algorithms designed to make optimal decisions across dynamic changes of a multilayer network. The main strategy is to minimize the standard deviation across betweenness centrality of the edges in a complex network. The approaches we introduce incorporate diverse constraints into a multilayer weighted network, probing the network's expansion or contraction under various conditions represented as objective functions. The addition of changing of objective function enhances the model's adaptability to solve a wide array of problem types. In this way, complex network structures representing real-world problems can be mathematically modeled which makes it easier to make informed decisions.
{"title":"Optimizing Multilayer Networks Through Time-Dependent Decision-Making: A Comparative Study.","authors":"Kenan Menguc, Alper Yilmaz","doi":"10.1089/big.2024.0094","DOIUrl":"10.1089/big.2024.0094","url":null,"abstract":"<p><p>This research highlights the importance of accurately analyzing real-world multilayer network problems and introduces effective solutions. Whether simulating protein-protein network, transportation network, or a social network, representation and analysis over these networks are crucial. Multilayer networks, that contain added layers, may undergo dynamic transformations over time akin to single-layer networks that experience changes over time. These dynamic networks, that expand and contract, can be optimized by guidance from human operators if the transient changes are known and can be controlled. For the expansion and contraction of networks, this study introduces two distinct algorithms designed to make optimal decisions across dynamic changes of a multilayer network. The main strategy is to minimize the standard deviation across betweenness centrality of the edges in a complex network. The approaches we introduce incorporate diverse constraints into a multilayer weighted network, probing the network's expansion or contraction under various conditions represented as objective functions. The addition of changing of objective function enhances the model's adaptability to solve a wide array of problem types. In this way, complex network structures representing real-world problems can be mathematically modeled which makes it easier to make informed decisions.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":"398-415"},"PeriodicalIF":2.6,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144585578","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}
Pub Date : 2025-08-01Epub Date: 2024-07-23DOI: 10.1089/big.2023.0033
Hong Wang, Ling Hong
Survival models have found wider and wider applications in credit scoring recently due to their ability to estimate the dynamics of risk over time. In this research, we propose a Buckley-James safe sample screening support vector regression (BJS4VR) algorithm to model large-scale survival data by combing the Buckley-James transformation and support vector regression. Different from previous support vector regression survival models, censored samples here are imputed using a censoring unbiased Buckley-James estimator. Safe sample screening is then applied to discard samples that guaranteed to be non-active at the final optimal solution from the original data to improve efficiency. Experimental results on the large-scale real lending club loan data have shown that the proposed BJS4VR model outperforms existing popular survival models such as RSFM, CoxRidge and CoxBoost in terms of both prediction accuracy and time efficiency. Important variables highly correlated with credit risk are also identified with the proposed method.
{"title":"A Fast Survival Support Vector Regression Approach to Large Scale Credit Scoring via Safe Screening.","authors":"Hong Wang, Ling Hong","doi":"10.1089/big.2023.0033","DOIUrl":"10.1089/big.2023.0033","url":null,"abstract":"<p><p>Survival models have found wider and wider applications in credit scoring recently due to their ability to estimate the dynamics of risk over time. In this research, we propose a Buckley-James safe sample screening support vector regression (BJS4VR) algorithm to model large-scale survival data by combing the Buckley-James transformation and support vector regression. Different from previous support vector regression survival models, censored samples here are imputed using a censoring unbiased Buckley-James estimator. Safe sample screening is then applied to discard samples that guaranteed to be non-active at the final optimal solution from the original data to improve efficiency. Experimental results on the large-scale real lending club loan data have shown that the proposed BJS4VR model outperforms existing popular survival models such as RSFM, CoxRidge and CoxBoost in terms of both prediction accuracy and time efficiency. Important variables highly correlated with credit risk are also identified with the proposed method.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":"304-318"},"PeriodicalIF":2.6,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141753329","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}
Pub Date : 2025-08-01Epub Date: 2024-03-25DOI: 10.1089/big.2023.0130
Zhenzhen Yang, Zelong Lin, Yongpeng Yang, Jiaqi Li
Link prediction, which has important applications in many fields, predicts the possibility of the link between two nodes in a graph. Link prediction based on Graph Neural Network (GNN) obtains node representation and graph structure through GNN, which has attracted a growing amount of attention recently. However, the existing GNN-based link prediction approaches possess some shortcomings. On the one hand, because a graph contains different types of nodes, it leads to a great challenge for aggregating information and learning node representation from its neighbor nodes. On the other hand, the attention mechanism has been an effect instrument for enhancing the link prediction performance. However, the traditional attention mechanism is always monotonic for query nodes, which limits its influence on link prediction. To address these two problems, a Dual-Path Graph Neural Network (DPGNN) for link prediction is proposed in this study. First, we propose a novel Local Random Features Augmentation for Graph Convolution Network as a baseline of one path. Meanwhile, Graph Attention Network version 2 based on dynamic attention mechanism is adopted as a baseline of the other path. And then, we capture more meaningful node representation and more accurate link features by concatenating the information of these two paths. In addition, we propose an adaptive auxiliary module for better balancing the weight of auxiliary tasks, which brings more benefit to link prediction. Finally, extensive experiments verify the effectiveness and superiority of our proposed DPGNN for link prediction.
链接预测是指预测图中两个节点之间链接的可能性,在许多领域都有重要应用。基于图神经网络(GNN)的链接预测通过 GNN 获得节点表示和图结构,最近引起了越来越多的关注。然而,现有的基于 GNN 的链接预测方法存在一些缺陷。一方面,由于图中包含不同类型的节点,这给从相邻节点汇总信息和学习节点表示带来了巨大挑战。另一方面,注意力机制一直是提高链接预测性能的有效工具。然而,传统的注意力机制对于查询节点总是单调的,这限制了它对链接预测的影响。针对这两个问题,本研究提出了一种用于链接预测的双路径图神经网络(DPGNN)。首先,我们提出了一种新颖的局部随机特征增强图卷积网络(Local Random Features Augmentation for Graph Convolution Network),作为单路径的基线。同时,我们采用基于动态注意力机制的图注意力网络版本 2 作为另一条路径的基准。然后,我们通过串联这两条路径的信息来捕捉更有意义的节点表示和更准确的链接特征。此外,我们还提出了自适应辅助模块,以更好地平衡辅助任务的权重,从而为链接预测带来更多益处。最后,大量实验验证了我们提出的 DPGNN 在链接预测方面的有效性和优越性。
{"title":"Dual-Path Graph Neural Network with Adaptive Auxiliary Module for Link Prediction.","authors":"Zhenzhen Yang, Zelong Lin, Yongpeng Yang, Jiaqi Li","doi":"10.1089/big.2023.0130","DOIUrl":"10.1089/big.2023.0130","url":null,"abstract":"<p><p>Link prediction, which has important applications in many fields, predicts the possibility of the link between two nodes in a graph. Link prediction based on Graph Neural Network (GNN) obtains node representation and graph structure through GNN, which has attracted a growing amount of attention recently. However, the existing GNN-based link prediction approaches possess some shortcomings. On the one hand, because a graph contains different types of nodes, it leads to a great challenge for aggregating information and learning node representation from its neighbor nodes. On the other hand, the attention mechanism has been an effect instrument for enhancing the link prediction performance. However, the traditional attention mechanism is always monotonic for query nodes, which limits its influence on link prediction. To address these two problems, a Dual-Path Graph Neural Network (DPGNN) for link prediction is proposed in this study. First, we propose a novel Local Random Features Augmentation for Graph Convolution Network as a baseline of one path. Meanwhile, Graph Attention Network version 2 based on dynamic attention mechanism is adopted as a baseline of the other path. And then, we capture more meaningful node representation and more accurate link features by concatenating the information of these two paths. In addition, we propose an adaptive auxiliary module for better balancing the weight of auxiliary tasks, which brings more benefit to link prediction. Finally, extensive experiments verify the effectiveness and superiority of our proposed DPGNN for link prediction.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":"333-343"},"PeriodicalIF":2.6,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140289590","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}
Extracting meaningful patterns of human mobility from accumulating trajectories is essential for understanding human behavior. However, previous works identify human mobility patterns based on the spatial co-occurrence of trajectories, which ignores the effect of activity content, leaving challenges in effectively extracting and understanding patterns. To bridge this gap, this study incorporates the activity content of trajectories to extract human mobility patterns, and proposes acontent-aware mobility pattern model. The model first embeds the activity content in distributed continuous vector space by taking point-of-interest as an agent and then extracts representative and interpretable mobility patterns from human trajectory sets using a derived topic model. To investigate the performance of the proposed model, several evaluation metrics are developed, including pattern coherence, pattern similarity, and manual scoring. A real-world case study is conducted, and its experimental results show that the proposed model improves interpretability and helps to understand mobility patterns. This study provides not only a novel solution and several evaluation metrics for human mobility patterns but also a method reference for fusing content semantics of human activities for trajectory analysis and mining.
{"title":"Content-Aware Human Mobility Pattern Extraction.","authors":"Shengwen Li, Chaofan Fan, Tianci Li, Renyao Chen, Qingyuan Liu, Junfang Gong","doi":"10.1089/big.2022.0281","DOIUrl":"10.1089/big.2022.0281","url":null,"abstract":"<p><p>Extracting meaningful patterns of human mobility from accumulating trajectories is essential for understanding human behavior. However, previous works identify human mobility patterns based on the spatial co-occurrence of trajectories, which ignores the effect of activity content, leaving challenges in effectively extracting and understanding patterns. To bridge this gap, this study incorporates the activity content of trajectories to extract human mobility patterns, and proposes acontent-aware mobility pattern model. The model first embeds the activity content in distributed continuous vector space by taking point-of-interest as an agent and then extracts representative and interpretable mobility patterns from human trajectory sets using a derived topic model. To investigate the performance of the proposed model, several evaluation metrics are developed, including pattern coherence, pattern similarity, and manual scoring. A real-world case study is conducted, and its experimental results show that the proposed model improves interpretability and helps to understand mobility patterns. This study provides not only a novel solution and several evaluation metrics for human mobility patterns but also a method reference for fusing content semantics of human activities for trajectory analysis and mining.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":"269-284"},"PeriodicalIF":2.6,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141565068","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}
Pub Date : 2025-08-01Epub Date: 2024-07-27DOI: 10.1089/big.2023.0016
Yinuo Qian, Fuzhong Nian, Zheming Wang, Yabing Yao
Dynamic propagation will affect the change of network structure. Different networks are affected by the iterative propagation of information to different degrees. The iterative propagation of information in the network changes the connection strength of the chain edge between nodes. Most studies on temporal networks build networks based on time characteristics, and the iterative propagation of information in the network can also reflect the time characteristics of network evolution. The change of network structure is a macromanifestation of time characteristics, whereas the dynamics in the network is a micromanifestation of time characteristics. How to concretely visualize the change of network structure influenced by the characteristics of propagation dynamics has become the focus of this article. The appearance of chain edge is the micro change of network structure, and the division of community is the macro change of network structure. Based on this, the node participation is proposed to quantify the influence of different users on the information propagation in the network, and it is simulated in different types of networks. By analyzing the iterative propagation of information, the weighted network of different networks based on the iterative propagation of information is constructed. Finally, the chain edge and community division in the network are analyzed to achieve the purpose of quantifying the influence of network propagation on complex network structure.
{"title":"Research on the Influence of Information Iterative Propagation on Complex Network Structure.","authors":"Yinuo Qian, Fuzhong Nian, Zheming Wang, Yabing Yao","doi":"10.1089/big.2023.0016","DOIUrl":"10.1089/big.2023.0016","url":null,"abstract":"<p><p>Dynamic propagation will affect the change of network structure. Different networks are affected by the iterative propagation of information to different degrees. The iterative propagation of information in the network changes the connection strength of the chain edge between nodes. Most studies on temporal networks build networks based on time characteristics, and the iterative propagation of information in the network can also reflect the time characteristics of network evolution. The change of network structure is a macromanifestation of time characteristics, whereas the dynamics in the network is a micromanifestation of time characteristics. How to concretely visualize the change of network structure influenced by the characteristics of propagation dynamics has become the focus of this article. The appearance of chain edge is the micro change of network structure, and the division of community is the macro change of network structure. Based on this, the node participation is proposed to quantify the influence of different users on the information propagation in the network, and it is simulated in different types of networks. By analyzing the iterative propagation of information, the weighted network of different networks based on the iterative propagation of information is constructed. Finally, the chain edge and community division in the network are analyzed to achieve the purpose of quantifying the influence of network propagation on complex network structure.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":"319-332"},"PeriodicalIF":2.6,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141789804","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}
To promote the informatization management of hospital human resources and advance the application of hospital information technology. The application of deep learning (DL) technologies in health care, particularly in hospital settings, has shown significant promise in enhancing decision-making processes for nurse staff. Utilizing a hospital management decision support system based on data warehouse theory and business intelligence technology to achieve multidimensional analysis and display of data. This research explores the development and implementation of a DL-Based Clinical Decision Support System (DL-CDSS) tailored for nurses in hospitals. DL-CDSS utilizes advanced neural network architectures to analyze complex clinical data, including patient records, vital signs, and diagnostic reports, aiming to assist nurses in making informed decisions regarding patient care. By leveraging large-scale datasets from Hospital Information Systems, DL-CDSS provides real-time recommendations for treatment plans, medication administration, and patient monitoring. The system's effectiveness is demonstrated through improved accuracy in clinical decision-making, reduction in medication errors, and optimized workflow efficiency. The system analyzes and displays nurses data from hospitals in terms of quantity, distribution, structure, forecasting, analysis reports, and peer comparisons, providing head nurses with multilevel, multiperspective data mining analysis results. Challenges such as data integration, model interpretability, and user interface design are addressed to ensure seamless integration into nursing practice, also concludes with insights into the potential benefits of DL-CDSS in promoting patient safety, enhancing health care quality, and supporting nursing professionals in delivering optimal care.
{"title":"Deep Learning-Based Decision Support System for Nurse Staff in Hospitals.","authors":"Jieyu Chen, Feilong He, Lihua Tang, Lingli Gu","doi":"10.1089/big.2024.0122","DOIUrl":"10.1089/big.2024.0122","url":null,"abstract":"<p><p>To promote the informatization management of hospital human resources and advance the application of hospital information technology. The application of deep learning (DL) technologies in health care, particularly in hospital settings, has shown significant promise in enhancing decision-making processes for nurse staff. Utilizing a hospital management decision support system based on data warehouse theory and business intelligence technology to achieve multidimensional analysis and display of data. This research explores the development and implementation of a DL-Based Clinical Decision Support System (DL-CDSS) tailored for nurses in hospitals. DL-CDSS utilizes advanced neural network architectures to analyze complex clinical data, including patient records, vital signs, and diagnostic reports, aiming to assist nurses in making informed decisions regarding patient care. By leveraging large-scale datasets from Hospital Information Systems, DL-CDSS provides real-time recommendations for treatment plans, medication administration, and patient monitoring. The system's effectiveness is demonstrated through improved accuracy in clinical decision-making, reduction in medication errors, and optimized workflow efficiency. The system analyzes and displays nurses data from hospitals in terms of quantity, distribution, structure, forecasting, analysis reports, and peer comparisons, providing head nurses with multilevel, multiperspective data mining analysis results. Challenges such as data integration, model interpretability, and user interface design are addressed to ensure seamless integration into nursing practice, also concludes with insights into the potential benefits of DL-CDSS in promoting patient safety, enhancing health care quality, and supporting nursing professionals in delivering optimal care.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":"big20240122"},"PeriodicalIF":2.6,"publicationDate":"2025-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144210204","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}
Pub Date : 2025-06-01Epub Date: 2023-12-20DOI: 10.1089/big.2023.0015
Pingkan Mayosi Fitriana, Jumadil Saputra, Zairihan Abdul Halim
In light of developing and industrialized nations, the G20 economies account for a whopping two-thirds of the world's population and are the largest economies globally. Public emergencies have occasionally arisen due to the rapid spread of COVID-19 globally, impacting many people's lives, especially in G20 countries. Thus, this study is written to investigate the impact of the COVID-19 pandemic on stock market performance in G20 countries. This study uses daily stock market data of G20 countries from January 1, 2019 to June 30, 2020. The stock market data were divided into G7 countries and non-G7 countries. The data were analyzed using Long Short-Term Memory with a Recurrent Neural Network (LSTM-RNN) approach. The result indicated a gap between the actual stock market index and a forecasted time series that would have happened without COVID-19. Owing to movement restrictions, this study found that stock markets in six countries, including Argentina, China, South Africa, Turkey, Saudi Arabia, and the United States, are affected negatively. Besides that, movement restrictions in the G7 countries, excluding the United States, and the non-G20 countries, excluding Argentina, China, South Africa, Turkey, and Saudi, significantly impact the stock market performance. Generally, LSTM prediction estimates relative terms, except for stock market performance in the United Kingdom, the Republic of Korea, South Africa, and Spain. The stock market performance in the United Kingdom and Spain countries has significantly reduced during and after the occurrence of COVID-19. It indicates that the COVID-19 pandemic considerably influenced the stock markets of 14 G20 countries, whereas less severely impacting 6 remaining countries. In conclusion, our empirical evidence showed that the pandemic had restricted effects on the stock market performance in G20 countries.
{"title":"The Impact of the COVID-19 Pandemic on Stock Market Performance in G20 Countries: Evidence from Long Short-Term Memory with a Recurrent Neural Network Approach.","authors":"Pingkan Mayosi Fitriana, Jumadil Saputra, Zairihan Abdul Halim","doi":"10.1089/big.2023.0015","DOIUrl":"10.1089/big.2023.0015","url":null,"abstract":"<p><p>In light of developing and industrialized nations, the G20 economies account for a whopping two-thirds of the world's population and are the largest economies globally. Public emergencies have occasionally arisen due to the rapid spread of COVID-19 globally, impacting many people's lives, especially in G20 countries. Thus, this study is written to investigate the impact of the COVID-19 pandemic on stock market performance in G20 countries. This study uses daily stock market data of G20 countries from January 1, 2019 to June 30, 2020. The stock market data were divided into G7 countries and non-G7 countries. The data were analyzed using Long Short-Term Memory with a Recurrent Neural Network (LSTM-RNN) approach. The result indicated a gap between the actual stock market index and a forecasted time series that would have happened without COVID-19. Owing to movement restrictions, this study found that stock markets in six countries, including Argentina, China, South Africa, Turkey, Saudi Arabia, and the United States, are affected negatively. Besides that, movement restrictions in the G7 countries, excluding the United States, and the non-G20 countries, excluding Argentina, China, South Africa, Turkey, and Saudi, significantly impact the stock market performance. Generally, LSTM prediction estimates relative terms, except for stock market performance in the United Kingdom, the Republic of Korea, South Africa, and Spain. The stock market performance in the United Kingdom and Spain countries has significantly reduced during and after the occurrence of COVID-19. It indicates that the COVID-19 pandemic considerably influenced the stock markets of 14 G20 countries, whereas less severely impacting 6 remaining countries. In conclusion, our empirical evidence showed that the pandemic had restricted effects on the stock market performance in G20 countries.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":"219-242"},"PeriodicalIF":2.6,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138832891","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}
Pub Date : 2025-06-01Epub Date: 2023-05-08DOI: 10.1089/big.2022.0302
Asefeh Asemi, Adeleh Asemi, Andrea Ko
In this research, we propose an automatic recommender system for providing investment-type suggestions offered to investors. This system is based on a new intelligent approach using an adaptive neuro-fuzzy inference system (ANFIS) that works with four potential investors' key decision factors (KDFs), which are system value, environmental awareness factors, the expectation of high return, and expectation of low return. The proposed system provides a new model for investment recommender systems (IRSs), which is based on the data of KDFs, and the data related to the type of investment. The solution of fuzzy neural inference and choosing the type of investment is used to provide advice and support the investor's decision. This system also works with incomplete data. It is also possible to apply expert opinions based on feedback provided by investors who use the system. The proposed system is a reliable system for providing suggestions for the type of investment. It can predict the investors' investment decisions based on their KDFs in the selection of different investment types. This system uses the K-means technique in JMP for preprocessing the data and ANFIS for evaluating the data. We also compare the proposed system with other existing IRSs and evaluate the system's accuracy and effectiveness using the root mean squared error method. Overall, the proposed system is an effective and reliable IRS that can be used by potential investors to make better investment decisions.
{"title":"Investment Recommender System Model Based on the Potential Investors' Key Decision Factors.","authors":"Asefeh Asemi, Adeleh Asemi, Andrea Ko","doi":"10.1089/big.2022.0302","DOIUrl":"10.1089/big.2022.0302","url":null,"abstract":"<p><p>In this research, we propose an automatic recommender system for providing investment-type suggestions offered to investors. This system is based on a new intelligent approach using an adaptive neuro-fuzzy inference system (ANFIS) that works with four potential investors' key decision factors (KDFs), which are system value, environmental awareness factors, the expectation of high return, and expectation of low return. The proposed system provides a new model for investment recommender systems (IRSs), which is based on the data of KDFs, and the data related to the type of investment. The solution of fuzzy neural inference and choosing the type of investment is used to provide advice and support the investor's decision. This system also works with incomplete data. It is also possible to apply expert opinions based on feedback provided by investors who use the system. The proposed system is a reliable system for providing suggestions for the type of investment. It can predict the investors' investment decisions based on their KDFs in the selection of different investment types. This system uses the K-means technique in JMP for preprocessing the data and ANFIS for evaluating the data. We also compare the proposed system with other existing IRSs and evaluate the system's accuracy and effectiveness using the root mean squared error method. Overall, the proposed system is an effective and reliable IRS that can be used by potential investors to make better investment decisions.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":"197-218"},"PeriodicalIF":2.6,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9432264","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}