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

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Zhang, Yichi Chen, Zhuo Guo, Lingbing Xu, Yajing Hu, Binbin Liu, Ziqi Zhang, Wen Chen, Huajun College of Computer Science and Technology Zhejiang University China ZJU-Ant Group Joint Lab of Knowledge Graph China Ant Group China School of Software Technology Zhejiang University China Zhejiang Key Laboratory of Big Data Intelligent Computing China

ISBN: (纸本)157735897X

Multi-modal knowledge graph completion (MMKGC) aims to discover unobserved knowledge from given knowledge graphs, collaboratively leveraging structural information from the triples and multi-modal information of the entities to overcome the inherent incompleteness. Existing MMKGC methods usually extract multi-modal features with pre-trained models, resulting in coarse handling of multi-modal entity information, overlooking the nuanced, fine-grained semantic details and their complex interactions. To tackle this shortfall, we introduce a novel framework MYGO to tokenize, fuse, and augment the fine-grained multi-modal representations of entities and enhance the MMKGC performance. Motivated by the tokenization technology, MYGO tokenizes multi-modal entity information as fine-grained discrete tokens and learns entity representations with a cross-modal entity encoder. To further augment the multi-modal representations, MYGO incorporates fine-grained contrastive learning to highlight the specificity of the entity representations. Experiments on standard MMKGC benchmarks reveal that our method surpasses 19 of the latest models, underlining its superior performance. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A Multi-direction Prediction Multi-objective Hybrid Chemical Reaction Optimization Algorithm for Dynamic Multi-objective Optimization 16th

A Multi-direction Prediction Multi-objective Hybrid Chemical...

引用

16th International Conference on Bio-Inspired computing: Theories and Applications, BIC-TA 2021

作者： Li, Hongye Pan, Xiaoying Gan, Wei Wang, Lei School of Computer Science and Technology Xi’an University of Posts and Telecommunications Shaanxi Xi’an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Shaanxi Xi’an710121 China Xi’an Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi’an710121 China Xi’an Shiyou University Shaanxi Xi’an710065 China School of Computer Science and Engineering Xi’an University of Technology Xi’an710048 China Shaanxi University of Technology Shaanxi Han Zhong723001 China

ISBN: (纸本)9789811912559

The challenge of solving dynamic multi-objective optimization problems is to trace the varying Pareto optimal front and/or Pareto optimal set quickly and efficiently. This paper proposes a multi-direction prediction strategy using a hybrid chemical reaction optimization, aimed at finding the dynamic Pareto optimal front and/or Pareto optimal set as quickly and accurately as possible before the next environmental change occurs. The proposed method, multi-direction prediction multi-objective hybrid chemical reaction optimization algorithm which mainly includes a hybrid chemical reaction optimization algorithm is proposed for solving dynamic multi-objective problems, which can guide population trace the optimum. When the environment has changed, the population is divided into several subpopulations. In subpopulation, a center point was found to construct multi-direction prediction model. As a result, this approach enhances the diversity of algorithm. While the environment has not changed, the hybrid chemical reaction algorithm with particle swarm optimization algorithm can efficiency find the optimal solution, it can achieve good diversity as well as guarantee the avoidance of local optimal solutions. The proposed algorithm is measured on several benchmark test suites with various dynamic characteristics and different difficulties. Experimental results show that this algorithm is very competitive in dealing with dynamic multi-objective optimization problems when compared with four state-of-the-art approaches. © 2022, Springer Nature Singapore Pte Ltd.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Martingale Stopping Rule Application in Bayesian A/B Testing With Batch data

引用

IEEE Access 2025年 13卷 100462-100478页

作者： Yali Wang Haiyan Yu Ching-Chi Yang Ronggui Zhang School of Management Huazhong University of Science and Technology Wuhan Hubei China School of Economics and Management Chongqing University of Posts and Telecommunications Chongqing China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing China Chongqing Big Data Research Institute Peking University Chongqing China Department of Mathematical Sciences The University of Memphis Memphis TN USA Chongqing Key Laboratory of Emergency Medicine Chongqing Emergency Medical Center Chongqing University Central Hospital School of Medicine Chongqing University Chongqing China NHC Key Laboratory of Birth Defects and Reproductive Health Chongqing Population and Family Planning Science and Technology Research Institute Chongqing China

Continuous monitoring in A/B testing is widely used for selecting options, variants, or treatments in healthcare analytics. However, the appropriate stopping strategy for A/B testing in continuous monitoring remains unclear. This study proposes a Bayesian A/B testing method for continuous monitoring, incorporating a martingale stopping strategy. A uniform Beta distribution is used as the prior in the Bayesian A/B testing method. The posterior expected loss is employed as the criterion for choosing an option. When the posterior expected loss falls below a preset threshold, the result of the continuous monitoring is accepted for the A/B testing. With the proposed method, continuous monitoring of the null hypothesis (that the conversion rate of A is less than that of B) is managed using the posterior expected loss. The results obtained using the martingale stopping strategy enhance the interpretability of the A/B testing process. Finally, the effectiveness of the Bayesian A/B testing method is validated through numerical experiments on both simulated data and real-world applications.

关键词： Testing Bayes methods Monitoring Convergence Standards Decision making Posterior probability Stochastic processes Statistical analysis Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Prediction Method Based on MODWT-EMD for Time Series in Wireless Sensor Networks 16

A Hybrid Prediction Method Based on MODWT-EMD for Time Serie...

引用

16th IEEE International Conference on intelligent Systems and Knowledge Engineering, ISKE 2021

作者： Wang, Zhongmin Jia, Jingwen Gao, Cong Chen, Yanping Xia, Hong Xi'an University of Posts and Telecommunications Xi'an Key Laboratory of Big Data and Intelligent Computing Xi'an China Xi'an University of Posts and Telecommunications School of Computer Science Technology Xi'an China Xi'an University of Posts and Telecommunications Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an China

ISBN: (纸本)9781665405539

Time series is the main form of sensor data. Time series prediction is conducive to reduce the energy consumption of sensor nodes and increase the service life. As time cost and computation cost of the existing hybrid prediction methods for time series are not good, this paper proposes a hybrid prediction method based on MODWT-EMD for time series. Firstly, the original time series is decomposed into multiple frequency components by Maximal Overlapping Discrete Wavelet Transform (MODWT). Secondly, the multiple frequency components are decomposed successively by Empirical Mode Decomposition (EMD) to obtain IMF components and residuals. IMFs and residuals contain the feature information of time series. Then, the importance of the extracted feature information is scored and sorted by random forest. We select feature information with a higher score. Finally, the selected feature information is input into Bi-GRU for training. We predicted the original time series by the trained Bi-GRU and obtained the prediction results. The experimental results show that the method proposed in this paper can predict the time series effectively. © 2021 IEEE.

关键词： Empirical mode decomposition

来源：评论

学校读者我要写书评

暂无评论

Achieving Network Resilience through Graph Neural Network-enabled Deep Reinforcement Learning

引用

IEEE Network 2025年

作者： Li, Xuzeng Zhang, Tao Wang, Jian Han, Zhen Liu, Jiqiang Kang, Jiawen Niyato, Dusit Jamalipour, Abbas Beijing Jiaotong University School of Cyberspace Science and Technology China Beijing Key Laboratory of Security and Privacy in Intelligent Transportation Beijing100044 China Guangdong University of Technology Technology School of Automation China Nanyang Technological University College of Computing and Data Science Singapore University of Sydney SydneyNSW2006 Australia

Deep reinforcement learning (DRL) has been widely used in many important tasks of communication networks. In order to improve the perception ability of DRL on the network, some studies have combined graph neural networks (GNNs) with DRL, which use the GNNs to extract unstructured features of the network. However, as networks continue to evolve and become increasingly complex, existing GNN-DRL methods still face challenges in terms of scalability and robustness. Moreover, these methods are inadequate for addressing network security issues. From the perspective of security and robustness, this paper explores the solution of combining GNNs with DRL to build a resilient network. This article starts with a brief tutorial of GNNs and DRL, and introduces their existing applications in networks. Furthermore, we introduce the network security methods that can be strengthened by GNN-DRL approaches. Then, we designed a framework based on GNN-DRL to defend against attacks and enhance network resilience. Additionally, we conduct a case study using an encrypted traffic dataset collected from real IoT environments, and the results demonstrated the effectiveness and superiority of our framework. Finally, we highlight key open challenges and opportunities for enhancing network resilience with GNN-DRL. © 2025 IEEE. All rights reserved,

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Multi-Granularity Open Intent Classification via Adaptive Granular-Ball Decision Boundary 39

Multi-Granularity Open Intent Classification via Adaptive Gr...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Li, Yanhua Ouyang, Xiaocao Pan, Chaofan Zhang, Jie Zhao, Sen Xia, Shuyin Yang, Xin Wang, Guoyin Li, Tianrui School of Computing and Artificial Intelligence Southwestern University of Finance and Economics Chengdu 611130 China Engineering Research Center of Intelligent Finance Ministry of Education Chengdu 611130 China Key Laboratory of Big Data Intelligent Computing Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongqing 400065 China National Center for Applied Mathematics in Chongqing Chongqing Normal University Chongqing 401331 China School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu 611756 China

ISBN: (纸本)157735897X

Open intent classification is critical for the development of dialogue systems, aiming to accurately classify known intents into their corresponding classes while identifying unknown intents. Prior boundary-based methods assumed known intents fit within compact spherical regions, focusing on coarse-grained representation and precise spherical decision boundaries. However, these assumptions are often violated in practical scenarios, making it difficult to distinguish known intent classes from unknowns using a single spherical boundary. To tackle these issues, we propose a Multi-granularity Open intent classification method via adaptive Granular-Ball decision boundary (MOGB). Our MOGB method consists of two modules: representation learning and decision boundary acquiring. To effectively represent the intent distribution, we design a hierarchical representation learning method. This involves iteratively alternating between adaptive granular-ball clustering and nearest sub-centroid classification to capture fine-grained semantic structures within known intent classes. Furthermore, multi-granularity decision boundaries are constructed for open intent classification by employing granular-balls with varying centroids and radii. Extensive experiments conducted on three public datasets demonstrate the effectiveness of our proposed method. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Graph Regularized Nonnegative Latent Factor Analysis Model for Temporal Link Prediction in Cryptocurrency Transaction Networks 19

Graph Regularized Nonnegative Latent Factor Analysis Model f...

引用

19th IEEE International Conference on Networking, Sensing and Control, ICNSC 2022

作者： Zhou, Yue Liu, ZhiGang Yuan, Ye Chongqing University of Posts and Telecommunications School of Computer Science and Technology Chongqing400065 China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing400714 China The Chongqing School University of Chinese Academy of Sciences Chongqing400714 China Southwest University College of Computer and Information Science Chongqing400715 China

ISBN: (纸本)9781665472432

With the development of blockchain technology, a cryptocurrency based on blockchain technology is becoming more and more popular. The huge cryptocurrency transaction network has therefore received widespread attention. The link prediction learning structure of the network is supportive to understand the mechanism of networks, so it also has been widely studied in the cryptocurrency network. However, the dynamics of cryptocurrency transaction networks have been neglected in past studies. In this study, therefore, we use a graph-regularized method to link past transaction records with future transactions. Based on this, we propose a single latent factor-dependent, nonnegative, multiplicative, and graph regularized-incorporated update (SLF-NMGRU) algorithm and further propose a graph regularized nonnegative latent factor analysis (GrNLFA) model. Eventually, the experimental results on a real cryptocurrency transaction network show that the proposed method improves both the accuracy and computational efficiency. © 2022 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

High-Level Synthesis for Microfluidic Biochips Considering Actual Volume Management and Channel Storage

High-Level Synthesis for Microfluidic Biochips Considering A...

引用

IEEE International Symposium on Quality Electronic Design

作者： Zhengyang Chen Yuhan Zhu Zhen Chen Zhisheng Chen Genggeng Liu College of Computer and Data Science Fuzhou University Fuzhou China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing (Fuzhou University) Fuzhou China School of Informatics Xiamen University Xiamen China

ISBN: (数字)9798350309270

ISBN: (纸本)9798350309287

In recent years, microfluidic biochips have been widely applied in various fields of human society. The emergence of distributed channel-storage architecture enables fluid to be directly cached within the flow channels without being transported to the dedicated storage. However, the volume of the flow channels is limited, it is important to carefully consider the fluid volume to be cached to ensure it can be accommodated within the appropriate flow channels. In this paper, we propose a high-level synthesis method considering actual volume management and channel storage through integer linear programming, providing a rational analysis of fluid caching and the temporal relationships between different fluid-handling tasks. Experimental results conducted on multiple benchmark tests demonstrate the effectiveness of the proposed method in reducing the completion time of bioassay, the number of caches, the maximum fluid caching volume, and the number of fluid-handling tasks.

关键词： Fluids Biochips Estimation Cells (biology) Integer linear programming Benchmark testing Task analysis

来源：评论

学校读者我要写书评

暂无评论

FuzzyTrack: User Adaptive Cervical Spine Motion Prediction with Earable Inertial Sensing

引用

IEEE Transactions on Fuzzy Systems 2024年

作者： Luo, Chengwen Li, Yaxue Chen, Gecheng Li, Xing Zhang, Jin Wei, Bo Li, Jianqiang Shenzhen University National Engineering Laboratory for Big Data System Computing Technology China Dongguan University of Technology School of Electrical Engineering & Intelligentization Guangdong Dongguan523808 China Northeastern University China State Key Laboratory of Synthetical Automation for Process Industries Liaoning Shenyang110819 China Newcastle University United Kingdom

The widespread use of electronic devices has contributed to an increase in poor posture, particularly when it comes to the cervical spine, leading to various cervical vertebral pain disorders. In this paper, we focus on accurately monitoring the motion status of the cervical spine using the accelerometers and gyroscope sensors embedded in earphones. Our aim is to gain a better understanding of cervical spine health. To address the individual differences among subjects, we introduce fuzzy rules to the Re-ISDA method, proposing a novel approach known as FuzRe-ISDA. Unlike traditional domain adaptation methods, the FuzRe-ISDA method offers flexibility in adjusting the contribution from different source domains. It takes into account the collective impact of multiple models on predicting new user behavior. Moreover, this method can quickly adapt to new users without requiring extensive datasets. Experimental results demonstrate that our FuzRe-ISDA approach outperforms popular domain adaptation methods in terms of accuracy when predicting cervical motion. This highlights the effectiveness of our approach in addressing individual differences and improving the reliability of cervical spine motion prediction. © 1993-2012 IEEE.

关键词： Fuzzy rules

来源：评论

学校读者我要写书评

暂无评论

Adaptive Latent Factor Analysis via Generalized Momentum-Incorporated Particle Swarm Optimization 19

Adaptive Latent Factor Analysis via Generalized Momentum-Inc...

引用

19th IEEE International Conference on Networking, Sensing and Control, ICNSC 2022

作者： Chen, Jiufang Yuan, Ye School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing400714 China Chongqing School University of Chinese Academy of Sciences Chongqing400714 China College of Computer and Information Science Southwest University Chongqing400715 China

ISBN: (纸本)9781665472432

Stochastic gradient descent (SGD) algorithm is an effective learning strategy to build a latent factor analysis (LFA) model on a high-dimensional and incomplete (HDI) matrix. A particle swarm optimization (PSO) algorithm is commonly adopted to make an SGD-based LFA model's hyper-parameters, i.e., learning rate and regularization coefficient, self-adaptation. However, a standard PSO algorithm may suffer from accuracy loss caused by premature convergence. To address this issue, this paper incorporates more historical information into each particle's evolutionary process for avoiding premature convergence following the principle of a generalized-momentum (GM) method, thereby innovatively achieving a novel GM-incorporated PSO (GM-PSO). With it, a GM-PSO-based LFA (GMPL) model is further achieved to implement efficient self-adaptation of hyper-parameters. The experimental results on three HDI matrices demonstrate that the GMPL model achieves a higher prediction accuracy for missing data estimation in industrial applications. © 2022 IEEE.

关键词： Momentum

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：