scholarly journals Optimal planning of flood defence system reinforcements using a greedy search algorithm

2021 ◽  
Vol 207 ◽  
pp. 107344
Author(s):  
Wouter Jan Klerk ◽  
Wim Kanning ◽  
Matthijs Kok ◽  
Rogier Wolfert
2021 ◽  
Vol 3 (4) ◽  
pp. 922-945
Author(s):  
Shaw-Hwa Lo ◽  
Yiqiao Yin

Text classification is a fundamental language task in Natural Language Processing. A variety of sequential models are capable of making good predictions, yet there is a lack of connection between language semantics and prediction results. This paper proposes a novel influence score (I-score), a greedy search algorithm, called Backward Dropping Algorithm (BDA), and a novel feature engineering technique called the “dagger technique”. First, the paper proposes to use the novel influence score (I-score) to detect and search for the important language semantics in text documents that are useful for making good predictions in text classification tasks. Next, a greedy search algorithm, called the Backward Dropping Algorithm, is proposed to handle long-term dependencies in the dataset. Moreover, the paper proposes a novel engineering technique called the “dagger technique” that fully preserves the relationship between the explanatory variable and the response variable. The proposed techniques can be further generalized into any feed-forward Artificial Neural Networks (ANNs) and Convolutional Neural Networks (CNNs), and any neural network. A real-world application on the Internet Movie Database (IMDB) is used and the proposed methods are applied to improve prediction performance with an 81% error reduction compared to other popular peers if I-score and “dagger technique” are not implemented.


Author(s):  
Shahab Wahhab Kareem ◽  
Mehmet Cudi Okur

Bayesian networks are useful analytical models for designing the structure of knowledge in machine learning which can represent probabilistic dependency relationships among the variables. The authors present the Elephant Swarm Water Search Algorithm (ESWSA) for Bayesian network structure learning. In the algorithm; Deleting, Reversing, Inserting, and Moving are used to make the ESWSA for reaching the optimal structure solution. Mainly, water search strategy of elephants during drought periods is used in the ESWSA algorithm. The proposed method is compared with Pigeon Inspired Optimization, Simulated Annealing, Greedy Search, Hybrid Bee with Simulated Annealing, and Hybrid Bee with Greedy Search using BDeu score function as a metric for all algorithms. They investigated the confusion matrix performances of these techniques utilizing various benchmark data sets. As presented by the results of evaluations, the proposed algorithm achieves better performance than the other algorithms and produces better scores as well as the better values.


Following upon the severe flooding from an exceptional tide cum surge in February 1953 a removable flood barrier in Long Reach was considered as the basis of a flood defence system compatible with the navigation interests yet avoiding the high cost of bank raising in the metropolis. Three designs of barrier were developed and costed, each embodying two 150 m wide navigation openings. The preferred system incorporated drop gates supported on high towers above shipping when not in use. The navigation authorities ruled that an unobstructed opening at 425 m was necessary and a new design exercise found in favour of retractable barrier structures but at increased cost with less reliability in performance. The formation of the Greater London Council led to a wider investigation of possible barrier sites and the lesser use by shipping of reaches above the Royal Docks permitted narrower openings. Schemes for some six different sites and over 40 variations in span arrangement were investigated and led to a proposal for four 60 m navigation openings in Woolwich Reach which might be closed by a form of rising section gate. This has proved to be the cheapest, most reliable and quickest to install of all the schemes investigated and is now the basis of design for contract.


2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Chengdong Yang ◽  
Wenyin Zhang ◽  
Jilin Zou ◽  
Shunbo Hu ◽  
Jianlong Qiu

Uncertainty measure is an important implement for characterizing the degree of uncertainty. It has been extensively applied in pattern recognition and data clustering. Because of instability of traditional uncertainty measures, mean-variance measure (MVM) is utilized to perform feature selection, which could depress disturbances and noises effectively. Thereby, a novel evaluation function based on MVM is designed. The forward greedy search algorithm (FGSA) with the proposed evaluation function is exploited to perform feature selection. Experiment analysis shows the validity and effectiveness of MVM.


2014 ◽  
Vol 6 (1) ◽  
pp. 1 ◽  
Author(s):  
Debayan Das ◽  
Ayan Chatterjee ◽  
Nabamita Pal ◽  
Amitava Mukherjee ◽  
Mrinal Kanti Naskar

Sign in / Sign up

Export Citation Format

Share Document