Advances in computational intelligence最新文献

The implementation of machine learning techniques allows to prevent in advance the degeneration of any component present in a wind turbine, as well as the detection and diagnosis of sudden failures. This methodology allows automatic and autonomous learning to predict, detect and diagnose electrical and mechanical failures in wind turbines. Four different failure states have been simulated due to bearing vibrations in wind turbines, comparing traditional techniques, such as frequency analysis, as well as the implementation of AI, using the KNN and SVM methodology. This contribution evaluates different methodologies for monitoring, supervision and fault diagnosis based on the implementation of machine learning algorithms adapted to the different components and faults of the wind turbine. Implementing these techniques, allows to anticipate a breakdown, reduce downtime and costs, especially if they are offshore.

Modern search engine result pages (SERPs) become increasingly complex with heterogeneous information aggregated from various sources. In many cases, these SERPs also display results in the right rail besides the traditional left-rail result lists, which change the linear result list to a non-linear panel and might influence user search behavior patterns. While user behavior on the traditional ranked result list has been well studied in existing works, it still lacks a thorough investigation of the effects caused by the right-rail results, especially on complex SERPs. To shed light on this research question, we conducted a user study, which collected participants’ eye movements, detailed interaction behavioral logs, and feedback information. Based on the collected data, we analyze the influence of right-rail results on users’ examination patterns, search behavior, perceived workload, and satisfaction. We further construct a user model to predict users’ examination behavior on non-linear SERPs. Our work contributes to understanding the effects of the right-rail results on users’ interaction patterns, benefiting other related research, such as the evaluation and UI optimization of search systems.

Support vector machine (SVM) models are usually trained by solving the dual of a quadratic programming, which is time consuming. Using the idea of penalty function method from optimization theory, this paper combines the objective function and the constraints in the dual, obtaining an unconstrained optimization problem, which could be solved by a generalized Newton method, yielding an approximate solution to the original model. Extensive experiments on pattern classification were conducted, and compared to the quadratic programming-based models, the proposed approach is much more computationally efficient (tens to hundreds of times faster) and yields similar performance in terms of receiver operating characteristic curve. Furthermore, the proposed method and quadratic programming-based models extract almost the same set of support vectors.

We establish in this paper the equivalence between the existence of a solution of the Yang Baxter equation of a Jordan superalgebras and that of symplectic form on Jordan superalgebras.

The convolution neural networks are well known for their efficiency in detecting and classifying objects once adequately trained. Though they address shift in-variance up to a limit, appreciable rotation and scale in-variances are not guaranteed by many of the existing CNN architectures, making them sensitive towards input image or feature map rotation and scale variations. Many attempts have been made in the past to acquire rotation and scale in-variances in CNNs. In this paper, an efficient approach is proposed for incorporating rotation and scale in-variances in CNN-based classifications, based on eigenvectors and eigenvalues of the image covariance matrix. Without demanding any training data augmentation or CNN architectural change, the proposed method, ‘Scale and Orientation Corrected Networks (SOCN)’, achieves better rotation and scale-invariant performances. SOCN proposes a scale and orientation correction step for images before baseline CNN training and testing. Being a generalized approach, SOCN can be combined with any baseline CNN to improve its rotational and scale in-variance performances. We demonstrate the proposed approach’s scale and orientation invariant classification ability with several real cases ranging from scale and orientation invariant character recognition to orientation invariant image classification, with different suitable baseline architectures. The proposed approach of SOCN, though is simple, outperforms the current state of the art scale and orientation invariant classifiers comparatively with minimal training and testing time.

In this paper, we initiate the study of the notion of the BCK-function on an arbitrary set A, and providing connections with x-functions and x-subsets for (x in X) where X is a BCK-algebra. Moreover, using the notion of order in a BCK-algebra, the BCK-code C is introduced and besides a new structure of order in C is investigated. Finally, we show that the structure of the BCK-algebra X and the BCK-code C which is generated by X, with their related orders are the same.

This paper deals with some issues of fixed point concerning Caristi type mappings introduced by Abbasi and Golshan (Kybernetika 52:929–942, 2016) in fuzzy metric spaces. We enlarge this class of mappings and prove completeness characterization of corresponding fuzzy metric space. The paper includes a comprehensive set of examples showing the generality of our results and an open question.

Feature selection can effectively eliminate irrelevant or redundant features without changing features semantics, so as to improve the performance of learning and reduce the training time. In most of the existing feature selection methods based on rough sets, eliminating the redundant features between features and decisions, and deleting the redundant features between features are performed separately. This will greatly increase the search time of feature subset. To quickly remove redundant features, we define a series of feature evaluation functions that consider both the consistency between features and decisions, and redundancy between features, then propose a novel feature selection method based on min-redundancy and max-consistency. Firstly, we define the consistency of features with respect to decisions and the redundancy between features from neighborhood information granules. Then we propose a combined criterion to measure the importance of features and design a feature selection algorithm based on minimal-redundancy-maximal-consistency (mRMC). Finally, on UCI data sets, mRMC is compared with three other popular feature selection algorithms based on neighborhood idea, from classification accuracy, the number of selected features and running time. The experimental comparison shows that mRMC can quickly delete redundant features and select useful features while ensuring classification accuracy.