首页 > 最新文献

Big Data最新文献

英文 中文
Maximizing Influence in Social Networks Using Combined Local Features and Deep Learning-Based Node Embedding. 利用组合本地特征和基于深度学习的节点嵌入,最大化社交网络中的影响力。
IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-10-01 Epub Date: 2024-10-22 DOI: 10.1089/big.2023.0117
Asgarali Bouyer, Hamid Ahmadi Beni, Amin Golzari Oskouei, Alireza Rouhi, Bahman Arasteh, Xiaoyang Liu

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%.

影响最大化问题有几个问题,包括低感染率和高时间复杂性。由于时间复杂性或自由参数的使用,许多建议的方法都不适合大规模网络。为了应对这些挑战,本文提出了一种名为 "影响力最大化嵌入技术"(ETIM)的局部启发式算法,该算法使用壳分解、图嵌入和还原,并结合了局部结构特征。该算法根据网络壳之间的连接和拓扑特征选择候选节点,从而减少了搜索空间和计算开销。它使用基于深度学习的节点嵌入技术创建候选节点的多维向量,并根据本地拓扑特征计算每个节点对传播的依赖性。最后,利用前一阶段的结果和新定义的本地特征识别出有影响力的节点。利用独立级联模型对所提出的算法进行了评估,结果表明该算法具有竞争力,能够在解决方案质量方面达到最佳性能。与集体影响全局算法相比,ETIM 的速度明显更快,感染率平均提高了 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}
引用次数: 0
DMHANT: DropMessage Hypergraph Attention Network for Information Propagation Prediction. DMHANT:用于信息传播预测的 DropMessage 超图注意力网络。
IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-10-01 Epub Date: 2024-10-23 DOI: 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.

预测传播级联对于理解社交网络中的信息传播至关重要。现有方法总是关注单个级联序列中受感染用户的结构或顺序,忽略了级联和用户之间的全局依赖关系,不足以描述他们的动态互动偏好。此外,现有方法在解决模型稳健性问题方面也存在不足。为了解决这些问题,我们提出了一种名为 "DropMessage 超图注意力网络 "的预测模型,该模型基于级联序列构建超图。具体来说,为了动态获取用户偏好,我们根据时间戳将扩散超图划分为多个子图,开发超图注意力网络来显式学习完整的交互,并采用门控融合策略将它们连接起来进行用户级联预测。此外,为了提高模型的鲁棒性,还增加了一种新的立即删除方法 DropMessage。在三个真实数据集上的实验结果表明,所提出的模型在 MAP@k 和 Hits@K 两个指标上都明显优于最先进的信息传播预测模型,实验还证明该模型在数据扰动下比现有模型取得了更显著的预测性能。
{"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}
引用次数: 0
Optimizing Multilayer Networks Through Time-Dependent Decision-Making: A Comparative Study. 基于时间依赖决策的多层网络优化:比较研究。
IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-10-01 Epub Date: 2025-07-08 DOI: 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}
引用次数: 0
A Fast Survival Support Vector Regression Approach to Large Scale Credit Scoring via Safe Screening. 通过安全筛选进行大规模信用评分的快速生存支持向量回归方法。
IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-08-01 Epub Date: 2024-07-23 DOI: 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.

由于生存模型能够估计随时间变化的风险动态,因此近来在信用评分领域得到了越来越广泛的应用。在这项研究中,我们提出了一种巴克利-詹姆斯安全样本筛选支持向量回归(BJS4VR)算法,通过结合巴克利-詹姆斯变换和支持向量回归,对大规模生存数据进行建模。与以往的支持向量回归生存模型不同,这里的删减样本是使用删减无偏的巴克利-詹姆斯估计器来估算的。然后应用安全样本筛选,从原始数据中剔除保证在最终最优解中不活跃的样本,以提高效率。在大规模真实借贷俱乐部贷款数据上的实验结果表明,所提出的 BJS4VR 模型在预测准确性和时间效率方面都优于现有的流行生存模型,如 RSFM、CoxRidge 和 CoxBoost。此外,所提出的方法还识别出了与信贷风险高度相关的重要变量。
{"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}
引用次数: 0
Dual-Path Graph Neural Network with Adaptive Auxiliary Module for Link Prediction. 带自适应辅助模块的双路径图神经网络用于链路预测
IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-08-01 Epub Date: 2024-03-25 DOI: 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}
引用次数: 0
Content-Aware Human Mobility Pattern Extraction. 内容感知的人类移动模式提取。
IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-08-01 Epub Date: 2024-07-10 DOI: 10.1089/big.2022.0281
Shengwen Li, Chaofan Fan, Tianci Li, Renyao Chen, Qingyuan Liu, Junfang Gong

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}
引用次数: 0
Research on the Influence of Information Iterative Propagation on Complex Network Structure. 信息迭代传播对复杂网络结构的影响研究。
IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-08-01 Epub Date: 2024-07-27 DOI: 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}
引用次数: 0
Deep Learning-Based Decision Support System for Nurse Staff in Hospitals. 基于深度学习的医院护士决策支持系统。
IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-06-02 DOI: 10.1089/big.2024.0122
Jieyu Chen, Feilong He, Lihua Tang, Lingli Gu

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.

促进医院人力资源信息化管理,推进医院信息技术的应用。深度学习(DL)技术在医疗保健领域的应用,特别是在医院环境中,在加强护士工作人员的决策过程方面显示出巨大的希望。利用基于数据仓库理论和商业智能技术的医院管理决策支持系统,实现数据的多维分析和显示。本研究探讨了为医院护士量身定制的基于dl的临床决策支持系统(DL-CDSS)的开发和实施。DL-CDSS利用先进的神经网络架构来分析复杂的临床数据,包括患者记录、生命体征和诊断报告,旨在帮助护士做出有关患者护理的明智决策。通过利用来自医院信息系统的大规模数据集,DL-CDSS为治疗计划、药物管理和患者监测提供实时建议。通过提高临床决策的准确性、减少用药错误和优化工作流程效率,证明了该系统的有效性。系统从数量、分布、结构、预测、分析报告、同行比较等方面对医院护士数据进行分析展示,为护士长提供多层次、多角度的数据挖掘分析结果。解决了数据集成、模型可解释性和用户界面设计等挑战,以确保无缝集成到护理实践中,并总结了DL-CDSS在促进患者安全、提高医疗保健质量和支持护理专业人员提供最佳护理方面的潜在好处。
{"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}
引用次数: 0
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. COVID-19 大流行对 G20 国家股市表现的影响:利用递归神经网络方法从短期长记忆中获取证据》(Evidence from Long Short-Term Memory with a Recurrent Neural Network Approach.
IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-06-01 Epub Date: 2023-12-20 DOI: 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.

从发展中国家和工业化国家的角度来看,G20 经济体占世界人口的三分之二,是全球最大的经济体。由于 COVID-19 在全球范围内的快速传播,公共突发事件时有发生,对许多人的生活造成了影响,尤其是在 G20 国家。因此,本研究旨在调查 COVID-19 大流行对 G20 国家股市表现的影响。本研究使用 G20 国家从 2019 年 1 月 1 日至 2020 年 6 月 30 日的每日股市数据。股市数据分为 G7 国家和非 G7 国家。数据分析采用了具有循环神经网络(LSTM-RNN)的长短期记忆方法。结果表明,如果没有 COVID-19,实际股市指数与预测时间序列之间会出现差距。本研究发现,由于流动限制,阿根廷、中国、南非、土耳其、沙特阿拉伯和美国等六个国家的股市受到了负面影响。此外,除美国之外的 G7 国家以及除阿根廷、中国、南非、土耳其和沙特之外的非 G20 国家的流动限制也对股市表现产生了显著影响。一般来说,除了英国、大韩民国、南非和西班牙的股市表现外,LSTM 预测估计的都是相对值。在 COVID-19 发生期间和之后,英国和西班牙的股市表现明显下降。这表明,COVID-19 大流行对 14 个 G20 国家的股市产生了重大影响,而对其余 6 个国家的影响则较小。总之,我们的经验证据表明,大流行病对 G20 国家的股市表现产生了有限的影响。
{"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}
引用次数: 0
Investment Recommender System Model Based on the Potential Investors' Key Decision Factors. 基于潜在投资者关键决策因素的投资推荐系统模型。
IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-06-01 Epub Date: 2023-05-08 DOI: 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.

在本研究中,我们提出了一个自动推荐系统,为投资者提供投资类型的建议。该系统基于一种新的智能方法,使用自适应神经模糊推理系统(ANFIS)来处理潜在投资者的四个关键决策因素(kdf),即系统价值、环境意识因素、高回报预期和低回报预期。该系统为投资推荐系统(IRSs)提供了一种基于kdf数据和投资类型相关数据的新模型。利用模糊神经推理和投资类型选择的解决方案,为投资者的决策提供建议和支持。该系统也适用于不完整的数据。根据使用该系统的投资者提供的反馈,也可以应用专家的意见。拟议的制度是为投资类型提供建议的可靠制度。它可以根据投资者在选择不同投资类型时的kdf来预测投资者的投资决策。该系统使用JMP中的K-means技术对数据进行预处理,并使用ANFIS对数据进行评价。我们还将所提出的系统与其他现有的irs进行了比较,并使用均方根误差方法评估了系统的准确性和有效性。总的来说,所提出的系统是一个有效和可靠的IRS,可以被潜在的投资者用来做出更好的投资决策。
{"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}
引用次数: 0
期刊
Big Data
全部 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