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

IEEE Transactions on Artificial Intelligence 2025年第2期6卷 301-316页

作者： Chen, Leiming Zhao, Dehai Tao, Liping Wang, Kai Qiao, Sibo Zeng, Xingjie Tan, Chee Wei China University of Petroleum School of Computer Science and Technology East China Qingdao266580 China CSIRO's Data61 Sydney2015 Australia Hefei University of Technology Anhui230009 China Nanyang Technological University School of Computer Science and Engineering Singapore639798 Singapore Tiangong University School of Software Tianjin300387 China Southwest Petroleum University School of Computer Science Chengdu610500 China

Federated learning (FL) enables cooperative computation between multiple participants while protecting user privacy. Currently, FL algorithms assume that all participants are trustworthy and their systems are secure. However, the following problems arise in real-world scenarios: 1) Malicious clients disrupt FL through model poisoning and data poisoning attacks. Although some research has proposed secure aggregation methods to solve this problem, most methods have limitations. 2) The current method cannot fairly evaluate client contribution in some scenarios. Some clients exhibit free-rider behavior, seeking to cheat the reward system and manipulate global models. Evaluating client contribution and distributing rewards also present challenges. To address these challenges, we design a trustworthy federated framework to ensure secure computing throughout the federated task process. First, we propose a method of detecting malicious models to guarantee secure model aggregation. Then, we propose a fair method of assessing contribution to identify client-side free-riding behavior. Finally, we implement a computation process based on blockchain and smart contracts to guarantee the trustworthiness and fairness of federated tasks. To validate the performance of our framework, we simulate different types of client attacks and contribution evaluation scenarios on several open-source datasets. The experiments show that our framework ensures the credibility of federated tasks and achieves a fair evaluation of client contributions. © 2020 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Quantifying Racial Segregation Through Continuous-Time Quantum Walks 27th

Quantifying Racial Segregation Through Continuous-Time Quant...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Jiang, Yutong Wu, Xing Wang, Jianjia School of Computer Engineering and Science Shanghai University Shanghai China Engineering and Science Shanghai Institute for Advanced Communication and Data Science School of Computer Shanghai University Shanghai China Xi’an Jiaotong-Liverpool University Suzhou215123 China

ISBN: (纸本)9783031781919

With the development of cities, racial segregation is one of the reasons for social inequality on a large scale, it is also a major factor affecting economic development. However, racial segregation has received comparatively limited attention in research. In the paper, we propose a segregation index independent of any parameters( titled Quantum Walk Convergence Time), which calculates the convergence time statistics for accessing different racial categories through quantum walks on complex networks constructed from urban systems. The magnitude of the time statistics represents the degree of racial segregation. The results generated by our method can also be applied to other social factors, including family situation, income level, and education level. We evaluate our method using large-scale real datasets, including statistics from the U.S. Census Bureau and the Office for National Statistics in the UK. The results demonstrate the close correlation between our method and the degree of racial segregation, showing advantages over traditional random walk methods. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Continuous time systems

来源：评论

学校读者我要写书评

暂无评论

Learning to Communicate Among Agents for Large-Scale Dynamic Path Planning With Genetic Programming Hyperheuristic

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第5期6卷 1269-1283页

作者： Liao, Xiao-Cheng Hu, Xiao-Min Chen, Xiang-Ling Mei, Yi Jia, Ya-Hui Chen, Wei-Neng Victoria University of Wellington Centre for Data Science and Artificial Intelligence School of Engineering and Computer Science Wellington6140 New Zealand Guangdong University of Technology School of Computer Science and Technology Guangzhou510006 China Hanyang University Department of Electrical and Electronic Engineering Ansan15588 Korea Republic of South China University of Technology School of Future Technology Guangzhou510006 China Pazhou Lab Guangzhou510005 China South China University of Technology School of Computer Science and Engineering State Key Laboratory of Subtropical Building and Urban Science Guangzhou510006 China

Genetic programming hyperheuristic (GPHH) has recently become a promising methodology for large-scale dynamic path planning (LDPP) since it can produce reusable heuristics rather than disposable solutions. However, in this methodology, the extracted local and decentralized heuristic for agents that lack a global systemic view sometimes may be problematic. Therefore, a new challenge is to strike a balance between conciseness to improve generalization ability and incorporation of more global information to obtain better performance. In this work, we target the LDPP problem and propose a communication learning mechanism (ComLGP) for GPHH to address the above difficulties. In ComLGP, a communication function is introduced to serve as a communication protocol and exist in the form of an extra terminal in GPHH. Compared to the classic terminals which are fixed in genetic programing, this communication function undergoes optimization along with the evolutionary process of GPHH. In this way, the communication function can be learned which enables agents to communicate without a predefined communication protocol. Then, a caching and lazy updating mechanism for ComLGP is presented to accelerate the calculation of communication content. Last, we verified our method on 22 scenarios including two real world road networks. The experimental results demonstrate that the proposed ComLGP can successfully learn to communicate. Although in the absence of any manually designed communication features, ComLGP is capable of achieving performance competitive to the state-of-the-art method that employs a predefined communication protocol and outperforms the remaining compared methods in most scenarios. © 2020 IEEE.

关键词： Genetic programming

来源：评论

学校读者我要写书评

暂无评论

Conformal Prediction Techniques for Electricity Price Forecasting 9th

Conformal Prediction Techniques for Electricity Price Forec...

引用

9th International Workshop on Advanced Analytics and Learning on Temporal data, AALTD 2024

作者： O’Connor, Ciaran Prestwich, Steven Visentin, Andrea SFI CRT in Artificial Intelligence School of Computer Science & IT University College Cork Cork Ireland Insight Centre for Data Analytics School of Computer Science & IT University College Cork Cork Ireland

ISBN: (纸本)9783031770654

Integrating the erratic production of renewable energy into the electricity grid poses numerous challenges. One approach to stabilising market prices and reducing energy losses due to curtailments is the deployment of batteries. Efficient electricity arbitrage is crucial to make investments in storage systems financially viable;trading solutions to achieve this rely on price forecasting techniques. This study delves into the application of Conformal Prediction (CP) techniques, including Ensemble Batch Prediction Intervals (EnbPI) and Sequential Predictive Conformal Inference for Time Series (SPCI), for generating probabilistic forecasts in the Irish electricity market. Recent advancements in CP have addressed temporal considerations inherent in time series forecasting, eliminating the need for exchangeability assumptions. Our study demonstrates that despite potential efficiency trade-offs, CP methods consistently yield precise and reliable prediction intervals, ensuring comprehensive coverage. We assess the impact of CP on the financial results of a simulated trading algorithm. Monetary outcomes achieved with EnbPI and SPCI outperform those of both split CP and traditional quantile regression models, highlighting the practical superiority of CP in electricity price forecasting. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

Fine extraction of multi-crop planting area based on deep learning with Sentinel- 2 time-series data

引用

Environmental science and Pollution Research 2025年第19期32卷 11931-11949页

作者： Jiang, Jingmin Zhang, Jiahua Wang, Xue Zhang, Shichao Kong, Delong Wang, Xiaopeng Ali, Shawkat Ullah, Hidayat Space Information and Big Earth Data Research Center School of Computer Science and Technology Qingdao University Qingdao266071 China Key Laboratory of Digital Earth Science Aerospace Information Research Institute Chinese Academy of Sciences Beijing100094 China

Accurate and timely access to the spatial distribution of crops is crucial for sustainable agricultural development and food security. However, extracting multi-crop areas based on high-resolution time-series data and deep learning still faces challenges. Therefore, this study aims to provide an effective model for multi-crop classification using high-resolution remote sensing time-series data. We designed two deep learning models based on convolutional neural network-long short-term memory (CNN-LSTM) and bidirectional long short-term memory (Bi-LSTM). The monthly synthetic time series of the normalized difference vegetation index (NDVI) from Sentinel-2 data will be used as input features to extract the multi-crop planting area in Shandong province’s northwestern, southwestern, and eastern regions. The results showed that deep learning models achieved higher accuracy compared to the random forest (RF) and extreme gradient boosting (XGBoost) models, with CNN-LSTM achieving the highest overall accuracy of 96.48%. At the county level, the coefficients of determination (R2) for the CNN-LSTM model were 0.91 for wheat, 0.88 for maize, and 0.73 for spring cotton. This study demonstrates that the CNN-LSTM model combined with monthly synthetic time-series NDVI provides a feasible approach for accurately mapping high-resolution multi-crop planting areas and also contributes significantly to decision support and resource management in agricultural production. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Deep learning High-resolution Monthly synthetic time-series NDVI Multi-crop classification Remote sensing Sentinel- 2

来源：评论

学校读者我要写书评

暂无评论

Evaluating BERT-based language models for detecting misinformation

引用

Neural Computing and Applications 2025年第16期37卷 9937-9968页

作者： Anggrainingsih, Rini Hassan, Ghulam Mubashar Datta, Amitava Information Technology and Data Science Faculty Sebelas Maret University Ir Sutami 36A Central Java Surakarta57126 Indonesia Computer Science and Software Engineering The University of Western Australia 35 Stirling Highway PerthWA6009 Australia

Online misinformation poses a significant challenge due to its rapid spread and limited supervision. To address this issue, automated rumour detection techniques are essential for countering the negative impact of false information. Previous research primarily focussed on extracting text features, which proved time-consuming and less effective. In this study, we contribute substantially to two domains: rumour detection on Twitter and the evaluation of text embeddings. We thoroughly analyse rumour detection models and compare the quality of text embeddings generated by various fine-tuned BERT-based models. Our findings indicate that our proposed models outperform existing techniques. Notably, when we test these models on combined datasets, we observe significant performance improvements with larger training and testing data sizes. We conclude that carefully considering the dataset, data splitting, and classification techniques is crucial for evaluating solution performance. Additionally, we find that differences in the quality of text embeddings between RoBERTa, BERT, and DistilBERT are insignificant. This challenges existing assumptions and highlights the need for future research to explore these nuances further. © The Author(s) 2025.

关键词： BERT-based models Comparative analysis Rumour detection Text embeddings

来源：评论

学校读者我要写书评

暂无评论

Dynamic updating approximations of local multigranulation neighborhood covering rough sets

引用

Soft Computing 2025年第6期29卷 2531-2550页

作者： Shi, Qi Zhang, Yan-Lan School of Computer Science Minnan Normal University Fujian Zhangzhou363000 China Key Laboratory of Data Science and Intelligence Application Fujian Province University Fujian Zhangzhou363000 China

The lower and upper approximations in rough set theory are important for dealing with uncertain knowledge. The covering rough set is an important part of the rough set theory and is suitable for dealing with numerical data. With the development of information technology, the information is constantly updated and changed in various information systems, and it is crucial to efficiently obtain the lower and upper approximations in dynamic environments. In this paper, the matrix-based methods for updating the approximate operators of local multigranulation neighborhood covering rough sets when objects are added or deleted are mainly investigated. Firstly, the local multigranulation neighborhood covering rough set model is introduced. Then, we analyze the relationships between the prior matrices and the updating matrices when objects change. Meanwhile, the dynamic updating processes for lower and upper approximations are proposed. The time complexity analyses of algorithms theoretically prove the efficiency of dynamic algorithms compared with static ones. To illustrate the effectiveness of the proposed dynamic algorithms, six datasets from the UCI are employed for comparative experiments. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Knowledge based systems

来源：评论

学校读者我要写书评

暂无评论

Incremental SAT-Based Enumeration of Solutions to the Yang-Baxter Equation 31th

Incremental SAT-Based Enumeration of Solutions to the Yang-B...

引用

31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2025, which was held as part of the International Joint Conferences on Theory and Practice of Software, ETAPS 2025

作者： Van Caudenberg, Daimy Bogaerts, Bart Vendramin, Leandro Department of Computer Science KU Leuven Leuven. AI Leuven3000 Belgium Department of Computer Science Vrije Universiteit Brussel Brussels1050 Belgium Department of Mathematics and Data Science Vrije Universiteit Brussel Brussels1050 Belgium

ISBN: (纸本)9783031906527

We tackle the problem of enumerating set-theoretic solutions to the Yang-Baxter equation. This equation originates from statistical and quantum mechanics, but also has applications in knot theory, cryptography, quantum computation and group theory. Non-degenerate, involutive solutions have been enumerated for sets up to size 10 using constraint programming with partial static symmetry breaking [1];for general non-involutive solutions, a similar approach was used to enumerate solutions for sets up to size 8. In this paper, we use and extend the SAT Modulo Symmetries framework (SMS), to expand the boundaries for which solutions are known. The SMS framework relies on a minimality check;we present two solutions to this, one that stays close to the original one designed for enumerating graphs and a new incremental, SAT-based approach. With our new method, we can reproduce previously known results much faster and also report on results for sizes that have remained out of reach so far. © The Author(s) 2025.

关键词： Lie groups

来源：评论

学校读者我要写书评

暂无评论

Thalaseemia Prediction Using Deep Neural Networks: A Step Towards Personalized Medicine 2

Thalaseemia Prediction Using Deep Neural Networks: A Step To...

引用

2nd International Conference on Machine Learning and Autonomous Systems, ICMLAS 2025

作者： Pream Sudha, V. Karpagavalli, S. Sathiyakumari, K. Sountharraj, A.C. Dr.N. G.P Arts and Science College Department of Computer Science with Data Analytics Coimbatore India PSGR Krishnammal College for Women Department of Computer Science Coimbatore India

ISBN: (纸本)9798331505745

Thalaseemia is a series of genetic hemolytic diseases brought on by defective hemoglobin synthesis. It is prevalent in many Asian, African, and Mediterranean nations. Four million Indians are Thalaseemia carriers, and more than 100,000 are actively combating the condition, according to the World Health Organization. It is specifically taken under investigation because cases of Thalassemia that have clinical, hematologic characteristics cannot be effectively separated from cases of sickle cell anemia and are misdiagnosed as such. The precise profiles of the genetic and pathophysiological mechanisms of patients with Thalassemia are not yet well defined, despite the fact that they are clinically treated identically. Even among people with the same genotype, there are differences in the severity of the clinical phenotype. The frequency of complications changes over time, both within and between individuals. Patients display a striking variation in severity, from a milder clinical course to severe transfusion dependency and progressive organ destruction. This study focuses on the creation of a discriminative model for Thalaseemia classification. In this study, the prediction of Thalassemia is modeled as a pattern classification issue, and the models are constructed using deep learning approaches. The hybrid CNN-Long Short Term Memory (LSTM) based Thalaseemia prediction model has demonstrated improved performance, according to the performance evaluation of these models. © 2025 IEEE.

关键词： Theranostics

来源：评论

学校读者我要写书评

暂无评论

The Complexity of Learning LTL, CTL and ATL Formulas 42

The Complexity of Learning LTL, CTL and ATL Formulas

引用

42nd International Symposium on Theoretical Aspects of computer science, STACS 2025

作者： Bordais, Benjamin Neider, Daniel Roy, Rajarshi TU Dortmund University Center for Trustworthy Data Science and Security University Alliance Ruhr Dortmund Germany Department of Computer Science University of Oxford United Kingdom

ISBN: (纸本)9783959773652

We consider the problem of learning temporal logic formulas from examples of system behavior. Learning temporal properties has crystallized as an effective means to explain complex temporal behaviors. Several efficient algorithms have been designed for learning temporal formulas. However, the theoretical understanding of the complexity of the learning decision problems remains largely unexplored. To address this, we study the complexity of the passive learning problems of three prominent temporal logics, Linear Temporal Logic (LTL), Computation Tree Logic (CTL) and Alternating-time Temporal Logic (ATL) and several of their fragments. We show that learning formulas with unbounded occurrences of binary operators is NP-complete for all of these logics. On the other hand, when investigating the complexity of learning formulas with bounded occurrences of binary operators, we exhibit discrepancies between the complexity of learning LTL, CTL and ATL formulas (with a varying number of agents). © Benjamin Bordais, Daniel Neider, and Rajarshi Roy.

关键词： Temporal logic

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：