Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant chal...Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant challenges in privacy-sensitive and distributed settings,often neglecting label dependencies and suffering from low computational efficiency.To address these issues,we introduce a novel framework,Fed-MFSDHBCPSO—federated MFS via dual-layer hybrid breeding cooperative particle swarm optimization algorithm with manifold and sparsity regularization(DHBCPSO-MSR).Leveraging the federated learning paradigm,Fed-MFSDHBCPSO allows clients to perform local feature selection(FS)using DHBCPSO-MSR.Locally selected feature subsets are encrypted with differential privacy(DP)and transmitted to a central server,where they are securely aggregated and refined through secure multi-party computation(SMPC)until global convergence is achieved.Within each client,DHBCPSO-MSR employs a dual-layer FS strategy.The inner layer constructs sample and label similarity graphs,generates Laplacian matrices to capture the manifold structure between samples and labels,and applies L2,1-norm regularization to sparsify the feature subset,yielding an optimized feature weight matrix.The outer layer uses a hybrid breeding cooperative particle swarm optimization algorithm to further refine the feature weight matrix and identify the optimal feature subset.The updated weight matrix is then fed back to the inner layer for further optimization.Comprehensive experiments on multiple real-world multi-label datasets demonstrate that Fed-MFSDHBCPSO consistently outperforms both centralized and federated baseline methods across several key evaluation metrics.展开更多
Multi-label text categorization refers to the problem of categorizing text througha multi-label learning algorithm. Text classification for Asian languages such as Chinese isdifferent from work for other languages suc...Multi-label text categorization refers to the problem of categorizing text througha multi-label learning algorithm. Text classification for Asian languages such as Chinese isdifferent from work for other languages such as English which use spaces to separate words.Before classifying text, it is necessary to perform a word segmentation operation to converta continuous language into a list of separate words and then convert it into a vector of acertain dimension. Generally, multi-label learning algorithms can be divided into twocategories, problem transformation methods and adapted algorithms. This work will usecustomer's comments about some hotels as a training data set, which contains labels for allaspects of the hotel evaluation, aiming to analyze and compare the performance of variousmulti-label learning algorithms on Chinese text classification. The experiment involves threebasic methods of problem transformation methods: Support Vector Machine, Random Forest,k-Nearest-Neighbor;and one adapted algorithm of Convolutional Neural Network. Theexperimental results show that the Support Vector Machine has better performance.展开更多
It is a key challenge to exploit the label coupling relationship in multi-label classification（MLC）problems.Most previous work focused on label pairwise relations,in which generally only global statistical informati...It is a key challenge to exploit the label coupling relationship in multi-label classification（MLC）problems.Most previous work focused on label pairwise relations,in which generally only global statistical information is used to analyze the coupled label relationship.In this work,firstly Bayesian and hypothesis testing methods are applied to predict the label set size of testing samples within their k nearest neighbor samples,which combines global and local statistical information,and then apriori algorithm is used to mine the label coupling relationship among multiple labels rather than pairwise labels,which can exploit the label coupling relations more accurately and comprehensively.The experimental results on text,biology and audio datasets shown that,compared with the state-of-the-art algorithm,the proposed algorithm can obtain better performance on 5 common criteria.展开更多
The world produces vast quantities of high-dimensional multi-semantic data.However,extracting valuable information from such a large amount of high-dimensional and multi-label data is undoubtedly arduous and challengi...The world produces vast quantities of high-dimensional multi-semantic data.However,extracting valuable information from such a large amount of high-dimensional and multi-label data is undoubtedly arduous and challenging.Feature selection aims to mitigate the adverse impacts of high dimensionality in multi-label data by eliminating redundant and irrelevant features.The ant colony optimization algorithm has demonstrated encouraging outcomes in multi-label feature selection,because of its simplicity,efficiency,and similarity to reinforcement learning.Nevertheless,existing methods do not consider crucial correlation information,such as dynamic redundancy and label correlation.To tackle these concerns,the paper proposes a multi-label feature selection technique based on ant colony optimization algorithm(MFACO),focusing on dynamic redundancy and label correlation.Initially,the dynamic redundancy is assessed between the selected feature subset and potential features.Meanwhile,the ant colony optimization algorithm extracts label correlation from the label set,which is then combined into the heuristic factor as label weights.Experimental results demonstrate that our proposed strategies can effectively enhance the optimal search ability of ant colony,outperforming the other algorithms involved in the paper.展开更多
<div style="text-align:justify;"> This paper studies a kind of urban security risk assessment model based on multi-label learning, which is transformed into the solution of linear equations through a s...<div style="text-align:justify;"> This paper studies a kind of urban security risk assessment model based on multi-label learning, which is transformed into the solution of linear equations through a series of transformations, and then the solution of linear equations is transformed into an optimization problem. Finally, this paper uses some classical optimization algorithms to solve these optimization problems, the convergence of the algorithm is proved, and the advantages and disadvantages of several optimization methods are compared. </div>展开更多
The quantum hybrid algorithm has recently become a very promising and speedy method for solving larger-scale optimization problems in the noisy intermediate-scale quantum(NISQ)era.The unit commitment(UC)problem is a f...The quantum hybrid algorithm has recently become a very promising and speedy method for solving larger-scale optimization problems in the noisy intermediate-scale quantum(NISQ)era.The unit commitment(UC)problem is a fundamental problem in the field of power systems that aims to satisfy the power balance constraint with minimal cost.In this paper,we focus on the implementation of the UC solution using exact quantum algorithms based on the quantum neural network(QNN).This method is tested with a ten-unit system under the power balance constraint.In order to improve computing precision and reduce network complexity,we propose a knowledge-based partially connected quantum neural network(PCQNN).The results show that exact solutions can be obtained by the improved algorithm and that the depth of the quantum circuit can be reduced simultaneously.展开更多
This paper presents a novel algorithm for an extreme form of weak label learning, in which only one of all relevant labels is given for each training sample. Using genetic algorithm, all of the labels in the training ...This paper presents a novel algorithm for an extreme form of weak label learning, in which only one of all relevant labels is given for each training sample. Using genetic algorithm, all of the labels in the training set are optimally divided into several non-overlapping groups to maximize the label distinguishability in every group. Multiple classifiers are trained separately and ensembled for label predictions. Experimental results show significant improvement over previous weak label learning algorithms.展开更多
Image fusion technology is the basis of computer vision task,but information is easily affected by noise during transmission.In this paper,an Improved Pigeon-Inspired Optimization(IPIO)is proposed,and used for multi-f...Image fusion technology is the basis of computer vision task,but information is easily affected by noise during transmission.In this paper,an Improved Pigeon-Inspired Optimization(IPIO)is proposed,and used for multi-focus noisy image fusion by combining with the boundary handling of the convolutional sparse representation.By two-scale image decomposition,the input image is decomposed into base layer and detail layer.For the base layer,IPIO algorithm is used to obtain the optimized weights for fusion,whose value range is gained by fusing the edge information.Besides,the global information entropy is used as the fitness index of the IPIO,which has high efficiency especially for discrete optimization problems.For the detail layer,the fusion of its coefficients is completed by performing boundary processing when solving the convolution sparse representation in the frequency domain.The sum of the above base and detail layers is as the final fused image.Experimental results show that the proposed algorithm has a better fusion effect compared with the recent algorithms.展开更多
Images are frequently affected because of blurring,and data loss occurred by sampling and noise occurrence.The images are getting blurred because of object movement in the scenario,atmospheric misrepresentations,and o...Images are frequently affected because of blurring,and data loss occurred by sampling and noise occurrence.The images are getting blurred because of object movement in the scenario,atmospheric misrepresentations,and optical aberrations.The main objective of image restoration is to evaluate the original image from the corrupted data.To overcome this issue,the multiobjective reptile search algorithm is proposed for performing an effective image deblurring and restoration(MORSA-IDR).The proposed MORSA is used in two different processes such as threshold and kernel parameter calculation.In that,threshold values are used for detecting and replacing the noisy pixel removal using deep residual network,and estimation of kernel is performed for deblurring the images.The main objective of the proposed MORSA-IDR is to enhance the process of deblurring for recovering low-level contextual information.The MORSA-IDR is evaluated using peak signal noise ratio(PSNR)and structural similarity index.The existing researches such as enhanced local maximum intensity(ELMI)prior and deep unrolling for blind deblurring(DUBLID)are used to evaluate the MORSA-IDR.The PSNR of MORSA-IDR for image 6 is 30.98 dB,which is high when compared with the ELMI and DUBLID.展开更多
文摘Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant challenges in privacy-sensitive and distributed settings,often neglecting label dependencies and suffering from low computational efficiency.To address these issues,we introduce a novel framework,Fed-MFSDHBCPSO—federated MFS via dual-layer hybrid breeding cooperative particle swarm optimization algorithm with manifold and sparsity regularization(DHBCPSO-MSR).Leveraging the federated learning paradigm,Fed-MFSDHBCPSO allows clients to perform local feature selection(FS)using DHBCPSO-MSR.Locally selected feature subsets are encrypted with differential privacy(DP)and transmitted to a central server,where they are securely aggregated and refined through secure multi-party computation(SMPC)until global convergence is achieved.Within each client,DHBCPSO-MSR employs a dual-layer FS strategy.The inner layer constructs sample and label similarity graphs,generates Laplacian matrices to capture the manifold structure between samples and labels,and applies L2,1-norm regularization to sparsify the feature subset,yielding an optimized feature weight matrix.The outer layer uses a hybrid breeding cooperative particle swarm optimization algorithm to further refine the feature weight matrix and identify the optimal feature subset.The updated weight matrix is then fed back to the inner layer for further optimization.Comprehensive experiments on multiple real-world multi-label datasets demonstrate that Fed-MFSDHBCPSO consistently outperforms both centralized and federated baseline methods across several key evaluation metrics.
基金supported by the NSFC (Grant Nos. 61772281,61703212, 61602254)Jiangsu Province Natural Science Foundation [grant numberBK2160968]the Priority Academic Program Development of Jiangsu Higher Edu-cationInstitutions (PAPD) and Jiangsu Collaborative Innovation Center on AtmosphericEnvironment and Equipment Technology (CICAEET).
文摘Multi-label text categorization refers to the problem of categorizing text througha multi-label learning algorithm. Text classification for Asian languages such as Chinese isdifferent from work for other languages such as English which use spaces to separate words.Before classifying text, it is necessary to perform a word segmentation operation to converta continuous language into a list of separate words and then convert it into a vector of acertain dimension. Generally, multi-label learning algorithms can be divided into twocategories, problem transformation methods and adapted algorithms. This work will usecustomer's comments about some hotels as a training data set, which contains labels for allaspects of the hotel evaluation, aiming to analyze and compare the performance of variousmulti-label learning algorithms on Chinese text classification. The experiment involves threebasic methods of problem transformation methods: Support Vector Machine, Random Forest,k-Nearest-Neighbor;and one adapted algorithm of Convolutional Neural Network. Theexperimental results show that the Support Vector Machine has better performance.
基金Supported by Australian Research Council Discovery(DP130102691)the National Science Foundation of China(61302157)+1 种基金China National 863 Project(2012AA12A308)China Pre-research Project of Nuclear Industry(FZ1402-08)
文摘It is a key challenge to exploit the label coupling relationship in multi-label classification（MLC）problems.Most previous work focused on label pairwise relations,in which generally only global statistical information is used to analyze the coupled label relationship.In this work,firstly Bayesian and hypothesis testing methods are applied to predict the label set size of testing samples within their k nearest neighbor samples,which combines global and local statistical information,and then apriori algorithm is used to mine the label coupling relationship among multiple labels rather than pairwise labels,which can exploit the label coupling relations more accurately and comprehensively.The experimental results on text,biology and audio datasets shown that,compared with the state-of-the-art algorithm,the proposed algorithm can obtain better performance on 5 common criteria.
基金supported by National Natural Science Foundation of China(Grant Nos.62376089,62302153,62302154,62202147)the key Research and Development Program of Hubei Province,China(Grant No.2023BEB024).
文摘The world produces vast quantities of high-dimensional multi-semantic data.However,extracting valuable information from such a large amount of high-dimensional and multi-label data is undoubtedly arduous and challenging.Feature selection aims to mitigate the adverse impacts of high dimensionality in multi-label data by eliminating redundant and irrelevant features.The ant colony optimization algorithm has demonstrated encouraging outcomes in multi-label feature selection,because of its simplicity,efficiency,and similarity to reinforcement learning.Nevertheless,existing methods do not consider crucial correlation information,such as dynamic redundancy and label correlation.To tackle these concerns,the paper proposes a multi-label feature selection technique based on ant colony optimization algorithm(MFACO),focusing on dynamic redundancy and label correlation.Initially,the dynamic redundancy is assessed between the selected feature subset and potential features.Meanwhile,the ant colony optimization algorithm extracts label correlation from the label set,which is then combined into the heuristic factor as label weights.Experimental results demonstrate that our proposed strategies can effectively enhance the optimal search ability of ant colony,outperforming the other algorithms involved in the paper.
文摘<div style="text-align:justify;"> This paper studies a kind of urban security risk assessment model based on multi-label learning, which is transformed into the solution of linear equations through a series of transformations, and then the solution of linear equations is transformed into an optimization problem. Finally, this paper uses some classical optimization algorithms to solve these optimization problems, the convergence of the algorithm is proved, and the advantages and disadvantages of several optimization methods are compared. </div>
基金supported in part by the China Postdoctoral Science Foundation(Grant No.2023M740874)。
文摘The quantum hybrid algorithm has recently become a very promising and speedy method for solving larger-scale optimization problems in the noisy intermediate-scale quantum(NISQ)era.The unit commitment(UC)problem is a fundamental problem in the field of power systems that aims to satisfy the power balance constraint with minimal cost.In this paper,we focus on the implementation of the UC solution using exact quantum algorithms based on the quantum neural network(QNN).This method is tested with a ten-unit system under the power balance constraint.In order to improve computing precision and reduce network complexity,we propose a knowledge-based partially connected quantum neural network(PCQNN).The results show that exact solutions can be obtained by the improved algorithm and that the depth of the quantum circuit can be reduced simultaneously.
基金Supported by the National Natural Science Foundation of China(61672433)the Fundamental Research Fund for Shenzhen Science and Technology Innovation Committee(201703063000511,201703063000517)+1 种基金the National Cryptography Development Fund(MMJJ20170210)the Science and Technology Project of State Grid Corporation of China(522722180007)
文摘This paper presents a novel algorithm for an extreme form of weak label learning, in which only one of all relevant labels is given for each training sample. Using genetic algorithm, all of the labels in the training set are optimally divided into several non-overlapping groups to maximize the label distinguishability in every group. Multiple classifiers are trained separately and ensembled for label predictions. Experimental results show significant improvement over previous weak label learning algorithms.
基金supported in part by National Key Research and Development Program of China(2018YFB0804202,2018YFB0804203)Regional Joint Fund of NSFC(U19A2057)+1 种基金National Natural Science Foundation of China(61876070)Jilin Province Science and Technology Development Plan Project(20190303134SF).
文摘Image fusion technology is the basis of computer vision task,but information is easily affected by noise during transmission.In this paper,an Improved Pigeon-Inspired Optimization(IPIO)is proposed,and used for multi-focus noisy image fusion by combining with the boundary handling of the convolutional sparse representation.By two-scale image decomposition,the input image is decomposed into base layer and detail layer.For the base layer,IPIO algorithm is used to obtain the optimized weights for fusion,whose value range is gained by fusing the edge information.Besides,the global information entropy is used as the fitness index of the IPIO,which has high efficiency especially for discrete optimization problems.For the detail layer,the fusion of its coefficients is completed by performing boundary processing when solving the convolution sparse representation in the frequency domain.The sum of the above base and detail layers is as the final fused image.Experimental results show that the proposed algorithm has a better fusion effect compared with the recent algorithms.
文摘Images are frequently affected because of blurring,and data loss occurred by sampling and noise occurrence.The images are getting blurred because of object movement in the scenario,atmospheric misrepresentations,and optical aberrations.The main objective of image restoration is to evaluate the original image from the corrupted data.To overcome this issue,the multiobjective reptile search algorithm is proposed for performing an effective image deblurring and restoration(MORSA-IDR).The proposed MORSA is used in two different processes such as threshold and kernel parameter calculation.In that,threshold values are used for detecting and replacing the noisy pixel removal using deep residual network,and estimation of kernel is performed for deblurring the images.The main objective of the proposed MORSA-IDR is to enhance the process of deblurring for recovering low-level contextual information.The MORSA-IDR is evaluated using peak signal noise ratio(PSNR)and structural similarity index.The existing researches such as enhanced local maximum intensity(ELMI)prior and deep unrolling for blind deblurring(DUBLID)are used to evaluate the MORSA-IDR.The PSNR of MORSA-IDR for image 6 is 30.98 dB,which is high when compared with the ELMI and DUBLID.
