Deep Learning Neural Network for Unconventional Images Classification

Improving predictions of rock tunnel squeezing with ensemble Q-learning and online Markov chain

Predicting rock tunnel squeezing in underground projects is challenging due to its intricate and unpredictable nature. This study proposes an innovative approach to enhance the accuracy and reliability of tunnel squeezing prediction. The proposed method combines ensemble learning techniques with Q-learning and online Markov chain integration. A deep learning model is trained on a comprehensive database comprising tunnel parameters including diameter (D), burial depth (H), support stiffness (K), and tunneling quality index (Q). Multiple deep learning models are trained concurrently, leveraging ensemble learning to capture diverse patterns and improve prediction performance. Integration of the Q-learning-Online Markov Chain further refines predictions. The online Markov chain analyzes historical sequences of tunnel parameters and squeezing class transitions, establishing transition probabilities between different squeezing classes. The Q-learning algorithm optimizes decision-making by learning the optimal policy for transitioning between tunnel states. The proposed model is evaluated using a dataset from various tunnel construction projects, assessing performance through metrics like accuracy, precision, recall, and F1-score. Results demonstrate the efficiency of the ensemble deep learning model combined with Q-learning-Online Markov Chain in predicting surrounding rock tunnel squeezing. This approach offers insights into parameter interrelationships and dynamic squeezing characteristics, enabling proactive planning and support measures implementation to mitigate tunnel squeezing hazards and ensure underground structure safety. Experimental results show the model achieves a prediction accuracy of 98.11%, surpassing individual CNN and RNN models, with an AUC value of 0.98.

Adult content image recognition by Boltzmann machine limited and deep learning

Adult content images have a detrimental effect on Internet users, a significant number of whom are minors. Therefore, it is essential to control and detecting adult content images using multimedia processing and computer vision techniques. Previous studies have typically focused on manual-engineered visual features that may be difficult to detect and analyze. This paper presents a new model that employs deep convolutional neural networks within a Gaussian-Bernoulli limited-time, for adult content image recognition of a wide variety in a precise and effective manner. There are various layers within Convolutional Neural Networks for feature extraction and classification. Gaussian-Bernoulli limited-time was used for feature extraction to describe the images, and these features were summarized using the Boltzmann machine limited in the feature summary phase. The benefit of such an approach is convenience in carrying out feature extraction. Additionally, when tested on the most modern criterion dataset, this finding is believed to be more precise compared to other state-of-the-art approaches. The results obtained prove that the proposed approach leads to a higher efficiency.

A step edge detector based on bilinear transformation

Nowadays, Canny edge detector is considered to be one of the best edge detection approaches for the images with step form. Various overgeneralized versions of these edge detectors have been offered up to now, e.g. Saryazdi edge detector. This paper proposes a new discrete version of edge detection which is obtained from Shen-Castan and Saryazdi filters by using bilinear transformation. Different experimentations are conducted to decide the suitable parameters of the proposed edge detector and to examine its validity. To evaluate the strength of the proposed model, the results are compared to Canny, Sobel, Prewitt, LOG and Saryazdi methods. Finally, by calculation of mean square error (MSE) and peak signal-to-noise ratio (PSNR), the value of PSNR is always equal to or greater than the PSNR value of suggested methods. Moreover, by calculation of Baddeley’s error metric (BEM) on ten test images from the Berkeley Segmentation DataSet (BSDS), we show that the proposed method outperforms the other methods. Therefore, visual and quantitative comparison shows the efficiency and strength of proposed method.

A classification model based on svm and fuzzy rough set for network intrusion detection

Intrusion Detection Systems (IDS) are designed to provide security into computer networks. Different classification models such as Support Vector Machine (SVM) has been successfully applied on the network data. Meanwhile, the extension or improvement of the current models using prototype selection simultaneous with their training phase is crucial due to the serious inefficacies during training (i.e. learning overhead). This paper introduces an improved model for prototype selection. Applying proposed prototype selection along with SVM classification model increases attack discovery rate. In this article, we use fuzzy rough sets theory (FRST) for prototype selection to enhance SVM in intrusion detection. Testing and evaluation of the proposed IDS have been mainly performed on NSL-KDD dataset as a refined version of KDD-CUP99. Experimentations indicate that the proposed IDS outperforms the basic and simple IDSs and modern IDSs in terms of precision, recall, and accuracy rate.

Numerical function optimization by conditionalized PSO algorithm

A lot of research has been directed to the new optimizers that can find a suboptimal solution for any optimization problem named as heuristic black-box optimizers. They can find the suboptimal solutions of an optimization problem much faster than the mathematical programming methods (if they find them at all). Particle swarm optimization (PSO) is an example of this type. In this paper, a new modified PSO has been proposed. The proposed PSO incorporates conditional learning behavior among birds into the PSO algorithm. Indeed, the particles, little by little, learn how they should behave in some similar conditions. The proposed method is named Conditionalized Particle Swarm Optimization (CoPSO). The problem space is first divided into a set of subspaces in CoPSO. In CoPSO, any particle inside a subspace will be inclined towards its best experienced location if the particles in its subspace have low diversity; otherwise, it will be inclined towards the global best location. The particles also learn to speed-up in the non-valuable subspaces and to speed-down in the valuable subspaces. The performance of CoPSO has been compared with the state-of-the-art methods on a set of standard benchmark functions.

Cluster ensemble selection using balanced normalized mutual information

A bad partition in an ensemble will be removed by a cluster ensemble selection framework from the final ensemble. It is the main idea in cluster ensemble selection to remove these partitions (bad partitions) from the selected ensemble. But still, it is likely that one of them contains some reliable clusters. Therefore, it may be reasonable to apply the selection phase on cluster level. To do this, a cluster evaluation metric is needed. Some of these metrics have been recently introduced; each of them has its limitations. The weak points of each method have been addressed in the paper. Subsequently, a new metric for cluster assessment has been introduced. The new measure is named Balanced Normalized Mutual Information (BNMI) criterion. It balances the deficiency of the traditional NMI-based criteria. Additionally, an innovative cluster ensemble approach has been proposed. To create the consensus partition considering the elected clusters, a set of different aggregation-functions (called also consensus-functions) have been utilized: the ones which are based upon the co-association matrix (CAM), the ones which are based on hyper graph partitioning algorithms, and the ones which are based upon intermediate space. The experimental study indicates that the state-of-the-art cluster ensemble methods are outperformed by the proposed cluster ensemble approach.