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

Solving Multiobjective Combinatorial Optimization via Learning to Improve Method

IEEE Transactions on Emerging Topics in Computational Intelligence 2025年第3期9卷 2122-2136页

作者： Ye, Te Zhang, Zizhen Zhang, Qingfu Chen, Jinbiao Wang, Jiahai Sun Yat-sen University School of Computer Science and Engineering Guangzhou510275 China Sun Yat-sen University Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou510275 China City University of Hong Kong Department of Computer Science Kowloon Hong Kong

Recently, neural combinatorial optimization (NCO) methods have been prevailing for solving multiobjective combinatorial optimization problems (MOCOPs). Most NCO methods are based on the "Learning to Construct"(L2C) paradigm, where the trained model(s) can directly generate a set of approximate Pareto optimal solutions. However, these methods still suffer from insufficient proximity and poor diversity towards the true Pareto front. In this paper, following the "Learning to Improve"(L2I) paradigm, we propose weight-related policy network (WRPN), a learning-based improvement method for solving MOCOPs. WRPN is incorporated into multiobjective evolutionary algorithm (MOEA) frameworks to effectively guide the search direction. A shared baseline for proximal policy optimization is presented to reduce variance in model training. A quality enhancement mechanism is designed to further refine the Pareto set during model inference. Computational experiments conducted on two classic MOCOPs, i.e., multiobjective traveling salesman problem and multiobjective vehicle routing problem, indicate that our method achieves remarkable results. Notably, our WRPN module can be easily integrated into various MOEA frameworks such as NSGA-II, MOEA/D and MOGLS, providing versatility and applicability across different problem domains. © 2025 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A Summary Research of the Current Status, Hot Spots and Trends in STEM Education: Visual Analysis Based on Relevant Literature Published in CNKI database 5th

A Summary Research of the Current Status, Hot Spots and Tren...

引用

5th International Conference on Computer Science and Educational Informatization, CSEI 2023

作者： Shi, Xiaobo Zhao, Bingying Li, Ningning Lian, Weiwei Li, Gongli Key Laboratory of Artificial Intelligence and Personalized Learning in Education Big Data Engineering Lab of Teaching Resources & Assessment of Education Quality College of Computer and Information Engineering Henan Normal University Xinxiang China

ISBN: (纸本)9789819994984

In the context of the publication of the "Thirteenth Five-Year Plan for Educational Informationization," and China’s entry into the era of education informatization, the integration of information technology and STEM education has become research hot topic. This article uses visualization tools to analyze STEM education literature from 2016 to 2023, summarizes the current status of STEM education research in China, and identifies four research hotspots: research on the application of information technology to broaden the sources and design forms of STEM courses, research on the adaptability of STEM teachers to educational technology reforms, research on the mutual learning of STEM education and maker education under the background of "Internet+". And research on the transition from STEM Education to STEAM Education in the era of Educational Informatization. It also identifies five research trends: research on the participation of the whole people in promoting the Development of STEM Education, research on promoting the Integration of STEM Education and Creator Education, research on the Integration of STEM Education and Deep Learning assisted by emerging Technologies, research on two-way empowerment of STEM education and artificial intelligence, research on STEM Teachers’ Professional Development to meet the needs of Educational Information era. Finally, development suggestions are proposed for the problems existing in the development of STEM education under the background of educational informatization, which can provide references for the reform and innovation of STEM education in the future. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Informatization

来源：评论

学校读者我要写书评

暂无评论

Maximizing Influence in Temporal Social Networks:A Node Feature-Aware Voting Algorithm

引用

Computers, Materials & Continua 2023年第12期77卷 3095-3117页

作者： Wenlong Zhu Yu Miao Shuangshuang Yang Zuozheng Lian Lianhe Cui College of Computer and Control Engineering Qiqihar UniversityQiqihar161006China Heilongjiang Key Laboratory of Big Data Network Security Detection and Analysis Qiqihar UniversityQiqihar161006China College of Teacher Education Qiqihar UniversityQiqihar161006China

Influence Maximization(IM)aims to select a seed set of size k in a social network so that information can be spread most widely under a specific information propagation model through this set of ***,most existing studies on the IM problem focus on static social network features,while neglecting the features of temporal social *** bridge this gap,we focus on node features reflected by their historical interaction behavior in temporal social networks,i.e.,interaction attributes and self-similarity,and incorporate them into the influence maximization algorithm and information propagation ***,we propose a node feature-aware voting algorithm,called ISVoteRank,for seed nodes ***,before voting,the algorithm sets the initial voting ability of nodes in a personalized manner by combining their *** the voting process,voting weights are set based on the interaction strength between nodes,allowing nodes to vote at different extents and subsequently weakening their voting ability *** process concludes by selecting the top k nodes with the highest voting scores as seeds,avoiding the inefficiency of iterative seed selection in traditional voting-based ***,we extend the Independent Cascade(IC)model and propose the Dynamic Independent Cascade(DIC)model,which aims to capture the dynamic features in the information propagation process by combining node ***,experiments demonstrate that the ISVoteRank algorithm has been improved in both effectiveness and efficiency compared to baseline methods,and the influence spread through the DIC model is improved compared to the IC model.

关键词： Temporal social networks influence maximization voting strategy interactive properties self-similarity

来源：评论

学校读者我要写书评

暂无评论

Comparative research on multi-source heterogeneous data fusion technologies 11

Comparative research on multi-source heterogeneous data fusi...

引用

11th International Conference on Information Technology and Quantitative Management, ITQM 2024

作者： Long, Wen Gao, Jing Guo, Man School of Economics and Management University of Chinese Academy of Sciences Beijing100090 China Research Center on Fictitious Economy & Data Science Chinese Academy of Sciences Beijing100190 China Key Laboratory of Big Data Mining & Knowledge Management Chinese Academy of Sciences Beijing100190 China

Both structured market data and unstructured financial news data can significantly affect stock price fluctuations. Therefore, relying only on a single data source for stock price trend prediction may produce information bias. This article combines these two types of heterogeneous data and systematically compares the effectiveness of different data fusion technologies to establish the optimal data integration strategy, thereby improving the accuracy of stock price prediction. Specifically, this paper innovatively proposes a stock price trend prediction model named MVL-SVM. The model successfully combines multi-perspective learning with support vector machine, and realizes the effective fusion of stock market data and financial news data. It is worth mentioning that the prediction accuracy of MVL-SVM model using direct fusion method is more than 30% higher than that of index modeling method, which indicates that direct fusion method can fully learn effective information from multiple information sources, thus significantly improving the prediction effect. © 2024 The Authors.

关键词： data accuracy

来源：评论

学校读者我要写书评

暂无评论

A Positive Influence Maximization Algorithm in Signed Social Networks

引用

Computers, Materials & Continua 2023年第8期76卷 1977-1994页

作者： Wenlong Zhu Yang Huang Shuangshuang Yang Yu Miao Chongyuan Peng College of Computer and Control Engineering Qiqihar UniversityQiqihar161006China Heilongjiang Key Laboratory of Big Data Network Security Detection and Analysis Qiqihar UniversityQiqihar161006China College of Teacher Education Qiqihar UniversityQiqihar161006China

The influence maximization(IM)problem aims to find a set of seed nodes that maximizes the spread of their influence in a social *** positive influence maximization(PIM)problem is an extension of the IM problem,which consider the polar relation of nodes in signed social networks so that the positive influence of seeds can be the most widely *** solve the PIM problem,this paper proposes the polar and decay related independent cascade(IC-PD)model to simulate the influence propagation of nodes and the decay of information during the influence propagation in signed social *** overcome the low efficiency of the greedy based algorithm,this paper defines the polar reverse reachable(PRR)set and devises a signed reverse influence sampling(SRIS)*** algorithm utilizes the ICPD model as well as the PRR set to select *** are two phases in *** is the sampling phase,which utilizes the IC-PD model to generate the PRR set and a binary search algorithm to calculate the number of needed PRR *** other is the node selection phase,which uses a greedy coverage algorithm to select optimal ***,Experiments on three real-world polar social network datasets demonstrate that SRIS outperforms the baseline algorithms in *** on the Slashdot dataset,SRIS achieves 24.7% higher performance than the best-performing compared algorithm under the weighted cascade model when the seed set size is 25.

关键词： Positive influencemaximization polar relation information decay reverse influence sampling

来源：评论

学校读者我要写书评

暂无评论

Flatness Loss for Image Dehazing

Flatness Loss for Image Dehazing

引用

2023 International Conference on Algorithms, High Performance Computing, and Artificial Intelligence, AHPCAI 2023

作者： Zhang, Chenyu Ye, Qihong Chen, Hongming Wang, Xiaoshuang School of Information Engineering Zhejiang Ocean University Zhoushan China Key Laboratory of Oceanographic Big Data Mining Application of Zhejiang Province China

ISBN: (纸本)9781510671881

In recent years, significant progress has been made in image dehazing, but most dehazing convolutional neural networks only learn from hazy images to the corresponding feature maps of clean images, ignoring the details of the images. In this paper, a new flatness loss function is proposed for single-image dehazing, thereby improving the overall effect of dehazing results. This loss function allows the model to focus on the texture features of hazy images and clean images, and supervises edge information by reducing the flatness difference between clean pixels and blurred pixels. The experiments on the benchmark dataset using the flatness loss function on the single-image dehazing model show that this method can effectively improve the quantitative performance of the model. © 2023 SPIE. All rights reserved.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Mal-Net: Multi-scale feature extraction and attention mechanism lightweight network for CSI feedback 3

Mal-Net: Multi-scale feature extraction and attention mechan...

引用

3rd International Conference on Advanced Algorithms and Signal Image Processing, AASIP 2023

作者： Song, Jinjie Chen, Hongming Zhao, Xiang Zhang, Chenyu Wu, Yiting Ye, Qihong School of Information Engineering Zhejiang Ocean University Zhoushan China Key Laboratory of Oceanographic Big Data Mining and Application of Zhejiang Province China

ISBN: (纸本)9781510668522

Massive multiple-input multiple-output (MIMO) system is one of the wireless technologies with great research significance based on channel state information (CSI). As the complexity of the CSI matrix increases, CSI feedback faces many challenges and limitations. This paper proposes a neural network composed of the encoder-decoder framework, which can effectively compress and recover CSI. The network utilizes a channel information generation module and multi-scale feature extraction module to enhance the information acquisition ability of the CSI matrix. At the same time, it reduces the computational complexity of the network by using lightweight architecture. Experimental results show that the network outperforms other advanced deep-learning methods at multiple compression rates. © COPYRIGHT SPIE. Downloading of the abstract is permitted for personal use only.

关键词： Channel state information

来源：评论

学校读者我要写书评

暂无评论

Accelerating local SGD for non-IID data using variance reduction

引用

Frontiers of Computer Science 2023年第2期17卷 73-89页

作者： Xianfeng LIANG Shuheng SHEN Enhong CHEN Jinchang LIU Qi LIU Yifei CHENG Zhen PAN Anhui Province Key Laboratory of Big Data Analysis and Application University of Science and Technology of ChinaHefei 230027China Ant Financial Services Group Hangzhou 310000China Department of Computer Science and Engineering Hong Kong University of Science and TechnologyHong Kong 999077China

Distributed stochastic gradient descent and its variants have been widely adopted in the training of machine learning models,which apply multiple workers in *** them,local-based algorithms,including Local SGD and FedAvg,have gained much attention due to their superior properties,such as low communication cost and ***,when the data distribution on workers is non-identical,local-based algorithms would encounter a significant degradation in the convergence *** this paper,we propose Variance Reduced Local SGD(VRL-SGD)to deal with the heterogeneous *** extra communication cost,VRL-SGD can reduce the gradient variance among workers caused by the heterogeneous data,and thus it prevents local-based algorithms from slow convergence ***,we present VRL-SGD-W with an effectivewarm-up mechanism for the scenarios,where the data among workers are quite *** from eliminating the impact of such heterogeneous data,we theoretically prove that VRL-SGD achieves a linear iteration speedup with lower communication complexity even if workers access non-identical *** conduct experiments on three machine learning *** experimental results demonstrate that VRL-SGD performs impressively better than Local SGD for the heterogeneous data and VRL-SGD-W is much robust under high data variance among workers.

关键词： distributed optimization variance reduction local SGD federated learning non-IID data

来源：评论

学校读者我要写书评

暂无评论

Learning Self-Supervised Vision Transformers from Scratch for Aerial Person Re- Identification 13

Learning Self-Supervised Vision Transformers from Scratch fo...

引用

13th International Conference on Information Technology in Medicine and Education, ITME 2023

作者： Peng, Houfu Xu, Lili Lu, Xing Xia, Daoxun Guizhou Normal University Guizhou Key Laboratory of Information and Computing Science Guiyang China School of Big Data and Computer Science Guizhou Normal University Guiyang China Guizhou Normal University Engineering Laboratory for Applied Technology of Big Data in Education Guiyang China

ISBN: (纸本)9798350319156

In recent years, person re-identification (Re-ID) as a widely studied computer vision task, has reached a saturation state under closed-world setting, which encourages researchers to further explore more realistic scenarios. Among them, person Re- Idin aerial imagery is proposed and improved due to its unique practical importance in public security. However, since the aerial person images are taken by unmanned aerial vehicles (UAV s), influenced by camera height and angle of view, there are more serious problems such as weak appearance feature and occlusion than ground person images. Most of the current state-of-the-art person Re-ID methods on closed-world datasets are based on local convolution neural network, and hardly works well when applying them to aerial person Re- Idtasks directly. In this paper, we improve the emerging vision transformer (ViT) and apply it to the person Re- Idin aerial imagery. It should be noted that a large amount of data is required to be pretrained for ViTs to achieve competitive performance. Considering the limitations of data, computing power and flexibility in practical scenarios, we improve the pre-training process based on self-supervised learning, and achieve training ViTs from scratch with limited data. Specifically, in pre-training stage, the self-supervised paradigm based on parameter instance discrimination is applied to capture feature alignment and instance similarity, which alleviates the data-hungry of ViTs caused by the lack of inductive bias. Extensive comparative evaluation experiments are conducted on the aerial Re- Iddataset. Our method achieves a Rank-1 accuracy of 65.29% and a mean average precision (mAP) of 57.31%, which proves its effectiveness in aerial person Re-ID tasks. © 2023 IEEE.

关键词： Antennas

来源：评论

学校读者我要写书评

暂无评论

基于数据挖掘技术的税务风险检测方法评述

引用

engineering 2024年第3期34卷 43-59页

作者： Qinghua Zheng Yiming Xu Huixiang Liu Bin Shi Jiaxiang Wang Bo Dong School of Computer Science and Technology Xi’an Jiaotong UniversityXi’an 710049China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong UniversityXi’an 710049China School of Distance Education Xi’an Jiaotong UniversityXi’an 710049China

Tax risk behavior causes serious loss of fiscal revenue,damages the country’s public infrastructure,and disturbs the market economic order of fair *** recent years,tax risk detection,driven by information technology such as data mining and artificial intelligence,has received extensive *** promote the high-quality development of tax risk detection methods,this paper provides the first comprehensive overview and summary of existing tax risk detection methods *** specifi-cally,it first discusses the causes and negative impacts of tax risk behaviors,along with the development of tax risk *** then focuses on data-mining-based tax risk detection methods utilized around the *** on the different principles employed by the algorithms,existing risk detection methods can be divided into two categories:relationship-based and non-relationship-based.A total of 14 risk detection methods are identified,and each method is thoroughly explored and ***,four major technical bottlenecks of current data-driven tax risk detection methods are analyzed and discussed,including the difficulty of integrating and using fiscal and tax fragmented knowledge,unexplainable risk detection results,the high cost of risk detection algorithms,and the reliance of existing algorithms on labeled *** investigating these issues,it is concluded that knowledge-guided and datadriven big data knowledge engineering will be the development trend in the field of tax risk in the future;that is,the gradual transition of tax risk detection from informatization to intelligence is the future development direction.

关键词： Tax risk detection data mining knowledge guide Informatization Intellectualization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：