期刊文献+
共找到3,978篇文章
< 1 2 199 >
每页显示 20 50 100
Random forest algorithm reveals novel sites in HA protein that shift receptor binding preference of the H9N2 avian influenza virus
1
作者 Yuncong Yin Wen Li +7 位作者 Rujian Chen Xiao Wang Yiting Chen Xinyuan Cui Xingbang Lu David M.Irwin Xuejuan Shen Yongyi Shen 《Virologica Sinica》 2025年第1期109-117,共9页
A switch from avian-typeα-2,3 to human-typeα-2,6 receptors is an essential element for the initiation of a pandemic from an avian influenza virus.Some H9N2 viruses exhibit a preference for binding to human-typeα-2,... A switch from avian-typeα-2,3 to human-typeα-2,6 receptors is an essential element for the initiation of a pandemic from an avian influenza virus.Some H9N2 viruses exhibit a preference for binding to human-typeα-2,6 receptors.This identifies their potential threat to public health.However,our understanding of the molecular basis for the switch of receptor preference is still limited.In this study,we employed the random forest algorithm to identify the potentially key amino acid sites within hemagglutinin(HA),which are associated with the receptor binding ability of H9N2 avian influenza virus(AIV).Subsequently,these sites were further verified by receptor binding assays.A total of 12 substitutions in the HA protein(N158D,N158S,A160 N,A160D,A160T,T163I,T163V,V190T,V190A,D193 N,D193G,and N231D)were predicted to prefer binding toα-2,6 receptors.Except for the V190T substitution,the other substitutions were demonstrated to display an affinity for preferential binding toα-2,6 receptors by receptor binding assays.Especially,the A160T substitution caused a significant upregulation of immune-response genes and an increased mortality rate in mice.Our findings provide novel insights into understanding the genetic basis of receptor preference of the H9N2 AIV. 展开更多
关键词 H9N2 Hemagglutinin(HA) Receptor binding preference random forest algorithm Host shift Interspecies transmission
原文传递
A real-time intelligent lithology identification method based on a dynamic felling strategy weighted random forest algorithm 被引量:6
2
作者 Tie Yan Rui Xu +2 位作者 Shi-Hui Sun Zhao-Kai Hou Jin-Yu Feng 《Petroleum Science》 SCIE EI CAS CSCD 2024年第2期1135-1148,共14页
Real-time intelligent lithology identification while drilling is vital to realizing downhole closed-loop drilling. The complex and changeable geological environment in the drilling makes lithology identification face ... Real-time intelligent lithology identification while drilling is vital to realizing downhole closed-loop drilling. The complex and changeable geological environment in the drilling makes lithology identification face many challenges. This paper studies the problems of difficult feature information extraction,low precision of thin-layer identification and limited applicability of the model in intelligent lithologic identification. The author tries to improve the comprehensive performance of the lithology identification model from three aspects: data feature extraction, class balance, and model design. A new real-time intelligent lithology identification model of dynamic felling strategy weighted random forest algorithm(DFW-RF) is proposed. According to the feature selection results, gamma ray and 2 MHz phase resistivity are the logging while drilling(LWD) parameters that significantly influence lithology identification. The comprehensive performance of the DFW-RF lithology identification model has been verified in the application of 3 wells in different areas. By comparing the prediction results of five typical lithology identification algorithms, the DFW-RF model has a higher lithology identification accuracy rate and F1 score. This model improves the identification accuracy of thin-layer lithology and is effective and feasible in different geological environments. The DFW-RF model plays a truly efficient role in the realtime intelligent identification of lithologic information in closed-loop drilling and has greater applicability, which is worthy of being widely used in logging interpretation. 展开更多
关键词 Intelligent drilling Closed-loop drilling Lithology identification random forest algorithm Feature extraction
原文传递
Winter Wheat Yield Estimation Based on Sparrow Search Algorithm Combined with Random Forest:A Case Study in Henan Province,China 被引量:1
3
作者 SHI Xiaoliang CHEN Jiajun +2 位作者 DING Hao YANG Yuanqi ZHANG Yan 《Chinese Geographical Science》 SCIE CSCD 2024年第2期342-356,共15页
Precise and timely prediction of crop yields is crucial for food security and the development of agricultural policies.However,crop yield is influenced by multiple factors within complex growth environments.Previous r... Precise and timely prediction of crop yields is crucial for food security and the development of agricultural policies.However,crop yield is influenced by multiple factors within complex growth environments.Previous research has paid relatively little attention to the interference of environmental factors and drought on the growth of winter wheat.Therefore,there is an urgent need for more effective methods to explore the inherent relationship between these factors and crop yield,making precise yield prediction increasingly important.This study was based on four type of indicators including meteorological,crop growth status,environmental,and drought index,from October 2003 to June 2019 in Henan Province as the basic data for predicting winter wheat yield.Using the sparrow search al-gorithm combined with random forest(SSA-RF)under different input indicators,accuracy of winter wheat yield estimation was calcu-lated.The estimation accuracy of SSA-RF was compared with partial least squares regression(PLSR),extreme gradient boosting(XG-Boost),and random forest(RF)models.Finally,the determined optimal yield estimation method was used to predict winter wheat yield in three typical years.Following are the findings:1)the SSA-RF demonstrates superior performance in estimating winter wheat yield compared to other algorithms.The best yield estimation method is achieved by four types indicators’composition with SSA-RF)(R^(2)=0.805,RRMSE=9.9%.2)Crops growth status and environmental indicators play significant roles in wheat yield estimation,accounting for 46%and 22%of the yield importance among all indicators,respectively.3)Selecting indicators from October to April of the follow-ing year yielded the highest accuracy in winter wheat yield estimation,with an R^(2)of 0.826 and an RMSE of 9.0%.Yield estimates can be completed two months before the winter wheat harvest in June.4)The predicted performance will be slightly affected by severe drought.Compared with severe drought year(2011)(R^(2)=0.680)and normal year(2017)(R^(2)=0.790),the SSA-RF model has higher prediction accuracy for wet year(2018)(R^(2)=0.820).This study could provide an innovative approach for remote sensing estimation of winter wheat yield.yield. 展开更多
关键词 winter wheat yield estimation sparrow search algorithm combined with random forest(SSA-RF) machine learning multi-source indicator optimal lead time Henan Province China
在线阅读 下载PDF
Enhancing rock slope stability prediction using random forest machine learning:A case study
4
作者 Afiqah Ismail Ahmad Safuan A Rashid +10 位作者 Ali Dehghanbanadaki Rafiuddin Hakim Roslan Mohd Firdaus Md Dan@Azlan Abd Wahid Rasib Radzuan Saari Mushairry Mustaffar Azman Kassim Rini Asnida Abdullah Khairul Hazman Padil Norbazlan Mohd Yusof Norisam Abd Rahaman 《China Geology》 2025年第4期691-706,共16页
The prediction of slope stability is a complex nonlinear problem.This paper proposes a new method based on the random forest(RF)algorithm to study the rocky slopes stability.Taking the Bukit Merah,Perak and Twin Peak(... The prediction of slope stability is a complex nonlinear problem.This paper proposes a new method based on the random forest(RF)algorithm to study the rocky slopes stability.Taking the Bukit Merah,Perak and Twin Peak(Kuala Lumpur)as the study area,the slope characteristics of geometrical parameters are obtained from a multidisciplinary approach(consisting of geological,geotechnical,and remote sensing analyses).18 factors,including rock strength,rock quality designation(RQD),joint spacing,continuity,openness,roughness,filling,weathering,water seepage,temperature,vegetation index,water index,and orientation,are selected to construct model input variables while the factor of safety(FOS)functions as an output.The area under the curve(AUC)value of the receiver operating characteristic(ROC)curve is obtained with precision and accuracy and used to analyse the predictive model ability.With a large training set and predicted parameters,an area under the ROC curve(the AUC)of 0.95 is achieved.A precision score of 0.88 is obtained,indicating that the model has a low false positive rate and correctly identifies a substantial number of true positives.The findings emphasise the importance of using a variety of terrain characteristics and different approaches to characterise the rock slope. 展开更多
关键词 Slope stability prediction random Forest algorithm Remote sensing in Geology Factor of Safety(FOS) Geometrical parameters Rock quality designation(RQD) Multilayer perceptron(MLP)
在线阅读 下载PDF
Impacts of random negative training datasets on machine learning-based geologic hazard susceptibility assessment
5
作者 Hao Cheng Wei Hong +3 位作者 Zhen-kai Zhang Zeng-lin Hong Zi-yao Wang Yu-xuan Dong 《China Geology》 2025年第4期676-690,共15页
This study investigated the impacts of random negative training datasets(NTDs)on the uncertainty of machine learning models for geologic hazard susceptibility assessment of the Loess Plateau,northern Shaanxi Province,... This study investigated the impacts of random negative training datasets(NTDs)on the uncertainty of machine learning models for geologic hazard susceptibility assessment of the Loess Plateau,northern Shaanxi Province,China.Based on randomly generated 40 NTDs,the study developed models for the geologic hazard susceptibility assessment using the random forest algorithm and evaluated their performances using the area under the receiver operating characteristic curve(AUC).Specifically,the means and standard deviations of the AUC values from all models were then utilized to assess the overall spatial correlation between the conditioning factors and the susceptibility assessment,as well as the uncertainty introduced by the NTDs.A risk and return methodology was thus employed to quantify and mitigate the uncertainty,with log odds ratios used to characterize the susceptibility assessment levels.The risk and return values were calculated based on the standard deviations and means of the log odds ratios of various locations.After the mean log odds ratios were converted into probability values,the final susceptibility map was plotted,which accounts for the uncertainty induced by random NTDs.The results indicate that the AUC values of the models ranged from 0.810 to 0.963,with an average of 0.852 and a standard deviation of 0.035,indicating encouraging prediction effects and certain uncertainty.The risk and return analysis reveals that low-risk and high-return areas suggest lower standard deviations and higher means across multiple model-derived assessments.Overall,this study introduces a new framework for quantifying the uncertainty of multiple training and evaluation models,aimed at improving their robustness and reliability.Additionally,by identifying low-risk and high-return areas,resource allocation for geologic hazard prevention and control can be optimized,thus ensuring that limited resources are directed toward the most effective prevention and control measures. 展开更多
关键词 LANDSLIDES Debris flows Collapses Ground fissures Geologic hazard prevention and control ENGINEERING Geologic hazard susceptibility assessment Negative training dataset Average spatial correlation random forest algorithm Risk and return analysis Geological survey engineering Loess Plateau area
在线阅读 下载PDF
Randomized scheduling algorithm for input-queued switches 被引量:1
6
作者 吴俊 罗军舟 《Journal of Southeast University(English Edition)》 EI CAS 2005年第1期6-10,共5页
The sampling problem for input-queued (IQ) randomized scheduling algorithms is analyzed.We observe that if the current scheduling decision is a maximum weighted matching (MWM),the MWM for the next slot mostly falls in... The sampling problem for input-queued (IQ) randomized scheduling algorithms is analyzed.We observe that if the current scheduling decision is a maximum weighted matching (MWM),the MWM for the next slot mostly falls in those matchings whose weight is closed to the current MWM.Using this heuristic,a novel randomized algorithm for IQ scheduling,named genetic algorithm-like scheduling algorithm (GALSA),is proposed.Evolutionary strategy is used for choosing sampling points in GALSA.GALSA works with only O(N) samples which means that GALSA has lower complexity than the famous randomized scheduling algorithm,APSARA.Simulation results show that the delay performance of GALSA is quite competitive with respect to that of APSARA. 展开更多
关键词 switches input-queued randomized algorithm
在线阅读 下载PDF
Prostate cancer prediction forest algorithm that takes using the random into account transrectal ultrasound findings, age, and serum levels of prostate-specific antigen 被引量:5
7
作者 Li-Hong Xiao Pei-Ran Chen +4 位作者 Zhong-Ping Gou Yong-Zhong Li Mei Li Liang-Cheng Xiang Ping Feng 《Asian Journal of Andrology》 SCIE CAS CSCD 2017年第5期586-590,共5页
The aim of this study is to evaluate the ability of the random forest algorithm that combines data on transrectal ultrasound findings, age, and serum levels of prostate-specific antigen to predict prostate carcinoma. ... The aim of this study is to evaluate the ability of the random forest algorithm that combines data on transrectal ultrasound findings, age, and serum levels of prostate-specific antigen to predict prostate carcinoma. Clinico-demographic data were analyzed for 941 patients with prostate diseases treated at our hospital, including age, serum prostate-specific antigen levels, transrectal ultrasound findings, and pathology diagnosis based on ultrasound-guided needle biopsy of the prostate. These data were compared between patients with and without prostate cancer using the Chi-square test, and then entered into the random forest model to predict diagnosis. Patients with and without prostate cancer differed significantly in age and serum prostate-specific antigen levels (P 〈 0.001), as well as in all transrectal ultrasound characteristics (P 〈 0.05) except uneven echo (P = 0.609). The random forest model based on age, prostate-specific antigen and ultrasound predicted prostate cancer with an accuracy of 83.10%, sensitivity of 65.64%, and specificity of 93.83%. Positive predictive value was 86.72%, and negative predictive value was 81.64%. By integrating age, prostate-specific antigen levels and transrectal ultrasound findings, the random forest algorithm shows better diagnostic performance for prostate cancer than either diagnostic indicator on its own. This algorithm may help improve diagnosis of the disease by identifying patients at high risk for biopsy. 展开更多
关键词 diagnosis prostate cancer prostate-specific antigen random forest algorithm transrectal ultrasound characteristics
原文传递
Prediction of hot-rolled strip crown based on Boruta and extremely randomized trees algorithms 被引量:4
8
作者 Li Wang Song-lin He +1 位作者 Zhi-ting Zhao Xian-du Zhang 《Journal of Iron and Steel Research International》 SCIE EI CAS CSCD 2023年第5期1022-1031,共10页
The quality of hot-rolled steel strip is directly affected by the strip crown.Traditional machine learning models have shown limitations in accurately predicting the strip crown,particularly when dealing with imbalanc... The quality of hot-rolled steel strip is directly affected by the strip crown.Traditional machine learning models have shown limitations in accurately predicting the strip crown,particularly when dealing with imbalanced data.This limitation results in poor production quality and efficiency,leading to increased production costs.Thus,a novel strip crown prediction model that uses the Boruta and extremely randomized trees(Boruta-ERT)algorithms to address this issue was proposed.To improve the accuracy of our model,we utilized the synthetic minority over-sampling technique to balance the imbalance data sets.The Boruta-ERT prediction model was then used to select features and predict the strip crown.With the 2160 mm hot rolling production lines of a steel plant serving as the research object,the experimental results showed that 97.01% of prediction data have an absolute error of less than 8 lm.This level of accuracy met the control requirements for strip crown and demonstrated significant benefits for the improvement in production quality of steel strip. 展开更多
关键词 Hot-rolled strip Data improvement Strip crown Feature selection Boruta algorithm Extremely randomized trees algorithm
原文传递
Object-based classification of hyperspectral data using Random Forest algorithm 被引量:3
9
作者 Saeid Amini Saeid Homayouni +1 位作者 Abdolreza Safari Ali A.Darvishsefat 《Geo-Spatial Information Science》 SCIE CSCD 2018年第2期127-138,共12页
This paper presents a new framework for object-based classification of high-resolution hyperspectral data.This multi-step framework is based on multi-resolution segmentation(MRS)and Random Forest classifier(RFC)algori... This paper presents a new framework for object-based classification of high-resolution hyperspectral data.This multi-step framework is based on multi-resolution segmentation(MRS)and Random Forest classifier(RFC)algorithms.The first step is to determine of weights of the input features while using the object-based approach with MRS to processing such images.Given the high number of input features,an automatic method is needed for estimation of this parameter.Moreover,we used the Variable Importance(VI),one of the outputs of the RFC,to determine the importance of each image band.Then,based on this parameter and other required parameters,the image is segmented into some homogenous regions.Finally,the RFC is carried out based on the characteristics of segments for converting them into meaningful objects.The proposed method,as well as,the conventional pixel-based RFC and Support Vector Machine(SVM)method was applied to three different hyperspectral data-sets with various spectral and spatial characteristics.These data were acquired by the HyMap,the Airborne Prism Experiment(APEX),and the Compact Airborne Spectrographic Imager(CASI)hyperspectral sensors.The experimental results show that the proposed method is more consistent for land cover mapping in various areas.The overall classification accuracy(OA),obtained by the proposed method was 95.48,86.57,and 84.29%for the HyMap,the APEX,and the CASI datasets,respectively.Moreover,this method showed better efficiency in comparison to the spectralbased classifications because the OAs of the proposed method was 5.67 and 3.75%higher than the conventional RFC and SVM classifiers,respectively. 展开更多
关键词 Object-based classification random Forest algorithm multi-resolution segmentation(MRS) hyperspectral imagery
原文传递
Randomized Algorithms for Probabilistic Optimal Robust Performance Controller Design 被引量:1
10
作者 宋春雷 谢玲 《Journal of Beijing Institute of Technology》 EI CAS 2004年第1期15-19,共5页
Polynomial-time randomized algorithms were constructed to approximately solve optimal robust performance controller design problems in probabilistic sense and the rigorous mathematical justification of the approach wa... Polynomial-time randomized algorithms were constructed to approximately solve optimal robust performance controller design problems in probabilistic sense and the rigorous mathematical justification of the approach was given. The randomized algorithms here were based on a property from statistical learning theory known as (uniform) convergence of empirical means (UCEM). It is argued that in order to assess the performance of a controller as the plant varies over a pre-specified family, it is better to use the average performance of the controller as the objective function to be optimized, rather than its worst-case performance. The approach is illustrated to be efficient through an example. 展开更多
关键词 randomized algorithms statistical learning theory uniform convergence of empirical means (UCEM) probabilistic optimal robust performance controller design
在线阅读 下载PDF
An Improved Randomized Circle Detection Algorithm Using in Printed Circuit Board Locating Mark 被引量:2
11
作者 Jingkun Liu Qi Fan 《Applied Mathematics》 2019年第10期848-861,共14页
This paper presents an improved Randomized Circle Detection (RCD) algorithm with the characteristic of circularity to detect randomized circle in images with complex background, which is not based on the Hough Transfo... This paper presents an improved Randomized Circle Detection (RCD) algorithm with the characteristic of circularity to detect randomized circle in images with complex background, which is not based on the Hough Transform. The experimental results denote that this algorithm can locate the circular mark of Printed Circuit Board (PCB). 展开更多
关键词 Circle Detection randomized algorithm Characteristic of Circularity Printed Circuit Board
在线阅读 下载PDF
Random Fuzzy Chance-constrained Programming Based on Adaptive Chaos Quantum Honey Bee Algorithm and Robustness Analysis 被引量:3
12
作者 Han Xue Xun Li Hong-Xu Ma College of Electromechanical Engineering and Automation, National University of Defense Technology, Changsha 410073, PRC 《International Journal of Automation and computing》 EI 2010年第1期115-122,共8页
This paper proposes an adaptive chaos quantum honey bee algorithm (CQHBA) for solving chance-constrained program- ming in random fuzzy environment based on random fuzzy simulations. Random fuzzy simulation is design... This paper proposes an adaptive chaos quantum honey bee algorithm (CQHBA) for solving chance-constrained program- ming in random fuzzy environment based on random fuzzy simulations. Random fuzzy simulation is designed to estimate the chance of a random fuzzy event and the optimistic value to a random fuzzy variable. In CQHBA, each bee carries a group of quantum bits representing a solution. Chaos optimization searches space around the selected best-so-far food source. In the marriage process, random interferential discrete quantum crossover is done between selected drones and the queen. Gaussian quantum mutation is used to keep the diversity of whole population. New methods of computing quantum rotation angles are designed based on grads. A proof of con- vergence for CQHBA is developed and a theoretical analysis of the computational overhead for the algorithm is presented. Numerical examples are presented to demonstrate its superiority in robustness and stability, efficiency of computational complexity, success rate, and accuracy of solution quality. CQHBA is manifested to be highly robust under various conditions and capable of handling most random fuzzy programmings with any parameter settings, variable initializations, system tolerance and confidence level, perturbations, and noises. 展开更多
关键词 Honey bee algorithm random fuzzy programming quantum computation chaos optimization ROBUSTNESS
在线阅读 下载PDF
Recommendation algorithm of cloud computing system based on random walk algorithm and collaborative filtering model 被引量:1
13
作者 Feng Zhang Hua Ma +1 位作者 Lei Peng Lanhua Zhang 《International Journal of Technology Management》 2017年第3期79-81,共3页
The traditional collaborative filtering recommendation technology has some shortcomings in the large data environment. To solve this problem, a personalized recommendation method based on cloud computing technology is... The traditional collaborative filtering recommendation technology has some shortcomings in the large data environment. To solve this problem, a personalized recommendation method based on cloud computing technology is proposed. The large data set and recommendation computation are decomposed into parallel processing on multiple computers. A parallel recommendation engine based on Hadoop open source framework is established, and the effectiveness of the system is validated by learning recommendation on an English training platform. The experimental results show that the scalability of the recommender system can be greatly improved by using cloud computing technology to handle massive data in the cluster. On the basis of the comparison of traditional recommendation algorithms, combined with the advantages of cloud computing, a personalized recommendation system based on cloud computing is proposed. 展开更多
关键词 random walk algorithm collaborative filtering model cloud computing system recommendation algorithm
在线阅读 下载PDF
Optimized quantum random-walk search algorithm for multi-solution search 被引量:1
14
作者 张宇超 鲍皖苏 +1 位作者 汪翔 付向群 《Chinese Physics B》 SCIE EI CAS CSCD 2015年第11期133-139,共7页
This study investigates the multi-solution search of the optimized quantum random-walk search algorithm on the hypercube. Through generalizing the abstract search algorithm which is a general tool for analyzing the se... This study investigates the multi-solution search of the optimized quantum random-walk search algorithm on the hypercube. Through generalizing the abstract search algorithm which is a general tool for analyzing the search on the graph to the multi-solution case, it can be applied to analyze the multi-solution case of quantum random-walk search on the graph directly. Thus, the computational complexity of the optimized quantum random-walk search algorithm for the multi-solution search is obtained. Through numerical simulations and analysis, we obtain a critical value of the proportion of solutions q. For a given q, we derive the relationship between the success rate of the algorithm and the number of iterations when q is no longer than the critical value. 展开更多
关键词 quantum search algorithm quantum random walk multi-solution abstract search algorithm
原文传递
AN ANALYSIS ABOUT BEHAVIOR OF EVOLUTIONARY ALGORITHMS:A KIND OF THEORETICAL DESCRIPTION BASED ON GLOBAL RANDOM SEARCH METHODS 被引量:1
15
作者 Ding Lixin Kang Lishan +1 位作者 Chen Yupin Zhou Shaoquan 《Wuhan University Journal of Natural Sciences》 CAS 1998年第1期31-31,共1页
Evolutionary computation is a kind of adaptive non--numerical computation method which is designed tosimulate evolution of nature. In this paper, evolutionary algorithm behavior is described in terms of theconstructio... Evolutionary computation is a kind of adaptive non--numerical computation method which is designed tosimulate evolution of nature. In this paper, evolutionary algorithm behavior is described in terms of theconstruction and evolution of the sampling distributions over the space of candidate solutions. Iterativeconstruction of the sampling distributions is based on the idea of the global random search of generationalmethods. Under this frame, propontional selection is characterized as a gobal search operator, and recombination is characerized as the search process that exploits similarities. It is shown-that by properly constraining the search breadth of recombination operators, weak convergence of evolutionary algorithms to aglobal optimum can be ensured. 展开更多
关键词 global random search evolutionary algorithms weak convergence genetic algorithms
在线阅读 下载PDF
Decoherence in optimized quantum random-walk search algorithm 被引量:1
16
作者 张宇超 鲍皖苏 +1 位作者 汪翔 付向群 《Chinese Physics B》 SCIE EI CAS CSCD 2015年第8期197-202,共6页
This paper investigates the effects of decoherence generated by broken-link-type noise in the hypercube on an optimized quantum random-walk search algorithm. When the hypercube occurs with random broken links, the opt... This paper investigates the effects of decoherence generated by broken-link-type noise in the hypercube on an optimized quantum random-walk search algorithm. When the hypercube occurs with random broken links, the optimized quantum random-walk search algorithm with decoherence is depicted through defining the shift operator which includes the possibility of broken links. For a given database size, we obtain the maximum success rate of the algorithm and the required number of iterations through numerical simulations and analysis when the algorithm is in the presence of decoherence. Then the computational complexity of the algorithm with decoherence is obtained. The results show that the ultimate effect of broken-link-type decoherence on the optimized quantum random-walk search algorithm is negative. 展开更多
关键词 quantum search algorithm quantum random walk DECOHERENCE
原文传递
Investigation of Nuclear Binding Energy and Charge Radius Based on Random Forest Algorithm
17
作者 CAI Boshuai YU Tianjun +3 位作者 LIN Xuan ZHANG Jilong WANG Zhixuan YUAN Cenxi 《原子能科学技术》 EI CAS CSCD 北大核心 2023年第4期704-712,共9页
The random forest algorithm was applied to study the nuclear binding energy and charge radius.The regularized root-mean-square of error(RMSE)was proposed to avoid overfitting during the training of random forest.RMSE ... The random forest algorithm was applied to study the nuclear binding energy and charge radius.The regularized root-mean-square of error(RMSE)was proposed to avoid overfitting during the training of random forest.RMSE for nuclides with Z,N>7 is reduced to 0.816 MeV and 0.0200 fm compared with the six-term liquid drop model and a three-term nuclear charge radius formula,respectively.Specific interest is in the possible(sub)shells among the superheavy region,which is important for searching for new elements and the island of stability.The significance of shell features estimated by the so-called shapely additive explanation method suggests(Z,N)=(92,142)and(98,156)as possible subshells indicated by the binding energy.Because the present observed data is far from the N=184 shell,which is suggested by mean-field investigations,its shell effect is not predicted based on present training.The significance analysis of the nuclear charge radius suggests Z=92 and N=136 as possible subshells.The effect is verified by the shell-corrected nuclear charge radius model. 展开更多
关键词 nuclear binding energy nuclear charge radius random forest algorithm
在线阅读 下载PDF
Randomized Kaczmarz algorithm for CT reconstruction 被引量:1
18
作者 赵可 潘晋孝 孔慧华 《Journal of Measurement Science and Instrumentation》 CAS 2013年第1期34-37,共4页
The order of the projection in the algebraic reconstruction technique(ART)method has great influence on the rate of the convergence.Although many scholars have studied the order of the projection,few theoretical proof... The order of the projection in the algebraic reconstruction technique(ART)method has great influence on the rate of the convergence.Although many scholars have studied the order of the projection,few theoretical proofs are given.Thomas Strohmer and Roman Vershynin introduced a randomized version of the Kaczmarz method for consistent,and over-determined linear systems and proved whose rate does not depend on the number of equations in the systems in 2009.In this paper,we apply this method to computed tomography(CT)image reconstruction and compared images generated by the sequential Kaczmarz method and the randomized Kaczmarz method.Experiments demonstrates the feasibility of the randomized Kaczmarz algorithm in CT image reconstruction and its exponential curve convergence. 展开更多
关键词 Kaczmarz method iterative algorithm randomized Kaczmarz method computed tomography(CT) CT image reconstruction exponent curve fitting
在线阅读 下载PDF
Random forest algorithm and regional applications of spectral inversion model for estimating canopy nitrogen concentration in rice 被引量:1
19
作者 LI Xuqing LIU Xiangnan LIU Meiling WU Ling 《遥感学报》 CSCD 北大核心 2014年第4期923-945,共23页
原文传递
A Regularized Randomized Kaczmarz Algorithm for Large Discrete Ill-Posed Problems
20
作者 LIU Fengming WANG Zhengsheng +1 位作者 YANG Siyu XU Guili 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI CSCD 2020年第5期787-795,共9页
Tikhonov regularization is a powerful tool for solving linear discrete ill-posed problems.However,effective methods for dealing with large-scale ill-posed problems are still lacking.The Kaczmarz method is an effective... Tikhonov regularization is a powerful tool for solving linear discrete ill-posed problems.However,effective methods for dealing with large-scale ill-posed problems are still lacking.The Kaczmarz method is an effective iterative projection algorithm for solving large linear equations due to its simplicity.We propose a regularized randomized extended Kaczmarz(RREK)algorithm for solving large discrete ill-posed problems via combining the Tikhonov regularization and the randomized Kaczmarz method.The convergence of the algorithm is proved.Numerical experiments illustrate that the proposed algorithm has higher accuracy and better image restoration quality compared with the existing randomized extended Kaczmarz(REK)method. 展开更多
关键词 ill-posed problem Tikhonov regularization randomized extended Kaczmarz(REK)algorithm image restoration
在线阅读 下载PDF
上一页 1 2 199 下一页 到第
使用帮助 返回顶部