Advancements in Natural Language Processing and Deep Learning techniques have significantly pro-pelled the automation of Legal Judgment Prediction,achieving remarkable progress in legal research.Most of the existing r...Advancements in Natural Language Processing and Deep Learning techniques have significantly pro-pelled the automation of Legal Judgment Prediction,achieving remarkable progress in legal research.Most of the existing research works on Legal Judgment Prediction(LJP)use traditional optimization algorithms in deep learning techniques falling into local optimization.This research article focuses on using the modified Pelican Optimization method which mimics the collective behavior of Pelicans in the exploration and exploitation phase during cooperative food searching.Typically,the selection of search agents within a boundary is done randomly,which increases the time required to achieve global optimization.To address this,the proposed Chaotic Opposition Learning-based Pelican Optimization(COLPO)method incorporates the concept of Opposition-Based Learning combined with a chaotic cubic function,enabling deterministic selection of random numbers and reducing the number of iterations needed to reach global optimization.Also,the LJP approach in this work uses improved semantic similarity and entropy features to train a hybrid classifier combining Bi-GRU and Deep Maxout.The output scores are fused using improved score level fusion to boost prediction accuracy.The proposed COLPO method experiments with real-time Madras High Court criminal cases(Dataset 1)and the Supreme Court of India database(Dataset 2),and its performance is compared with nature-inspired algorithms such as Sparrow Search Algorithm(SSA),COOT,Spider Monkey Optimization(SMO),Pelican Optimization Algorithm(POA),as well as baseline classifier models and transformer neural networks.The results show that the proposed hybrid classifier with COLPO outperforms other cutting-edge LJP algorithms achieving 93.4%and 94.24%accuracy,respectively.展开更多
Rock bursts represent a formidable challenge in underground engineering,posing substantial risks to both infrastructure and human safety.These sudden and violent failures of rock masses are characterized by the rapid ...Rock bursts represent a formidable challenge in underground engineering,posing substantial risks to both infrastructure and human safety.These sudden and violent failures of rock masses are characterized by the rapid release of accumulated stress within the rock,leading to severe seismic events and structural damage.Therefore,the development of reliable prediction models for rock bursts is paramount to mitigating these hazards.This study aims to propose a tree-based model—a Light Gradient Boosting Machine(LightGBM)—to predict the intensity of rock bursts in underground engineering.322 actual rock burst cases are collected to constitute an exhaustive rock burst dataset,which serves to train the LightGBMmodel.Two population-basedmetaheuristic algorithms are used to optimize the hyperparameters of the LightGBM model.Finally,the sensitivity analysis is used to identify the predominant factors that may incur the occurrence of rock bursts.The results show that the population-based metaheuristic algorithms have a good ability to search out the optimal hyperparameters of the LightGBM model.The developed LightGBM model yields promising performance in predicting the intensity of rock bursts,with which accuracy on training and testing sets are 0.972 and 0.944,respectively.The sensitivity analysis discloses that the risk of occurring rock burst is significantly sensitive to three factors:uniaxial compressive strength(σc),stress concentration factor(SCF),and elastic strain energy index(Wet).Moreover,this study clarifies the particular impact of these three factors on the intensity of rock bursts through the partial dependence plot.展开更多
文摘Advancements in Natural Language Processing and Deep Learning techniques have significantly pro-pelled the automation of Legal Judgment Prediction,achieving remarkable progress in legal research.Most of the existing research works on Legal Judgment Prediction(LJP)use traditional optimization algorithms in deep learning techniques falling into local optimization.This research article focuses on using the modified Pelican Optimization method which mimics the collective behavior of Pelicans in the exploration and exploitation phase during cooperative food searching.Typically,the selection of search agents within a boundary is done randomly,which increases the time required to achieve global optimization.To address this,the proposed Chaotic Opposition Learning-based Pelican Optimization(COLPO)method incorporates the concept of Opposition-Based Learning combined with a chaotic cubic function,enabling deterministic selection of random numbers and reducing the number of iterations needed to reach global optimization.Also,the LJP approach in this work uses improved semantic similarity and entropy features to train a hybrid classifier combining Bi-GRU and Deep Maxout.The output scores are fused using improved score level fusion to boost prediction accuracy.The proposed COLPO method experiments with real-time Madras High Court criminal cases(Dataset 1)and the Supreme Court of India database(Dataset 2),and its performance is compared with nature-inspired algorithms such as Sparrow Search Algorithm(SSA),COOT,Spider Monkey Optimization(SMO),Pelican Optimization Algorithm(POA),as well as baseline classifier models and transformer neural networks.The results show that the proposed hybrid classifier with COLPO outperforms other cutting-edge LJP algorithms achieving 93.4%and 94.24%accuracy,respectively.
文摘Rock bursts represent a formidable challenge in underground engineering,posing substantial risks to both infrastructure and human safety.These sudden and violent failures of rock masses are characterized by the rapid release of accumulated stress within the rock,leading to severe seismic events and structural damage.Therefore,the development of reliable prediction models for rock bursts is paramount to mitigating these hazards.This study aims to propose a tree-based model—a Light Gradient Boosting Machine(LightGBM)—to predict the intensity of rock bursts in underground engineering.322 actual rock burst cases are collected to constitute an exhaustive rock burst dataset,which serves to train the LightGBMmodel.Two population-basedmetaheuristic algorithms are used to optimize the hyperparameters of the LightGBM model.Finally,the sensitivity analysis is used to identify the predominant factors that may incur the occurrence of rock bursts.The results show that the population-based metaheuristic algorithms have a good ability to search out the optimal hyperparameters of the LightGBM model.The developed LightGBM model yields promising performance in predicting the intensity of rock bursts,with which accuracy on training and testing sets are 0.972 and 0.944,respectively.The sensitivity analysis discloses that the risk of occurring rock burst is significantly sensitive to three factors:uniaxial compressive strength(σc),stress concentration factor(SCF),and elastic strain energy index(Wet).Moreover,this study clarifies the particular impact of these three factors on the intensity of rock bursts through the partial dependence plot.
