Search

In this paper, the quantum technology is exploited to empower the OPTICS unsupervised learning algorithm, which is a density-based clustering algorithm with numerous applications in the real world. We design an algorithm called Quantum Ordering Points To Identify the Clustering Structure (QOPTICS) and demonstrate that its computational complexity outperforms that of its classical counterpart. On the other hand, we propose a Deep self-learning approach for modeling the improvement of two Swarm Intelligence Algorithms, namely Artificial Orca Algorithm (AOA) and Elephant Herding Optimization (EHO) in order to improve their effectiveness. The deep self-learning approach is based on two well-known dynamic mutation operators, namely Cauchy mutation operator and Gaussian mutation operator. And in order to improve the efficiency of these algorithms, they are hybridized with QOPTICS and executed on just one cluster it yields. This way, both effectiveness and efficiency are handled. To evaluate the proposed approaches, an intelligent application is developed to manage the dispatching of emergency vehicles in a large geographic region and in the context of Covid-19 crisis in order to avoid an important loss in human lives. A theoretical model is designed to describe the issue mathematically. Extensive experiments are then performed to validate the mathematical model and evaluate the performance of the proposed deep self-learning algorithms. Comparison with a state-of-the-art technique shows a significant positive impact of hybridizing Quantum Machine Learning (QML) with Deep Self Learning (DSL) on solving the Covid-19 EMS transportation. [ABSTRACT FROM AUTHOR]

Hyperparameter optimization plays a significant role in the overall performance of machine learning algorithms. However, the computational cost of algorithm evaluation can be extremely high for complex algorithm or large dataset. In this paper, we propose a model-based reinforcement learning with experience variable and meta-learning optimization method to speed up the training process of hyperparameter optimization. Specifically, an RL agent is employed to select hyperparameters and treat the k-fold cross-validation result as a reward signal to update the agent. To guide the agent's policy update, we design an embedding representation called "experience variable" and dynamically update it during the training process. Besides, we employ a predictive model to predict the performance of machine learning algorithm with the selected hyperparameters and limit the model rollout in short horizon to reduce the impact of the inaccuracy of the model. Finally, we use the meta-learning technique to pre-train the model for fast adapting to a new task. To prove the advantages of our method, we conduct experiments on 25 real HPO tasks and the experimental results show that with the limited computational resources, the proposed method outperforms the state-of-the-art Bayesian methods and evolution method. [ABSTRACT FROM AUTHOR]

Clustering is a fundamental task in the field of data analysis. With the development of deep learning, deep clustering focuses on learning meaningful representation with neural networks. Ensemble clustering algorithms combine multiple base partitions into a robust and better consensus clustering. Current deep ensemble clustering algorithms usually neglect shallow and original features. Besides, rarel algorithms use graph attention networks to explore clustering structures. This paper proposes a novel Clustering algorithm based on Multi-layer Features and Graph attention Networks (CMFGN). CMFGN obtains multi-layer features through the hierarchical convolutional layers. Moreover, CMFGN combines the co-association matrix with original features as the Graph Attention Networks (GAT) input to obtain consensus clustering, which reuses original information and leverages GAT to inherit a good clustering structure. Extensive experimental results show that CMFGN remarkably outputs competitive methods on four challenging image datasets. In particular, CMFGN achieves the ACC of 82.14% on the Digits dataset, which is almost up to 6% performance improvement compared with the best baseline. [ABSTRACT FROM AUTHOR]

The performance of target detection algorithms for manual features is gradually saturated, and the development of target detection has stagnated. Computer vision is a discipline that studies how to use computers to replace the human eye and use visual information and visual algorithms to automatically detect, recognize, and track target objects. Target detection has also been fully developed as a basis for solving advanced vision tasks such as target tracking, instance segmentation, image understanding, and behavior recognition. The theories of artificial intelligence and deep learning has gradually developed, making convolutional neural networks a hot spot of attention in the field of computer vision and image processing. Based on the work in the field of target detection, this paper proposes a target detection algorithm based on the prior knowledge of the impact area of the tennis ball. Our experiments and evaluations show that the algorithm can achieve higher detection accuracy and faster detection speed. Moreover, the proposed algorithm accurately tracks and judge the impact area of tennis sports, and improve the accuracy and reliability of the tennis impact. [ABSTRACT FROM AUTHOR]

Macular edema (ME) is an essential sort of macular issue caused due to the storing of fluid underneath the macula. Age-related Macular Degeneration (AMD) and diabetic macular edema (DME) are the two customary visual contaminations that can lead to fragmentary or complete vision loss. This paper proposes a deep learning-based predictive algorithm that can be used to detect the presence of a Subretinal hemorrhage. Region Convolutional Neural Network (R-CNN) and faster R-CNN are used to develop the predictive algorithm that can improve the classification accuracy. This method initially detects the presence of Subretinal hemorrhage, and it then segments the Region of Interest (ROI) by a semantic segmentation process. The segmented ROI is applied to a predictive algorithm which is derived from the Fast Region Convolutional Neural Network algorithm, that can categorize the Subretinal hemorrhage as responsive or non-responsive. The dataset, provided by a medical institution, comprised of optical coherence tomography (OCT) images of both pre- and post-treatment images, was used for training the proposed Faster Region Convolutional Neural Network (Faster R-CNN). We also used the Kaggle dataset for performance comparison with the traditional methods that are derived from the convolutional neural network (CNN) algorithm. The evaluation results using the Kaggle dataset and the hospital images provide an average sensitivity, selectivity, and accuracy of 85.3%, 89.64%, and 93.48% respectively. Further, the proposed method provides a time complexity in testing as 2.64s, which is less than the traditional schemes like CNN, R-CNN, and Fast R-CNN. [ABSTRACT FROM AUTHOR]

An intrusion detection system is a security system that aims to detect sabotage and intrusions on networks to inform experts of the attack and abuse of the network. Different classification methods have been used in the intrusion detection systems such as fuzzy, genetic algorithms, decision trees, artificial neural networks, and support vector machines. Moreover, ensemble classifiers have shown more robust and effective performance for various tasks in the field. In this paper, we adopt ensemble models in order to improve the performance of intrusion detection and, at the same time, decrease the false alarm rate. We use kNN for multi-class classification, as well as SVM to approach the classification problem in normal-based detection. In order to combine multiple outputs, we use the Dempster–Shafer method in which there is the possibility of explicit retrieval of uncertainty. Moreover, we utilize deep learning for extracting features to train the samples, selected by the sample selection algorithm based on ensemble margin. We compare our results with state-of-the-art methods on benchmarking datasets such as UNSW-NB15, CICIDS2017, and NSL-KDD. Our proposed method indicates the superiority in terms of prominent metrics Accuracy, Precision, Recall, and F-measure. [ABSTRACT FROM AUTHOR]

Depression has become a common issue among IT industry professionals today. Lifestyle changes and new work culture increase the risk of depression among employees. Various companies and organizations offer mental health plans and try to pacify the work environment. However, the problem is already out of control. This research paper proposes an effective deep learning model for stress prediction among working employees with the help of lion optimization-based optimal artificial neural network (OANN) model. Here, the features are selected using optimal ANN technique and the diseases are predicted using lion optimization method. ANN technique eliminates inappropriate and unnecessary attributes in a significant manner, once the information on calculated characteristics and weight is disseminated to lion optimization classifier. The test results inferred that the artificial neural network is highly efficient than the current OANN algorithm method, based on lion optimization. The study evaluated the data and found that the performance of employees working under normal conditions was higher when compared to the performance of employees who work under stress. Furthermore, attitude-coping efforts may be a cognitive behavioral mechanism, which explains how workload is related to courage and work performance of employees with high stress level. [ABSTRACT FROM AUTHOR]

Nowadays, it has become well known that efficient training of deep neural networks plays a vital role in various successful applications. To achieve this goal, it is impractical to use only one computer, especially when the scale of models is large and some efficient computing resources are available. In this paper, we present a distributed parallel computing framework for training deep belief networks (DBNs) by employing the great power of high-performance clusters (i.e., a system consists of many computers). Motivated by the greedy layer-wise learning algorithm of DBNs, the whole training process is divided layer by layer and distributed to different machines. At the same time, rough representations are exploited to parallelize the training process. By conducting experiments on several large-scale real datasets, the novel algorithms are shown to significantly accelerate the training speed of DBNs while achieving better or competitive prediction accuracy in comparison with the original algorithm. [ABSTRACT FROM AUTHOR]

Neural network (NN) finds role in variety of applications due to combined effect of feature extraction and classification availability in deep learning algorithms. In this paper, we have chosen SVM, logistic regression machine learning algorithms and NN for EEG signal classification. Two-layer LSTM and four-layer improved NN deep learning algorithms are proposed to improve the performance in EEG classification. Novelty lies in one-dimensional gradient descent activation functions with radial basis operations used in the initial layers of improved NN which help in achieving better performance. Statistical features namely mean, standard deviation, kurtosis and skewness are extracted for input EEG collected from Bonn database and then applied for various classification techniques. Accuracy, precision, recall and F1 score are the performance metrics used for analyzing the algorithms. Improved NN and LSTM give better performance compared to all other architectures. The simulations are carried out with variety of activation functions, optimizers and loss models to analyze the performance using Python in keras. [ABSTRACT FROM AUTHOR]

Spectral clustering algorithm suffers from high computational complexity due to the eigen decomposition of Laplacian matrix and large similarity matrix for large-scale datasets. Some researches explore the possibility of deep learning in spectral clustering and propose to replace the eigen decomposition with autoencoder. K-means clustering is generally used to obtain clustering results on the embedding representation, which can improve efficiency but further increase memory consumption. An efficient spectral algorithm based on stacked autoencoder is proposed to solve this issue. In this paper, we select the representative data points as landmarks and use the similarity of landmarks with all data points as the input of autoencoder instead of similarity matrix of the whole datasets. To further refine clustering result, we combine learning the embedding representation and performing clustering. Clustering loss is used to update the parameters of autoencoder and cluster centers simultaneously. The reconstruction loss is also included to prevent the distortion of embedding space and preserve the local structure of data. Experiments on several large-scale datasets validate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Focusing on non-iterative approaches in training feed-forward neural networks, this special issue includes 12 papers to share the latest progress, current challenges, and potential applications of this topic. This editorial presents a background of the special issue and a brief introduction to the 12 contributions. [ABSTRACT FROM AUTHOR]