Patents
Literature
Patsnap Eureka AI that helps you search prior art, draft patents, and assess FTO risks, powered by patent and scientific literature data.

10 results about "Selection operator" patented technology

Image classification method based on collaborative optimization algorithms and feature selection mechanism

PCT designated stageWO2025232076A1Internal combustion piston enginesCharacter and pattern recognitionAlgorithmGenetic programming algorithm
Disclosed in the present invention is an image classification method based on collaborative optimization algorithms and a feature selection mechanism, which effectively improves the image feature extraction quality and the image classification accuracy. The technical solution comprises: step S1, preprocessing a collected image; step S2, constructing an image feature extraction model on the basis of a genetic programming algorithm, performing image feature extraction, using the concept of individual information optimization to assign position and velocity information to each individual in the algorithm, and updating the position and velocity information of each individual to adjust a selection operator; step S3, constructing a feature selection model to perform selection on the extracted features; step S4, by using the selected features as inputs, training an SVM classifier; and step S5, using the trained SVM classifier to classify express delivery images.
Owner:YTO EXPRESS CO LTD

A method, system, and device for selecting a problem-solving layer of a multimodal data model

The present invention belongs to the field of big data, and specifically relates to a method, a system, and a device for selecting a problem-solving layer of a multi-modal data model. This method is used to optimize the problem-solving layer in the partitioned order product space. It includes a preselection stage and an optimization stage. The specific steps are as follows: S1: Represent the problem-solving layer as chromosome individuals to generate a quasi-initial population. S2: Define a fitness function. S3: Iteratively update the quasi-initial population and save the optimal individual in each round of iterative update. S4: Improve the selection operator, crossover operator, and mutation operator in the classical genetic algorithm to obtain a new adaptive genetic algorithm. S5: Combine the randomly generated chromosomes and the sub-optimal population as the initial population in the optimization stage. S6: Iteratively update the initial population and select the optimal problem-solving layer after the iteration ends. The present invention solves the problems such as difficult convergence and easy entrapment in local optima when the existing classical genetic algorithm is used to handle this problem.
Owner:ANHUI UNIV

Method for establishing opc model, electronic device, storage medium and program product

PendingCN122345950AAlgorithmSelection operator
The present disclosure provides a method, an electronic device, a storage medium and a program product for establishing an OPC model. The method comprises: iteratively determining, based on a least absolute shrinkage and selection operator (LASSO) linear regression algorithm, an intermediate model threshold value and a corresponding physical effect coefficient value of the OPC model in each iteration; in response to the iteration satisfying a predetermined condition, determining a final model threshold value based on at least a comparison of a last model threshold value corresponding to a last iteration among the determined intermediate model threshold values and a predetermined threshold value; and establishing the OPC model based on the final model threshold value and the physical effect coefficient value corresponding to the final model threshold value.
Owner:QUANXIN INTELLIGENT MFG TECH CO LTD

Parallel collaborative privacy computing method under non-uniform edge network computing power condition

The invention relates to the technical field of homomorphic encryption and distributed computing, and discloses a parallel collaborative privacy computing method under the condition of non-uniform computing power of an edge network, which is applied to a star network topology structure consisting of a main node and K edge nodes, and aims to solve the problems of minimum absolute shrinkage and operator selection. And solving and constructing a minimum absolute shrinkage and selection operator problem based on an alternating direction multiplier method by adopting the alternating direction multiplier method, segmenting the compression matrix to obtain a plurality of sub-problems, solving each sub-problem by utilizing edge nodes, and obtaining a minimum absolute shrinkage and selection operator problem based on the minimum absolute shrinkage and selection operator problem. The solution process is as follows: a main node generates encryption and decryption parameters, Euler function values corresponding to the encryption and decryption parameters, encrypted plaintext parameters and quantized plaintext parameters and shares the parameters to an edge node, homomorphic iterative calculation is performed, and three times of communication with the main node is performed, so that parallel collaborative privacy calculation is realized; according to the method, the calculation overhead is reduced while the encryption and decryption precision is not influenced, and meanwhile, the overall calculation speed is increased.
Owner:TIBET UNIV

Deep optical neural network training method and system based on hybrid mutation strategy genetic algorithm

The application discloses a deep optical neural network training method and system based on a hybrid mutation strategy genetic algorithm, and the method comprises the following steps: S1, sequentially stacking a linear operation layer based on MZIs, a nonlinear activation layer based on EOA and a Dropmask based on a mask to build an N-layer deep DONN; S2, preprocessing a data set with different characteristic categories to conform to the data input size of the DONN; S3, uniformly initializing the DONN population, combining the MSE and the Accuracy between the real value and the predicted value as the fitness evaluation function of the individual; S4, taking the exponential ranking selection ERS and the uniform crossover UC as the selection operator and the crossover operator in the training process, adopting a hybrid mutation strategy, and distributing three operators, namely, the single-point mutation SM, the uniform mutation UM and the Gaussian mutation GM, to different individuals for mutation according to a dynamic game probability; and S5, adopting a double-elite reservation strategy, reserving two individuals with the optimal MSE and Accuracy performance to the next generation, and through iterative evolution, until a termination condition is met, and a DONN individual with the globally optimal network parameter is obtained.
Owner:HANGZHOU DIANZI UNIV

Drilling accident prediction method, device and equipment based on network optimization and medium

The application discloses a drilling accident prediction method and device based on network optimization, equipment and medium, through multiple populations, each population evolves along different directions, the evolution in the population and the existing work remain consistent, the exchange between the populations is introduced, and the solving efficiency is improved. The application proposes a drilling accident prediction method based on BP neural network, relying on the BP neural network, the intelligent level of accident early warning is significantly enhanced; a multi-population based method is proposed to search for the optimal parameters of the BP neural network, the global search ability is enhanced, and the accuracy of the early warning is improved; the selection operator, the exchange operator and the crossover operator of the multi-population are proposed, the shortcomings of the existing genetic algorithm are improved, and the method can be widely applied to the technical field of data processing.
Owner:GUANGZHOU MARINE GEOLOGICAL SURVEY

Distributed stochastic nonsmooth optimization method based on smoothing and momentum techniques

PendingUS20250252151A1Machine learningNeural architecturesTheoretical computer scienceComposite optimization
A distributed stochastic nonsmooth optimization method based on smoothing and momentum techniques is provided. The distributed stochastic nonsmooth optimization method solves nonsmooth composite optimization problems with constraints and stochastic factors in a distributed manner and achieves a higher convergence rate, lower computational complexity, and lower storage overhead. The method includes: using a distributed algorithm based on smoothing and momentum techniques to process all the agents in a loop, and providing initial states, step sizes, recommended ranges of smoothing parameters, and so on of the algorithm; and specifying performance metrics of the algorithm, and depicting clustering comparison results according to the metrics. The method is applicable to composite optimization problems with nonsmooth terms, including but not limited to clustering problems, least absolute shrinkage and selection operator (LASSO) regression in machine learning and compressed sensing problems in sensor networks, and is applicable to large-scale distributed nonsmooth optimization scenarios with high-dimensional complex constraints.
Owner:BEIJING INST OF TECH

Estimation method for joint causal effects of multiple exposures based on high-dimensional independent variables

Disclosed is an estimation method for joint causal effects of multiple exposures based on high-dimensional independent variables, including the following steps: reducing a dimension by using a modified adaptive least absolute shrinkage and selection operator (LASSO); calculating balance weights by using a nonparametric multiple treatments covariate balancing generalized propensity score (npmtCBGPS) method, and determining an optimal value of a tuning parameter by taking a minimum multiple treatment dual-weighted coefficient (mtDWC) as a criterion; and estimating joint causal effects of multiple continuous exposure factors on an outcome variable by using an inverse probability weighting (IPW) method. According to the present invention, in a framework of a GOAL method, a multiple treatments GOAL (mtGOAL) method by combining the npmtCBGPS method with the adaptive LASSO, and a method capable of estimating joint causal effects of multiple continuous exposure factors on an outcome variable in the presence of high-dimensional covariates are proposed.
Owner:SHANXI MEDICAL UNIV

Firefighter physical fatigue identification method based on LASSO multi-feature weighting and long and short term memory model

PendingCN121421536ABiological modelsPsychotechnic devicesTime domainSelection operator
The invention provides a fireman physical fatigue identification method based on LASSO multi-feature weighting and a long and short term memory model, and belongs to the technical field of physiological signal processing and fatigue detection. The method comprises the steps that electrocardiosignals of firemen are collected for time domain analysis, frequency domain analysis and nonlinear analysis, and physical fatigue influence variables of the firemen are obtained; performing Wilcoxon symbol rank test and pairing t test on the physical fatigue influence variables of the firefighter to screen out preliminary input features; selecting key features based on the preliminary input features through a minimum absolute shrinkage and selection operator; and inputting the key features into a long-short-term memory model to output a fireman physical fatigue identification result. Sensitive HRV indexes are screened out by using a statistical test method, redundant and irrelevant features are effectively removed by combining an LASSO feature selection method, and a most representative key feature set is reserved. The data dimension is reduced, the calculation efficiency of the model is improved, and the over-fitting risk caused by feature redundancy is also avoided.
Owner:NORTHEASTERN UNIV CHINA

Integrated agent assisted genetic programming image classification method

The invention relates to the technical field of artificial intelligence, and provides an integrated agent-assisted genetic programming image classification method, which comprises the following steps: S1, inputting an image training set; s2, randomly generating a genetic programming population according to a program structure, a function set and a terminator set defined in the base method; s3, in the new generation, evaluating each individual by using a real fitness function; s4, extracting features from the evaluated individuals according to tree features, father nodes and class labels, constructing a proxy training set and training a proxy model; and S5, in each cycle of the evolutionary learning process, through elite operator, selection operator, crossover operator and mutation operator operations, selecting individuals with good fitness (i.e., high classification accuracy) to generate a new generation of offspring. According to the method, a basic agent model is constructed by using different types of features, and a dynamic weighting strategy is developed to allocate different weights for the agents, so that compatibility of all genetic programming-based image classification methods is realized, and the evolutionary learning process of the methods is remarkably accelerated.
Owner:SHANDONG UNIV OF FINANCE & ECONOMICS