Normal parameter reduction algorithm in soft set based on hybrid binary particle swarm and biogeography optimizer

© 2019, Springer-Verlag London Ltd., part of Springer Nature. Existing classification techniques that are proposed previously for eliminating data inconsistency could not achieve an efficient parameter reduction in soft set theory, which effects on the obtained decisions. Meanwhile, the computational cost made during combination generation process of soft sets could cause machine infinite state, which is known as nondeterministic polynomial time. The contributions of this study are mainly focused on minimizing choices costs through adjusting the original classifications by decision partition order and enhancing the probability of searching domain space using a developed Markov chain model. Furthermore, this study introduces an efficient soft set reduction-based binary particle swarm optimized by biogeography-based optimizer (SSR-BPSO-BBO) algorithm that generates an accurate decision for optimal and sub-optimal choices. The results show that the decision partition order technique is performing better in parameter reduction up to 50%, while other algorithms could not obtain high reduction rates in some scenarios. In terms of accuracy, the proposed SSR-BPSO-BBO algorithm outperforms the other optimization algorithms in achieving high accuracy percentage of a given soft dataset. On the other hand, the proposed Markov chain model could significantly represent the robustness of our parameter reduction technique in obtaining the optimal decision and minimizing the search domain.Published versio

Random Projection in Deep Neural Networks

This work investigates the ways in which deep learning methods can benefit from random projection (RP), a classic linear dimensionality reduction method. We focus on two areas where, as we have found, employing RP techniques can improve deep models: training neural networks on high-dimensional data and initialization of network parameters. Training deep neural networks (DNNs) on sparse, high-dimensional data with no exploitable structure implies a network architecture with an input layer that has a huge number of weights, which often makes training infeasible. We show that this problem can be solved by prepending the network with an input layer whose weights are initialized with an RP matrix. We propose several modifications to the network architecture and training regime that makes it possible to efficiently train DNNs with learnable RP layer on data with as many as tens of millions of input features and training examples. In comparison to the state-of-the-art methods, neural networks with RP layer achieve competitive performance or improve the results on several extremely high-dimensional real-world datasets. The second area where the application of RP techniques can be beneficial for training deep models is weight initialization. Setting the initial weights in DNNs to elements of various RP matrices enabled us to train residual deep networks to higher levels of performance

Advanced vibration analysis for the diagnosis and prognosis of rotating machinery components within condition-based maintenance programs

Machines used in the industrial field may deteriorate with usage and age. Thus it is important to maintain them so as to avoid failure during actual operation which may be dangerous or even disastrous.The literature has focused its attention on the development of optimal maintenance strategies, such as condition-based maintenance (CBM), in order to improve system reliability, to avoid system failures, and to decrease maintenance costs. CBM aims to detect the early occurrence and seriousness of a fault, to estimate the time interval during which the equipment can still operate before failure, and to identify the components which are deteriorating. CBM has been widely and effectively applied to rotating machines, which usually operate by means of bearings. The reliable and continuous work of bearings is important as the break of one of them can compromise the work of the system. Thus the monitoring, prognosis and diagnosis of bearings represent crucial and important tasks to support real-time maintenance programs. This research has carried out a complete analysis of advanced soft computing techniques ranging from the multi-class classification to one-class classification, and of combination strategies based on classifier fusion and selection. The purpose of this analysis was to design and develop high accurate and high robust methodologies to perform the detection, diagnosis and prognosis of defects on rolling elements bearings. We used vibration signals recorded by four accelerometers on a mechanical device including rolling element bearings: the signals were collected both with all faultless bearings and after substituting one faultless bearing with an artificially damaged one. Four defects and three severity levels were considered. This research has brought to the design and development of new classifiers which have proved to be very accurate and thus to represent a valuable alternative to the traditional classifiers. Besides, the high accuracy and the high robustness to noise, shown by the obtained results, prove the effectiveness of the proposed methodologies, which can be thus profitably used to perform automatic prognosis and diagnosis of rotating machinery components within real-time condition-based maintenance programs

On the power of message passing for learning on graph-structured data

This thesis proposes novel approaches for machine learning on irregularly structured input data such as graphs, point clouds and manifolds. Specifically, we are breaking up with the regularity restriction of conventional deep learning techniques, and propose solutions in designing, implementing and scaling up deep end-to-end representation learning on graph-structured data, known as Graph Neural Networks (GNNs). GNNs capture local graph structure and feature information by following a neural message passing scheme, in which node representations are recursively updated in a trainable and purely local fashion. In this thesis, we demonstrate the generality of message passing through a unified framework suitable for a wide range of operators and learning tasks. Specifically, we analyze the limitations and inherent weaknesses of GNNs and propose efficient solutions to overcome them, both theoretically and in practice, e.g., by conditioning messages via continuous B-spline kernels, by utilizing hierarchical message passing, or by leveraging positional encodings. In addition, we ensure that our proposed methods scale naturally to large input domains. In particular, we propose novel methods to fully eliminate the exponentially increasing dependency of nodes over layers inherent to message passing GNNs. Lastly, we introduce PyTorch Geometric, a deep learning library for implementing and working with graph-based neural network building blocks, built upon PyTorch