期刊文献+
共找到2,612篇文章
< 1 2 131 >
每页显示 20 50 100
DCS-SOCP-SVM:A Novel Integrated Sampling and Classification Algorithm for Imbalanced Datasets
1
作者 Xuewen Mu Bingcong Zhao 《Computers, Materials & Continua》 2025年第5期2143-2159,共17页
When dealing with imbalanced datasets,the traditional support vectormachine(SVM)tends to produce a classification hyperplane that is biased towards the majority class,which exhibits poor robustness.This paper proposes... When dealing with imbalanced datasets,the traditional support vectormachine(SVM)tends to produce a classification hyperplane that is biased towards the majority class,which exhibits poor robustness.This paper proposes a high-performance classification algorithm specifically designed for imbalanced datasets.The proposed method first uses a biased second-order cone programming support vectormachine(B-SOCP-SVM)to identify the support vectors(SVs)and non-support vectors(NSVs)in the imbalanced data.Then,it applies the synthetic minority over-sampling technique(SV-SMOTE)to oversample the support vectors of the minority class and uses the random under-sampling technique(NSV-RUS)multiple times to undersample the non-support vectors of the majority class.Combining the above-obtained minority class data set withmultiple majority class datasets can obtainmultiple new balanced data sets.Finally,SOCP-SVM is used to classify each data set,and the final result is obtained through the integrated algorithm.Experimental results demonstrate that the proposed method performs excellently on imbalanced datasets. 展开更多
关键词 DCS-SOCP-SVM imbalanced datasets sampling method ensemble method integrated algorithm
在线阅读 下载PDF
Scaling up the DBSCAN Algorithm for Clustering Large Spatial Databases Based on Sampling Technique 被引量:9
2
作者 Guan Ji hong 1, Zhou Shui geng 2, Bian Fu ling 3, He Yan xiang 1 1. School of Computer, Wuhan University, Wuhan 430072, China 2.State Key Laboratory of Software Engineering, Wuhan University, Wuhan 430072, China 3.College of Remote Sensin 《Wuhan University Journal of Natural Sciences》 CAS 2001年第Z1期467-473,共7页
Clustering, in data mining, is a useful technique for discovering interesting data distributions and patterns in the underlying data, and has many application fields, such as statistical data analysis, pattern recogni... Clustering, in data mining, is a useful technique for discovering interesting data distributions and patterns in the underlying data, and has many application fields, such as statistical data analysis, pattern recognition, image processing, and etc. We combine sampling technique with DBSCAN algorithm to cluster large spatial databases, and two sampling based DBSCAN (SDBSCAN) algorithms are developed. One algorithm introduces sampling technique inside DBSCAN, and the other uses sampling procedure outside DBSCAN. Experimental results demonstrate that our algorithms are effective and efficient in clustering large scale spatial databases. 展开更多
关键词 spatial databases data mining CLUSTERING sampling DBSCAN algorithm
在线阅读 下载PDF
Iterative Learning Fault Diagnosis Algorithm for Non-uniform Sampling Hybrid System 被引量:2
3
作者 Hongfeng Tao Dapeng Chen Huizhong Yang 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2017年第3期534-542,共9页
For a class of non-uniform output sampling hybrid system with actuator faults and bounded disturbances,an iterative learning fault diagnosis algorithm is proposed.Firstly,in order to measure the impact of fault on sys... For a class of non-uniform output sampling hybrid system with actuator faults and bounded disturbances,an iterative learning fault diagnosis algorithm is proposed.Firstly,in order to measure the impact of fault on system between every consecutive output sampling instants,the actual fault function is transformed to obtain an equivalent fault model by using the integral mean value theorem,then the non-uniform sampling hybrid system is converted to continuous systems with timevarying delay based on the output delay method.Afterwards,an observer-based fault diagnosis filter with virtual fault is designed to estimate the equivalent fault,and the iterative learning regulation algorithm is chosen to update the virtual fault repeatedly to make it approximate the actual equivalent fault after some iterative learning trials,so the algorithm can detect and estimate the system faults adaptively.Simulation results of an electro-mechanical control system model with different types of faults illustrate the feasibility and effectiveness of this algorithm. 展开更多
关键词 Equivalent fault model fault diagnosis iterative learning algorithm non-uniform sampling hybrid system virtual fault
在线阅读 下载PDF
Optimization of Process Parameters for Cracking Prevention of UHSS in Hot Stamping Based on Hammersley Sequence Sampling and Back Propagation Neural Network-Genetic Algorithm Mixed Methods 被引量:1
4
作者 menghan wang zongmin yue lie meng 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2016年第2期31-39,共9页
In order to prevent cracking appeared in the work-piece during the hot stamping operation,this paper proposes a hybrid optimization method based on Hammersley sequence sampling( HSS),finite analysis,backpropagation( B... In order to prevent cracking appeared in the work-piece during the hot stamping operation,this paper proposes a hybrid optimization method based on Hammersley sequence sampling( HSS),finite analysis,backpropagation( BP) neural network and genetic algorithm( GA). The mechanical properties of high strength boron steel are characterized on the basis of uniaxial tensile test at elevated temperatures. The samples of process parameters are chosen via the HSS that encourages the exploration throughout the design space and hence achieves better discovery of possible global optimum in the solution space. Meanwhile, numerical simulation is carried out to predict the forming quality for the optimized design. A BP neural network model is developed to obtain the mathematical relationship between optimization goal and design variables,and genetic algorithm is used to optimize the process parameters. Finally,the results of numerical simulation are compared with those of production experiment to demonstrate that the optimization strategy proposed in the paper is feasible. 展开更多
关键词 HOT STAMPING CRACKING Hammersley SEQUENCE sampling BACK-PROPAGATION GENETIC algorithm
在线阅读 下载PDF
Application of a relief-optimized method for target space exteriorization sampling in landslide susceptibility assessment
5
作者 CUI Yulong DENG Qining MIAO Haibo 《Journal of Mountain Science》 2025年第9期3391-3407,共17页
Selection of negative samples significantly influences landslide susceptibility assessment,especially when establishing the relationship between landslides and environmental factors in regions with complex geological ... Selection of negative samples significantly influences landslide susceptibility assessment,especially when establishing the relationship between landslides and environmental factors in regions with complex geological conditions.Traditional sampling strategies commonly used in landslide susceptibility models can lead to a misrepresentation of the distribution of negative samples,causing a deviation from actual geological conditions.This,in turn,negatively affects the discriminative ability and generalization performance of the models.To address this issue,we propose a novel approach for selecting negative samples to enhance the quality of machine learning models.We choose the Liangshan Yi Autonomous Prefecture,located in southwestern Sichuan,China,as the case study.This area,characterized by complex terrain,frequent tectonic activities,and steep slope erosion,experiences recurrent landslides,making it an ideal setting for validating our proposed method.We calculate the contribution values of environmental factors using the relief algorithm to construct the feature space,apply the Target Space Exteriorization Sampling(TSES)method to select negative samples,calculate landslide probability values by Random Forest(RF)modeling,and then create regional landslide susceptibility maps.We evaluate the performance of the RF model optimized by the Environmental Factor Selection-based TSES(EFSTSES)method using standard performance metrics.The results indicated that the model achieved an accuracy(ACC)of 0.962,precision(PRE)of 0.961,and an area under the curve(AUC)of 0.962.These findings demonstrate that the EFSTSES-based model effectively mitigates the negative sample imbalance issue,enhances the differentiation between landslide and non-landslide samples,and reduces misclassification,particularly in geologically complex areas.These improvements offer valuable insights for disaster prevention,land use planning,and risk mitigation strategies. 展开更多
关键词 Non-landslide sample selection Relief algorithm Target Space Exteriorization sampling Landslide Susceptibility Assessment
原文传递
Augmented line sampling and combination algorithm for imprecise time-variant reliability analysis
6
作者 Xiukai YUAN Weiming ZHENG +1 位作者 Yunfei SHU Yiwei DONG 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2024年第12期258-274,共17页
Assessment of imprecise time-variant reliability in engineering is a critical task when accounting for both the variability of structural properties and loads over time and the presence of uncertainties involved in th... Assessment of imprecise time-variant reliability in engineering is a critical task when accounting for both the variability of structural properties and loads over time and the presence of uncertainties involved in the ambiguity of parameters simultaneously.To estimate the Imprecise Time-variant Failure Probability Function(ITFPF)and derive the imprecise reliability results as a byproduct,Adaptive Combination Augmented Line Sampling(ACALS)is proposed.It consists of three integrated features:Augmented Line Sampling(ALS),adaptive strategy,and the optimal combination.ALS is adopted as an efficient analysis tool to obtain the failure probability function w.r.t.imprecise parameters.Then,the adaptive strategy iteratively applies ALS while considering both imprecise parameters and time simultaneously.Finally,the optimal combination algorithm collects all result components in an optimal manner to minimize the Coefficient of Variance(C.o.V.)of the ITFPF estimate.Overall,the proposed ACALS method outperforms the original ALS method by efficiently estimating the ITFPF while guaranteeing a minimal C.o.V.Thus,the proposed approach can serve as an effective tool for imprecise time-variant reliability analysis in real engineering applications.Several examples are presented to demonstrate the superiority of the proposed approach in addressing the challenges of estimating the ITFPF. 展开更多
关键词 Time-variant reliability Imprecise reliability Line sampling Adaptive strategy Combination algorithm
原文传递
Potential-Decomposition Strategy in Markov Chain Monte Carlo Sampling Algorithms
7
作者 上官丹骅 包景东 《Communications in Theoretical Physics》 SCIE CAS CSCD 2010年第11期854-856,共3页
We introduce the potential-decomposition strategy (PDS), which can be used in Markov chain Monte Carlo sampling algorithms. PDS can be designed to make particles move in a modified potential that favors diffusion in... We introduce the potential-decomposition strategy (PDS), which can be used in Markov chain Monte Carlo sampling algorithms. PDS can be designed to make particles move in a modified potential that favors diffusion in phase space, then, by rejecting some trial samples, the target distributions can be sampled in an unbiased manner. Furthermore, if the accepted trial samples are insumcient, they can be recycled as initial states to form more unbiased samples. This strategy can greatly improve efficiency when the original potential has multiple metastable states separated by large barriers. We apply PDS to the 2d Ising model and a double-well potential model with a large barrier, demonstrating in these two representative examples that convergence is accelerated by orders of magnitude. 展开更多
关键词 potential-decomposition strategy Markov chain Monte Carlo sampling algorithms
在线阅读 下载PDF
Algorithm-based arterial blood sampling recognition increasing safety in point-of-care diagnostics
8
作者 Jorg Peter Wilfried Klingert +5 位作者 Kathrin Klingert Karolin Thiel Daniel Wulff Alfred Konigsrainer Wolfgang Rosenstiel Martin Schenk 《World Journal of Critical Care Medicine》 2017年第3期172-178,共7页
AIM To detect blood withdrawal for patients with arterial blood pressure monitoring to increase patient safety and provide better sample dating.METHODS Blood pressure information obtained from a patient monitor was fe... AIM To detect blood withdrawal for patients with arterial blood pressure monitoring to increase patient safety and provide better sample dating.METHODS Blood pressure information obtained from a patient monitor was fed as a real-time data stream to an experimental medical framework. This framework was connected to an analytical application which observes changes in systolic, diastolic and mean pressure to determine anomalies in the continuous data stream. Detection was based on an increased mean blood pressure caused by the closing of the withdrawal three-way tap and an absence of systolic and diastolic measurements during this manipulation. For evaluation of the proposed algorithm, measured data from animal studies in healthy pigs were used.RESULTS Using this novel approach for processing real-time measurement data of arterial pressure monitoring, the exact time of blood withdrawal could be successfully detected retrospectively and in real-time. The algorithm was able to detect 422 of 434(97%) blood withdrawals for blood gas analysis in the retrospective analysis of 7 study trials. Additionally, 64 sampling events for other procedures like laboratory and activated clotting time analyses were detected. The proposed algorithm achieved a sensitivity of 0.97, a precision of 0.96 and an F1 score of 0.97.CONCLUSION Arterial blood pressure monitoring data can be used toperform an accurate identification of individual blood samplings in order to reduce sample mix-ups and thereby increase patient safety. 展开更多
关键词 Blood withdrawal detection sample dating algorithm Arterial blood gas analysis Patient monitoring Point-of-care diagnostics
暂未订购
Data-driven evolutionary sampling optimization for expensive problems 被引量:4
9
作者 ZHEN Huixiang GONG Wenyin WANG Ling 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2021年第2期318-330,共13页
Surrogate models have shown to be effective in assisting evolutionary algorithms(EAs)for solving computationally expensive complex optimization problems.However,the effectiveness of the existing surrogate-assisted evo... Surrogate models have shown to be effective in assisting evolutionary algorithms(EAs)for solving computationally expensive complex optimization problems.However,the effectiveness of the existing surrogate-assisted evolutionary algorithms still needs to be improved.A data-driven evolutionary sampling optimization(DESO)framework is proposed,where at each generation it randomly employs one of two evolutionary sampling strategies,surrogate screening and surrogate local search based on historical data,to effectively balance global and local search.In DESO,the radial basis function(RBF)is used as the surrogate model in the sampling strategy,and different degrees of the evolutionary process are used to sample candidate points.The sampled points by sampling strategies are evaluated,and then added into the database for the updating surrogate model and population in the next sampling.To get the insight of DESO,extensive experiments and analysis of DESO have been performed.The proposed algorithm presents superior computational efficiency and robustness compared with five state-of-the-art algorithms on benchmark problems from 20 to 200 dimensions.Besides,DESO is applied to an airfoil design problem to show its effectiveness. 展开更多
关键词 evolutionary algorithm(EA) surrogate model datadriven evolutionary sampling airfoil design
在线阅读 下载PDF
The study and application of PTR algorithm on recognizing various structure samples 被引量:1
10
作者 王碧泉 黄汉明 范洪顺 《Acta Seismologica Sinica(English Edition)》 CSCD 1994年第1期1-13,共13页
In this paper,four pattern recognition methods are set forth.Based on plane projection of samples and analysis of typical samples along with the few pattern recognition methods,the PTR algorithm for recognizing variou... In this paper,four pattern recognition methods are set forth.Based on plane projection of samples and analysis of typical samples along with the few pattern recognition methods,the PTR algorithm for recognizing various structure samples is proposed.Also two examples are given and these show the PTR algorithm is effective. 展开更多
关键词 patttern recognition PTR algorithm earthquake prediction typical sample plane projection
在线阅读 下载PDF
Optimization of Well Position and Sampling Frequency for Groundwater Monitoring and Inverse Identification of Contamination Source Conditions Using Bayes’Theorem 被引量:2
11
作者 Shuangsheng Zhang Hanhu Liu +3 位作者 Jing Qiang Hongze Gao Diego Galar Jing Lin 《Computer Modeling in Engineering & Sciences》 SCIE EI 2019年第5期373-394,共22页
Coupling Bayes’Theorem with a two-dimensional(2D)groundwater solute advection-diffusion transport equation allows an inverse model to be established to identify a set of contamination source parameters including sour... Coupling Bayes’Theorem with a two-dimensional(2D)groundwater solute advection-diffusion transport equation allows an inverse model to be established to identify a set of contamination source parameters including source intensity(M),release location(0 X,0 Y)and release time(0 T),based on monitoring well data.To address the issues of insufficient monitoring wells or weak correlation between monitoring data and model parameters,a monitoring well design optimization approach was developed based on the Bayesian formula and information entropy.To demonstrate how the model works,an exemplar problem with an instantaneous release of a contaminant in a confined groundwater aquifer was employed.The information entropy of the model parameters posterior distribution was used as a criterion to evaluate the monitoring data quantity index.The optimal monitoring well position and monitoring frequency were solved by the two-step Monte Carlo method and differential evolution algorithm given a known well monitoring locations and monitoring events.Based on the optimized monitoring well position and sampling frequency,the contamination source was identified by an improved Metropolis algorithm using the Latin hypercube sampling approach.The case study results show that the following parameters were obtained:1)the optimal monitoring well position(D)is at(445,200);and 2)the optimal monitoring frequency(Δt)is 7,providing that the monitoring events is set as 5 times.Employing the optimized monitoring well position and frequency,the mean errors of inverse modeling results in source parameters(M,X0,Y0,T0)were 9.20%,0.25%,0.0061%,and 0.33%,respectively.The optimized monitoring well position and sampling frequency canIt was also learnt that the improved Metropolis-Hastings algorithm(a Markov chain Monte Carlo method)can make the inverse modeling result independent of the initial sampling points and achieves an overall optimization,which significantly improved the accuracy and numerical stability of the inverse modeling results. 展开更多
关键词 Contamination source identification monitoring well optimization Bayes’Theorem information entropy differential evolution algorithm Metropolis Hastings algorithm Latin hypercube sampling
在线阅读 下载PDF
Yarn Quality Prediction for Small Samples Based on AdaBoost Algorithm 被引量:1
12
作者 刘智玉 陈南梁 汪军 《Journal of Donghua University(English Edition)》 CAS 2023年第3期261-266,共6页
In order to solve the problems of weak prediction stability and generalization ability of a neural network algorithm model in the yarn quality prediction research for small samples,a prediction model based on an AdaBo... In order to solve the problems of weak prediction stability and generalization ability of a neural network algorithm model in the yarn quality prediction research for small samples,a prediction model based on an AdaBoost algorithm(AdaBoost model) was established.A prediction model based on a linear regression algorithm(LR model) and a prediction model based on a multi-layer perceptron neural network algorithm(MLP model) were established for comparison.The prediction experiments of the yarn evenness and the yarn strength were implemented.Determination coefficients and prediction errors were used to evaluate the prediction accuracy of these models,and the K-fold cross validation was used to evaluate the generalization ability of these models.In the prediction experiments,the determination coefficient of the yarn evenness prediction result of the AdaBoost model is 76% and 87% higher than that of the LR model and the MLP model,respectively.The determination coefficient of the yarn strength prediction result of the AdaBoost model is slightly higher than that of the other two models.Considering that the yarn evenness dataset has a weaker linear relationship with the cotton dataset than that of the yarn strength dataset in this paper,the AdaBoost model has the best adaptability for the nonlinear dataset among the three models.In addition,the AdaBoost model shows generally better results in the cross-validation experiments and the series of prediction experiments at eight different training set sample sizes.It is proved that the AdaBoost model not only has good prediction accuracy but also has good prediction stability and generalization ability for small samples. 展开更多
关键词 stability and generalization ability for small samples.Key words:yarn quality prediction AdaBoost algorithm small sample generalization ability
在线阅读 下载PDF
Quantitative algorithm for airborne gamma spectrum of large sample based on improved shuffled frog leaping-particle swarm optimization convolutional neural network 被引量:1
13
作者 Fei Li Xiao-Fei Huang +5 位作者 Yue-Lu Chen Bing-Hai Li Tang Wang Feng Cheng Guo-Qiang Zeng Mu-Hao Zhang 《Nuclear Science and Techniques》 SCIE EI CAS CSCD 2023年第7期242-252,共11页
In airborne gamma ray spectrum processing,different analysis methods,technical requirements,analysis models,and calculation methods need to be established.To meet the engineering practice requirements of airborne gamm... In airborne gamma ray spectrum processing,different analysis methods,technical requirements,analysis models,and calculation methods need to be established.To meet the engineering practice requirements of airborne gamma-ray measurements and improve computational efficiency,an improved shuffled frog leaping algorithm-particle swarm optimization convolutional neural network(SFLA-PSO CNN)for large-sample quantitative analysis of airborne gamma-ray spectra is proposed herein.This method was used to train the weight of the neural network,optimize the structure of the network,delete redundant connections,and enable the neural network to acquire the capability of quantitative spectrum processing.In full-spectrum data processing,this method can perform the functions of energy spectrum peak searching and peak area calculations.After network training,the mean SNR and RMSE of the spectral lines were 31.27 and 2.75,respectively,satisfying the demand for noise reduction.To test the processing ability of the algorithm in large samples of airborne gamma spectra,this study considered the measured data from the Saihangaobi survey area as an example to conduct data spectral analysis.The results show that calculation of the single-peak area takes only 0.13~0.15 ms,and the average relative errors of the peak area in the U,Th,and K spectra are 3.11,9.50,and 6.18%,indicating the high processing efficiency and accuracy of this algorithm.The performance of the model can be further improved by optimizing related parameters,but it can already meet the requirements of practical engineering measurement.This study provides a new idea for the full-spectrum processing of airborne gamma rays. 展开更多
关键词 Large sample Airborne gamma spectrum(AGS) Shuffled frog leaping algorithm(SFLA) Particle swarm optimization(PSO) Convolutional neural network(CNN)
在线阅读 下载PDF
MULTIPLE FREQUENCIES ESTIMATION OF SIGNAL WITH SUB-SAMPLING 被引量:1
14
作者 Tang Bin(Southwestern Petroleum Institute, Nanchong 637001)Xiao Xianci(University of Electronic and Science Technology of China, Chengdu 610054) 《Journal of Electronics(China)》 1998年第3期233-239,共7页
Based on time delay technology and MUSIC algorithm, a novel estimating multiple frequencies approach of signal with sampling rate which is least Nyquist sampling rate is presented in this paper. With choosing delay ti... Based on time delay technology and MUSIC algorithm, a novel estimating multiple frequencies approach of signal with sampling rate which is least Nyquist sampling rate is presented in this paper. With choosing delay time properly, the estimated frequencies are unambiguous. Computer simulation confirms its availability. 展开更多
关键词 Sub-sample FREQUENCY TIME DELAY MUSIC algorithm
在线阅读 下载PDF
基于“BPNN+NSGA-II”模型的简支梁优化算法研究
15
作者 柏华军 潘昊阳 +1 位作者 肖祥 秦寰宇 《铁道标准设计》 北大核心 2026年第1期63-70,共8页
针对传统有限元法进行结构优化存在效率低的问题,通过对比不同代理模型和仿生优化算法特点,构建结构优化数学模型,研究BPNN神经网络和NSGA-II算法的架构原理及训练流程,并对比验证NSGA-II算法高效性和基于拉丁超立方设计(LHS)的采样方... 针对传统有限元法进行结构优化存在效率低的问题,通过对比不同代理模型和仿生优化算法特点,构建结构优化数学模型,研究BPNN神经网络和NSGA-II算法的架构原理及训练流程,并对比验证NSGA-II算法高效性和基于拉丁超立方设计(LHS)的采样方法优势,提出基于“BPNN+NSGA-II”模型的结构高效优化算法。其优化原理是基于有限元法构建的样本集对BPNN模型进行训练形成代理模型,使用NSGA-II算法对BPNN代理模型进行优化求解,形成“BPNN+NSGA-II”模型的高效优化算法。以某简支梁结构为例进行优化试验,结果表明:BPNN代理模型预测值与有限元模型计算值相比误差在2%以内,代理模型可靠性高;同时代理模型显著减少NSGA-II算法对有限元模型调用次数,提高优化效率。经优化的简支梁方案,承载能力安全系数接近规范限值,设计方案为近似最优方案。 展开更多
关键词 代理模型 优化算法 BPNN模型 NSGA-II算法 简支梁 拉丁超立方设计 蒙特卡罗采样
在线阅读 下载PDF
RRT^(*)-GSQ:A hybrid sampling path planning algorithm for complex orchard scenarios
16
作者 ZHU Qingzhen ZHAO Jiamuyang +1 位作者 DAI Xu YU Yang 《农业工程学报》 2026年第3期13-25,共13页
Traditional sampling-based path planning algorithms,such as the rapidly-exploring random tree star(RRT^(*)),encounter critical limitations in unstructured orchard environments,including low sampling efficiency in narr... Traditional sampling-based path planning algorithms,such as the rapidly-exploring random tree star(RRT^(*)),encounter critical limitations in unstructured orchard environments,including low sampling efficiency in narrow passages,slow convergence,and high computational costs.To address these challenges,this paper proposes a novel hybrid global path planning algorithm integrating Gaussian sampling and quadtree optimization(RRT^(*)-GSQ).This methodology aims to enhance path planning by synergistically combining a Gaussian mixture sampling strategy to improve node generation in critical regions,an adaptive step-size and direction optimization mechanism for enhanced obstacle avoidance,a Quadtree-AABB collision detection framework to lower computational complexity,and a dynamic iteration control strategy for more efficient convergence.In obstacle-free and obstructed scenarios,compared with the conventional RRT^(*),the proposed algorithm reduced the number of node evaluations by 67.57%and 62.72%,and decreased the search time by 79.72%and 78.52%,respectively.In path tracking tests,the proposed algorithm achieved substantial reductions in RMSE of the final path compared to the conventional RRT^(*).Specifically,the lateral RMSE was reduced by 41.5%in obstacle-free environments and 59.3%in obstructed environments,while the longitudinal RMSE was reduced by 57.2%and 58.5%,respectively.Furthermore,the maximum absolute errors in both lateral and longitudinal directions were constrained within 0.75 m.Field validation experiments in an operational orchard confirmed the algorithm's practical effectiveness,showing reductions in the mean tracking error of 47.6%(obstacle-free)and 58.3%(with obstructed),alongside a 5.1%and 7.2%shortening of the path length compared to the baseline method.The proposed algorithm effectively enhances path planning efficiency and navigation accuracy for robots,presenting a superior solution for high-precision autonomous navigation of agricultural robots in orchard environments and holding significant value for engineering applications. 展开更多
关键词 robot path planning orchard improved RRT^(*)algorithm Gaussian sampling autonomous navigation
在线阅读 下载PDF
基于K-means聚类算法的印刷返单追样色彩补偿计算研究
17
作者 付文亭 邓体俊 《包装工程》 北大核心 2026年第3期161-167,共7页
目的引入K-means聚类算法量化评估印张与客户样网点面积率差异,运用非线性拟合算法确定C/M/Y/K四色通道优化调整参数,实现印刷返单色彩精准补偿还原。方法调用扫描仪与机台印刷ICC配置文件,将扫描的RGB文件转换为与印前分色标准一致的C... 目的引入K-means聚类算法量化评估印张与客户样网点面积率差异,运用非线性拟合算法确定C/M/Y/K四色通道优化调整参数,实现印刷返单色彩精准补偿还原。方法调用扫描仪与机台印刷ICC配置文件,将扫描的RGB文件转换为与印前分色标准一致的CMYK文件;引入K-means聚类算法模型,对印张与客户样的C/M/Y/K分色文件进行高精度比对;用非线性拟合算法确定四色通道优化调整节点及参数;在Photoshop中对C/M/Y/K 4个颜色通道进行“曲线”调整。结果动态补偿机制有效校正印张偏蓝、偏深缺陷,同步优化四原色、二次叠印色和三色叠印灰平衡色,补偿修正后印张色差ΔE00稳定控制在2.5以内。结论该数据驱动补偿方法效率远超传统人工调整,具有完全可复制的标准化特性,为印刷生产数字化升级提供关键技术支撑。 展开更多
关键词 K-MEANS聚类算法 印刷返单追样 色彩补偿 色彩管理
在线阅读 下载PDF
基于社交扩散和自适应负采样的推荐算法
18
作者 蔡晓东 李婷 苏一峰 《华南理工大学学报(自然科学版)》 北大核心 2026年第2期52-61,共10页
基于图神经网络的社交推荐算法利用社交网络提升推荐系统的性能。但是现有算法大多直接将原始社交图整合到推荐系统中,忽略了社交网络中存在的非同质性社交连接,从而为推荐系统引入噪声信息。此外,现有负采样策略选择固定难度的负样本,... 基于图神经网络的社交推荐算法利用社交网络提升推荐系统的性能。但是现有算法大多直接将原始社交图整合到推荐系统中,忽略了社交网络中存在的非同质性社交连接,从而为推荐系统引入噪声信息。此外,现有负采样策略选择固定难度的负样本,容易产生假负样本,导致模型对用户偏好的区分度不足。为解决上述问题,该文提出了一种基于社交扩散和自适应负采样的推荐算法。首先,对社交网络执行前向扩散和用户兴趣引导去噪操作,生成用户的同质性社交表示;然后利用多视图表征对齐方法,以最大化用户表示在去噪社交图、原始社交图和用户-项目交互图间的互信息,进而优化用户表示质量;最后,根据正样本预测评分选择自适应难度的负样本,实现正负样本相似度边界的动态校准,以提升模型的整体性能。实验结果表明,该算法较当前先进推荐算法效果显著,在数据集Douban上的召回率和归一化折扣累积增益分别提升了11.99%和10.54%,在数据集Epinions上分别提升了15.62%和11.14%,在数据集Yelp上分别提升了13.80%和14.90%,验证了其能有效缓解噪声干扰,区分正负样本之间的细微差别。 展开更多
关键词 推荐算法 社交网络 图神经网络 扩散模型 对比学习 负采样
在线阅读 下载PDF
结合倒置残差模块和可微分RANSAC算法的点云配准模型
19
作者 李维乾 葛文豪 陈金广 《计算机与现代化》 2026年第2期1-10,共10页
针对复杂和存在遮挡的点云数据整体和局部特征融合程度低,以及传统鲁棒估计算法无法集成到深度学习训练流程的问题,本文提出一种基于改进PointNet++和随机采样一致算法的点云配准网络模型。首先,使用融合倒置残差模块的PointNet++网络... 针对复杂和存在遮挡的点云数据整体和局部特征融合程度低,以及传统鲁棒估计算法无法集成到深度学习训练流程的问题,本文提出一种基于改进PointNet++和随机采样一致算法的点云配准网络模型。首先,使用融合倒置残差模块的PointNet++网络提取局部点云特征,生成融合全局和局部特征信息的特征描述符;其次,使用局部特征Transformer模块生成暂定的点对应和置信度分数;随后,引入神经采样器以保证RANSAC采样过程的可微分性,并使用可微分的几何求解器计算出点云对之间的刚性变换矩阵;最后,设计可训练质量函数以在每次迭代中优化评估指标,将鲁棒估计算法集成到训练流程中,最终完成点云配准。在3个公开的大规模点云数据集3DMatch、ETH和KITTI上的多次对比实验结果表明,本文方法在3DMatch上的特征匹配召回率达到98.4%,较SpinNet网络提高了0.8百分点;在ETH和KITTI上的特征匹配召回率和正确率分别达到98.5%和99.57%,较SpinNet网络分别提高了5.7百分点和0.5个百分点。在处理多个密度不均匀、存在遮挡的复杂点云数据集时,本文方法的表现优于现有先进方法,能有效提高配准精度。 展开更多
关键词 点云配准 鲁棒估计 特征描述符 PointNet++ 倒置残差 随机采样一致算法
在线阅读 下载PDF
基于无监督文本特征的隐含主题自动抽取方法
20
作者 包永红 《现代电子技术》 北大核心 2026年第4期42-46,共5页
文本数据中蕴含着丰富的信息,但这些信息往往以隐含的方式存在,不易被直接观察或理解。目前传统的监督学习方法需要大量的人工标注数据来训练模型,易受标注者的主观性影响,为解决该问题,提出一种基于无监督文本特征的隐含主题自动抽取... 文本数据中蕴含着丰富的信息,但这些信息往往以隐含的方式存在,不易被直接观察或理解。目前传统的监督学习方法需要大量的人工标注数据来训练模型,易受标注者的主观性影响,为解决该问题,提出一种基于无监督文本特征的隐含主题自动抽取方法。利用双向最大匹配法对文本进行分词后,去除其中的停用词,完成文本预处理工作;采用无监督TF-IDF算法提取预处理后文本的特征,再将文本数据转换为数值型特征向量,构建词特征向量集;引入LDA模型自动抽取隐含主题,即构建词特征向量中词汇对应隐含主题的概率分布模型,并利用Gibbs快速抽样法获取模型超参数,得到隐含主题概率分布,进而依据该分布结果实现文本隐含主题的自动抽取。实验结果表明,所提方法在应用过程中的F1值高于0.93,困惑度低于0.6,能够精准地抽取文本中的隐含主题。 展开更多
关键词 隐含主题 自动抽取 文本特征 无监督TF-IDF算法 LDA模型 Gibbs快速抽样法
在线阅读 下载PDF
上一页 1 2 131 下一页 到第
使用帮助 返回顶部