International Journal of Computational Intelligence and Applications

Trading cryptocurrencies (digital currencies) are currently performed by applying methods similar to what is applied to the stock market or commodities; however, these algorithms are not necessarily well-suited for predicting cryptocurrency prices. Unlike stock exchanges, which shut down for several hours or days at a time, digital currency prediction and trading seem to be of a more consistent and predictable nature. In this work, we benefit from sentiment analysis of tweets using both an existing sentiment analysis package and a manually tailored “objective analysis,” to calculate one impact value for each analysis every 15min. We then select the most appropriate training method by applying evolutionary techniques and discover the best subset of the generated features to include, as well as other parameters. One of the unique contributions of this work is the analysis of both English and Japanese tweets with a tailored “objective analysis” tool. This resulted in implementation of predictors which yielded 28% to 122% profit in a four-week simulation, much more than simply holding a digital currency for the same period of time.

Recently, a method called Meta-SR has solved the problem of super-resolution of arbitrary scale factor with only one single model. However, it has a limited reconstruction accuracy compared with RDN$+$ and EDSR$+$. Inspired by Meta-SR, we noticed that by combining the core idea of Meta-SR and D-DBPN, we might construct a network that has as good image reconstruction accuracy as D-DBPN’s, at the same time, keeps arbitrary scaling function. According to Meta-SR’s Meta-Upscale Module, we designed a different structure called Meta-Downscale Module. By using these two different modules and back-projection structure, we construct an arbitrary back-projection network, which has the ability to enlarge images with arbitrary scale factor by using only one single model, meanwhile, obtains state-of-the-art reconstruction results. Through extensive experiments, our proposed method performs better reconstruction effect than Meta-SR and more efficient than D-DBPN. Besides that, we also evaluated the proposed method on widely used benchmark dataset on single image super-resolution. The experimental results show the superiority of our model compared to RDN+ and EDSR+.

Accurate identification of Golgi protein types can provide useful clues to reveal the correlation between GA dysfunction and disease pathology and improve the ability to develop more effective treatments for the diseases. This paper introduces an effective and robust method to classify Golgi protein type with traditional machine learning algorithms. In which various features such as n-GDip, DCCA, psePSSM were used as training features and SVM with linear kernel was employed as a classifier. To solve the imbalance problem of the benchmark datasets, the oversampling technique SMOTE was adopted. To deal with the huge amount of features, the PCA algorithm and Fisher feature selection method were adopted to reduce feature dimensions and remove redundant features. The experimental results show that the proposed method had a further improvement compared with other traditional machine learning methods in 10-fold cross-validation, Jackknife cross-validation and independent testing, which means a further step for the clinical application of computational methods to predict the Golgi protein types.

A bottleneck of laboratory analysis in process industries including steelmaking plants is the low sampling rate. Inference models using only variables measured online have then been used to made such information available in advance. This study develops predictive models for key mechanical properties of seamless steel tubes, by strength, ultimate tensile strength and hardness. A plant in Brazil was used as the case study. The sample sizes of some steel tube families given namely, yield a particular property are discrepant and sometimes very small. To overcome this sample imbalance and lack of representativeness, committees of predictive neural network models based on bagging predictors, a type of ensemble method, were adopted. As a result, all steel families for all properties have been satisfactorily described showing the correlations between targets and model estimates close to 99%. These results were compared to multiple linear regression, support vector machine and a simpler neural network. Such information available in advance favors corrective actions before complete tube production mitigating rework costs in general.

Bed temperature in dense-phase zone is the key parameter of circulating fluidized bed (CFB) boiler for stable combustion and economic operation. It is difficult to establish an accurate bed temperature model as the complexity of circulating fluidized bed combustion system. T-S fuzzy model was widely applied in the system identification for it can approximate complex nonlinear system with high accuracy. Fuzzy c-regression model (FCRM) clustering based on hyper-plane-shaped distance has the advantages in describing T-S fuzzy model, and Gaussian function was adapted in antecedent membership function of T-S fuzzy model. However, Gaussian fuzzy membership function was more suitable for clustering algorithm using point to point distance, such as fuzzy c-means (FCM). In this paper, a hyper-plane-shaped FCRM clustering algorithm for T-S fuzzy model identification algorithm is proposed. The antecedent membership function of proposed identification algorithm is defined by a hyper-plane-shaped membership function and an improved fuzzy partition method is applied. To illustrate the efficiency of the proposed identification algorithm, the algorithm is applied in four nonlinear systems which shows higher identification accuracy and simplified identification process. At last, the algorithm is used in a circulating fluidized bed boiler bed temperature identification process, and gets better identification result.

The influence of features on each cluster is not the same in a mixed-type dataset. Based on the rough set and shadow set theories, the fuzzy distribution centroid was defined to represent the clustering center of the discrete feature so that the fuzzy c-means algorithm (FCM) could be extended to cluster the data with both continuous and discrete features. Then, considering the different contributions of the features to each cluster, a new weighted objective function was constructed in accordance with the principles of fuzzy compactness and separation. Because the learning feature weight is the key step in feature-weighted FCM, this paper regarded the feature weight as a variable optimized in the clustering process and put forward a self-adaptive mixed-type weighted FCM. The experimental results showed that the algorithm could be effectively applied to a heterogeneous mixed-type dataset.

Sentiment analysis (SA) is a technique that lets people in different fields such as business, economy, research, government, and politics to know about people’s opinions, which greatly affects the process of decision-making. SA techniques are classified into: lexicon-based techniques, machine learning techniques, and a hybrid between both approaches. Each approach has its limitations and drawbacks, the machine learning approach depends on manual feature extraction, lexicon-based approach relies on sentiment lexicons that are usually unscalable, unreliable, and manually annotated by human experts. Nowadays, word-embedding techniques have been commonly used in SA classification. Currently, Word2Vec and GloVe are some of the most accurate and usable word embedding techniques, which can transform words into meaningful semantic vectors. However, these techniques ignore sentiment information of texts and require a huge corpus of texts for training and generating accurate vectors, which are used as inputs of deep learning models.

In this paper, we propose an enhanced ensemble classifier framework. Our framework is based on our previously published lexicon-based method, bag-of-words, and pre-trained word embedding, first the sentence is preprocessed by removing stop-words, POS tagging, stemming and lemmatization, shortening exaggerated word. Second, the processed sentence is passed to three modules, our previous lexicon-based method (Sum Votes), bag-of-words module and semantic module (Word2Vec and Glove) and produced feature vectors. Finally, the previous features vectors are fed into 11 different classifiers.

The proposed framework is tested and evaluated over four datasets with five different lexicons, the experiment results show that our proposed model outperforms the previous lexicon based and the machine learning methods individually.

Target detection is one of the important subfields in the research of Synthetic Aperture Radar (SAR). It faces several challenges, due to the stationary objects, leading to the presence of scatter signal. Many researchers have succeeded on target detection, and this work introduces an approach for moving target detection in SAR. The newly developed scheme named Adaptive Particle Fuzzy System for Moving Target Detection (APFS-MTD) as the scheme utilizes the particle swarm optimization (PSO), adaptive, and fuzzy linguistic rules in APFS for identifying the target location. Initially, the received signals from the SAR are fed through the Generalized Radon-Fourier Transform (GRFT), Fractional Fourier Transform (FrFT), and matched filter to calculate the correlation using Ambiguity Function (AF). Then, the location of target is identified in the search space and is forwarded to the proposed APFS. The proposed APFS is the modification of standard Adaptive genetic fuzzy system using PSO. The performance of the MTD based on APFS is evaluated based on detection time, missed target rate, and Mean Square Error (MSE). The developed method achieves the minimal detection time of 4.13s, minimal MSE of 677.19, and the minimal moving target rate of 0.145, respectively.