检索结果-内蒙古大学图书馆

Economic Policy Uncertainty:Cross-Country Linkages and Spillover Effects on Economic Development in Some Belt and Road Countries

引用

Journal of Systems science & Complexity 2023年第3期36卷 1169-1188页

作者： YUAN Jing DONG Yajing ZHAI Weijie CAI Zongwu School of Statistics Shandong Technology and Business UniversityYantai 264005China School of Statistics and Data Science Nankai UniversityTianjin 300071China Department of Economics University of KansasLawrenceKS 66045USA

With the increase of economic environment uncertainty,it is of great importance to study the linkage and spillover effects of economic policy uncertainty among ***,this article selects eight countries along the Belt and Road as the core countries(China,Korea,Croatia,India,Russia,Greece,Pakistan,and Singapore)and four countries(Germany,France,Japan,and UK)as the peripheral countries,and then copula technique and mixed-frequency global vector autoregressive model are employed to analyze the correlation and the spillover effect of the economic policy uncertainty(EPU)for the twelve selected countries,*** proposed empirical findings show clearly that the EPU correlation among the eight core Belt and Road countries is stronger and the spillover effect of the core countries to the peripheral countries is statistically *** a result,for harmonious and win-win development,the Belt and Road countries should pay a close attention to the EPU,because the stability of the EPU promotes greatly the economy development.

关键词： Belt and road initiative copula functions economic policy uncertainty global VAR spillover effects

来源：评论

学校读者我要写书评

暂无评论

Spatio-Temporal Location Recommendation for Urban Facility Placement via Graph Convolutional and Recurrent Networks

引用

Journal of computer science & Technology 2024年第6期39卷 1419-1440页

作者： Pu Wang Jian-Jiang Lu Wei Chen Peng-Peng Zhao Lei Zhao Institute of Artificial Intelligence School of Computer Science and TechnologySoochow UniversitySuzhou 215006China Department of Data Resource and Information Development Soochow UniversitySuzhou 215006China

The ability to recommend candidate locations for service facility placement is crucial for the success of urban planning. Whether a location is suitable for establishing new facilities is largely determined by its potential popularity. However, it is a non-trivial task to predict popularity of candidate locations due to three significant challenges: 1) the spatio-temporal behavior correlations of urban dwellers, 2) the spatial correlations between candidate locations and existing facilities, and 3) the temporal auto-correlations of locations themselves. To this end, we propose a novel semi-supervised learning model, Spatio-Temporal Graph Convolutional and Recurrent Networks (STGCRN), aiming for popularity prediction and location recommendation. Specifically, we first partition the urban space into spatial neighborhood regions centered by locations, extract the corresponding features, and develop the location correlation graph. Next, a contextual graph convolution module based on the attention mechanism is introduced to incorporate local and global spatial correlations among locations. A recurrent neural network is proposed to capture temporal dependencies between locations. Furthermore, we adopt a location popularity approximation block to estimate the missing popularity from both the spatial and temporal domains. Finally, the overall implicit characteristics are concatenated and then fed into the recurrent neural network to obtain the ultimate popularity. The extensive experiments on two real-world datasets demonstrate the superiority of the proposed model compared with state-of-the-art baselines.

关键词： location recommendation popularity prediction spatio-temporal correlation deep learning

来源：评论

学校读者我要写书评

暂无评论

Advancements in AI-Driven Cephalometric Analysis for Orthodontic Applications: A Review on Automated Landmark Detection and Angle Assessment 4

Advancements in AI-Driven Cephalometric Analysis for Orthodo...

引用

4th International Conference on Sentiment Analysis and Deep Learning, ICSADL 2025

作者： Gurbade, Viraj Vijay Pacharaaney, Utkarsha Puri, Chetan Department of Artificial Intelligence and Data Science Maharashtra Wardha442001 India Department of Computer Science and Design Maharashtra Wardha442001 India

ISBN: (纸本)9798331523923

This is an essential tool used in the orthodontic practice for the assessment of craniofacial structures and as a basis in initiating treatment planning. Within the pre-AI/deep learning era, it was achieved through the procedure of manual tracing on 2D radiographs, individual variability, and quite time-consuming to obtain the established norm but which was susceptible. These technologies apply CNNs to properly detect landmarks and reduce the occurrence of human mistake, ensuring reproducibility of measurements across analyses. Automated systems demonstrated promising performance for landmark detection both on 2D and 3D images, particularly within the history of 3D imaging techniques such as cone-beam computed tomography (CBCT), offering a sweeping view of craniofacial anatomy. Studies show that training these AI models based on large datasets enables generalization to many images, thereby allowing landmark placement in reliable ways, with improved diagnostic accuracy;however, there's a challenge in achieving model robustness across different populations and complex 3D data. Future directions include the integration of AI with augmented reality, enabling real-time diagnostics to further depict and adjust clinicians' abilities to visualize treatment plans. With advancements in AI in cephalometry, the model may be hybrid to combine AI automation with manual verification, thus optimising reliability for clinical use, paving the way for more personalized and accurate orthodontic care. © 2025 IEEE.

关键词： computerized tomography

来源：评论

学校读者我要写书评

暂无评论

Community Clustering on Fraud Transactions Applied the Louvain-Coloring Algorithm

引用

International Journal of Electronics and Telecommunications 2023年第3期69卷 593-598页

作者： Mardiansyah, Heru Suwilo, Saib Nababan, Erna Budiarti Efendi, Syahril Department Computer Science Faculty of Computer Science and Information Technology Universitas Sumatera Utara Medan Indonesia Department Mathematics Faculty of Mathematics and Natural Sciences Universitas Sumatera Utara Medan Indonesia Department Data Science and Artificial Intelligence Faculty of Computer Science and Information Technology Universitas Sumatera Utara Medan Indonesia

The contribution main from this research is modularity and better processing time in detecting community by using K-1 coloring. Testing performed on transaction datasets remittance on P2P platforms where the Louvain Coloring algorithm is better in comparison to Louvain Algorithm data used is data transfer transactions made by customers on the P2P Online platform. The data is the User data that has information transfer transactions, Card data that has information card, IP data that has IP information, and Device data that has information device. Every user owns unique 128-bit identification, and other nodes representing card, device, and IP are assigned a random UUID. The Device node has the guide, and device properties. IP nodes only have property guide and node User has property fraud Money Transfer, guide, money Transfer Error Cancel Amount, first Charge back Date. Each node has a unique 128-bit guide, with the amount whole of as many as 789,856 nodes. Application technique K-1 staining on Louvain algorithm shows enhancement value modularity and better processing time for detecting community on the network large scale. Through a series of exercises and tests carried out in various scenarios, it shows that the experiments carried out in this paper, namely the Louvain Coloring algorithm, are more effective and efficient than the Louvain algorithm in scenario 1,3, and 5 meanwhile For Scenarios 2 and 4 Louvain Algorithm is better. © 2023 Polish Academy of sciences. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Dynamic Multi-Graph Spatio-Temporal Graph Traffic Flow Prediction in Bangkok:An Application of a Continuous Convolutional Neural Network

引用

computer Modeling in Engineering & sciences 2025年第1期142卷 579-607页

作者： Pongsakon Promsawat Weerapan Sae-dan Marisa Kaewsuwan Weerawat Sudsutad Aphirak Aphithana Department of Civil Engineering Faculty of EngineeringRamkhamkaeng UniversityBangkok10240Thailand Department of Computer Engineering Faculty of EngineeringRamkhamkaeng UniversityBangkok10240Thailand Department of Statistics Faculty of ScienceRamkhamkaeng UniversityBangkok10240Thailand

The ability to accurately predict urban traffic flows is crucial for optimising city ***,various methods for forecasting urban traffic have been developed,focusing on analysing historical data to understand complex mobility *** learning techniques,such as graph neural networks(GNNs),are popular for their ability to capture spatio-temporal ***,these models often become overly complex due to the large number of hyper-parameters *** this study,we introduce Dynamic Multi-Graph Spatial-Temporal Graph Neural Ordinary Differential Equation Networks(DMST-GNODE),a framework based on ordinary differential equations(ODEs)that autonomously discovers effective spatial-temporal graph neural network(STGNN)architectures for traffic prediction *** comparative analysis of DMST-GNODE and baseline models indicates that DMST-GNODE model demonstrates superior performance across multiple datasets,consistently achieving the lowest Root Mean Square Error(RMSE)and Mean Absolute Error(MAE)values,alongside the highest *** the BKK(Bangkok)dataset,it outperformed other models with an RMSE of 3.3165 and an accuracy of 0.9367 for a 20-min interval,maintaining this trend across 40 and 60 ***,on the PeMS08 dataset,DMST-GNODE achieved the best performance with an RMSE of 19.4863 and an accuracy of 0.9377 at 20 min,demonstrating its effectiveness over longer *** Los_Loop dataset results further emphasise this model’s advantage,with an RMSE of 3.3422 and an accuracy of 0.7643 at 20 min,consistently maintaining superiority across all time *** numerical highlights indicate that DMST-GNODE not only outperforms baseline models but also achieves higher accuracy and lower errors across different time intervals and datasets.

关键词： Graph neural networks convolutional neural network deep learning dynamic multi-graph spatio-temporal

来源：评论

学校读者我要写书评

暂无评论

Part-Whole Relational Few-Shot 3D Point Cloud Semantic Segmentation

引用

computers, Materials & Continua 2024年第3期78卷 3021-3039页

作者： Shoukun Xu Lujun Zhang Guangqi Jiang Yining Hua Yi Liu School of Computer Science and Artificial Intelligence Aliyun School of Big Data and School of SoftwareChangzhou UniversityChangzhou213164China Department of Computer Science University of AberdeenKing’s CollegeAberdeenAB243FXUK

This paper focuses on the task of few-shot 3D point cloud semantic *** some progress,this task still encounters many issues due to the insufficient samples given,e.g.,incomplete object segmentation and inaccurate semantic *** tackle these issues,we first leverage part-whole relationships into the task of 3D point cloud semantic segmentation to capture semantic integrity,which is empowered by the dynamic capsule routing with the module of 3D Capsule Networks(CapsNets)in the embedding ***,the dynamic routing amalgamates geometric information of the 3D point cloud data to construct higher-level feature representations,which capture the relationships between object parts and their ***,we designed a multi-prototype enhancement module to enhance the prototype ***,the single-prototype enhancement mechanism is expanded to the multi-prototype enhancement version for capturing rich ***,the shot-correlation within the category is calculated via the interaction of different samples to enhance the intra-category *** studies prove that the involved part-whole relations and proposed multi-prototype enhancement module help to achieve complete object segmentation and improve semantic ***,under the integration of these two modules,quantitative and qualitative experiments on two public benchmarks,including S3DIS and ScanNet,indicate the superior performance of the proposed framework on the task of 3D point cloud semantic segmentation,compared to some state-of-the-art methods.

关键词： Few-shot point cloud semantic segmentation CapsNets

来源：评论

学校读者我要写书评

暂无评论

Assessing Unfairness in GNN-Based Recommender Systems: A Focus on Metrics for Demographic Sub-Groups 20

Assessing Unfairness in GNN-Based Recommender Systems: A Foc...

引用

20th International Conference on Web Information Systems and Technologies, WEBIST 2024

作者： Chizari, Nikzad Tajfar, Keywan Moreno-García, María N. Department of Computer Science and Automation University of Salamanca Plaza de los Caídos sn Salamanca37008 Spain College of Science School of Mathematics Statistics and Computer Science Department of Statistics University of Tehran Tehran Iran

ISBN: (纸本)9789897587184

Recommender Systems (RS) have become a central tool for providing personalized suggestions, yet the growing complexity of modern methods, such as Graph Neural Networks (GNNs), has introduced new challenges related to bias and fairness. While these methods excel at capturing intricate relationships between users and items, they often amplify biases present in the data, leading to discriminatory outcomes especially against protected demographic groups like gender and age. This study evaluates and measures fairness in GNN-based RS by investigating the extent of unfairness towards various groups and su bgroups within these systems. By employing performance metrics like NDCG, this research highlights disparities in recommendation quality across different demographic groups, emphasizing the importance of accurate, group-level measurement. This analysis not only sheds light on how these biases manifest but also lays the groundwork for developing more equitable recommendation systems that ensure fair treatment across all user groups. Copyright © 2024 by SCITEPRESS.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

The most tenuous group query

引用

Frontiers of computer science 2023年第2期17卷 197-208页

作者： Na LI Huaijie ZHU Wenhao LU Ningning CUI Wei LIU Jian YIN Jianliang XU Wang-Chien LEE School of Computer Science and Engineering Sun Yat-Sen UniversityGuangzhou 510006China Laboratory of Big Data Analysis and Processing Guangzhou 510006China School of Artificial Intelligence Sun Yat-Sen UniversityGuangzhou 510006China Department of Computer Science Anhui UniversityHefei 230601China Department of Computer Science Hong Kong Baptist UniversityHong Kong 999077China Department of Computer Science The Pennsylvania State UniversityState College 19019USA

Rtecently a lot of works have been investigating to find the tenuous groups,i.e.,groups with few social interactions and weak relationships among members,for reviewer selection and psycho-educational group ***,the metrics(e.g.,k-triangle,k-line,and k-tenuity)used to measure the tenuity,require a suitable k value to be specified which is difficult for users without background ***,in this paper we formulate the most tenuous group(MTG)query in terms of the group distance and average group distance of a group measuring the tenuity to eliminate the influence of parameter k on the tenuity of the *** address the MTG problem,we first propose an exact algorithm,namely MTGVDIS,which takes priority to selecting those vertices whose vertex distance is large,to generate the result group,and also utilizes effective filtering and pruning *** MTGVDIS is not fast enough,we design an efficient exact algorithm,called MTG-VDGE,which exploits the degree metric to sort the vertexes and proposes a new combination order,namely degree and reverse based branch and bound(DRBB).MTG-VDGE gives priority to those vertices with small *** a large p,we further develop an approximation algorithm,namely MTG-VDLT,which discards candidate attendees with high degree to reduce the number of vertices to be *** experimental results on real datasets manifest that the proposed algorithms outperform existing approaches on both efficiency and group tenuity.

关键词： tenuous group pruning strategy social network group query

来源：评论

学校读者我要写书评

暂无评论

Sparse representation scheme with enhanced medium pixel intensity for face recognition

引用

CAAI Transactions on Intelligence Technology 2024年第1期9卷 116-127页

作者： Xuexue Zhang Yongjun Zhang Zewei Wang Wei Long Weihao Gao Bob Zhang State Key Laboratory of Public Big Data Institute for Artificial IntelligenceCollege of Computer Science and TechnologyGuizhou UniversityGuiyangGuizhouChina Department of Computer and Information Science University of MacaoAvenida da UniversidadeTaipaMacaoChina

Sparse representation is an effective data classification algorithm that depends on the known training samples to categorise the test *** has been widely used in various image classification *** in sparse representation means that only a few of instances selected from all training samples can effectively convey the essential class-specific information of the test sample,which is very important for *** deformable images such as human faces,pixels at the same location of different images of the same subject usually have different ***,extracting features and correctly classifying such deformable objects is very ***,the lighting,attitude and occlusion cause more *** the problems and challenges listed above,a novel image representation and classification algorithm is ***,the authors’algorithm generates virtual samples by a non-linear variation *** method can effectively extract the low-frequency information of space-domain features of the original image,which is very useful for representing deformable *** combination of the original and virtual samples is more beneficial to improve the clas-sification performance and robustness of the ***,the authors’algorithm calculates the expression coefficients of the original and virtual samples separately using the sparse representation principle and obtains the final score by a designed efficient score fusion *** weighting coefficients in the score fusion scheme are set entirely ***,the algorithm classifies the samples based on the final *** experimental results show that our method performs better classification than conventional sparse representation algorithms.

关键词： computer vision face recognition image classification image representation

来源：评论

学校读者我要写书评

暂无评论

Variable Selection for Distributed Sparse Regression Under Memory Constraints

引用

Communications in Mathematics and statistics 2024年第2期12卷 307-338页

作者： Haofeng Wang Xuejun Jiang Min Zhou Jiancheng Jiang Department of Mathematics Harbin Institute of TechnologyHarbinPeople's Republic of China Department of Statistics and Data Science Southerm Univerity of Science and TechnologyShenzhenPeople's Republic of China Beijing Normal University-Hong Kong Baptist University United International College ZhuhaiPeople's Republic of China Department of Mathematics and Statistics University of North Carolina at CharlotteCharlotteUSA

This paper studies variable selection using the penalized likelihood method for dis-tributed sparse regression with large sample size n under a limited memory *** is a much needed research problem to be solved in the big data era.A naive divide-and-conquer method solving this problem is to split the whole data into N parts and run each part on one of N machines,aggregate the results from all machines via averaging,andﬁnally obtain the selected ***,it tends to select more noise variables,and the false discovery rate may not be well *** improve it by a special designed weighted average in *** the alternating direction method of multiplier can be used to deal with massive data in the literature,our proposed method reduces the computational burden a lot and performs better by mean square error in most ***,we establish asymptotic properties of the resulting estimators for the likelihood models with a diverging number of *** some regularity conditions,we establish oracle properties in the sense that our distributed estimator shares the same asymptotic efﬁciency as the estimator based on the full ***,a distributed penalized likelihood algorithm is proposed to reﬁne the results in the context of general ***,the proposed method is evaluated by simulations and a real example.

关键词： Variable selection Distributed sparse regression Memory constraints Distributed penalized likelihood algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：