The fuzzy c-means (FCM) is the best known clustering and use the degree of membership fuzzy to data clustering. But the membership is not always for all data correctly. That is, at scattered dataset belonging is less and noisy dataset belonging is more assigned and local optimization problem occurs. Possibility c-means (PCM) was introduced to correspond weaknesses FCM approach. In PCM was not self-duality property. In other words, a sample membership for all clusters be assigned more than one and basic condition FCM were violated. One of the new method is Credibilistic clustering and based on credibility theory proposed that is used to study the behavior of fuzzy phenomenon. The aim is to provide new Credibilistic clustering approach with replacing credibility measure instead of the fuzzy membership and Mahalanobis distance use in FCM objective function. Credibility measure has self-duality property and solves coincident clustering problem. Mahalanobis distance used instead of Euclidian distance to separate cluster centers from each other and dens samples of each cluster. The result of proposed method is evaluated with three numeric dataset and Iris dataset. The most important challenge will be how to choose the initial cluster centers in the noisy dataset. In the future, we can be used FCM combined with particle swarm optimization.

The generalized Normal distribution is obtained from normal distribution by adding a shape parameter to it. This paper is based on the estimation of the shape and scale parameter of generalized Normal distribution by using the maximum likelihood estimation and Bayesian estimation method via Lindley approximation method under Jeffreys prior and informative priors. The objective of this paper is to see which is the suitable prior for the shape and scale parameter of generalized Normal distribution. Simulation study with varying sample sizes, based on MSE, is conducted in R-software for data analysis.

Today, there are many cryptographic algorithms that are designed to maintain the data confidentiality, from these algorithms is AES. In AES-GCM, the key in addition to the IV are used to encrypt the plaintext to obtain the ciphertext instead of just the key in the traditional AES. The Use of the IV with the key in order to gain different ciphertext for the same plaintext that was encrypted more than ones, with the same key. In this paper, the mechanism of change the IV each time in AES-GCM was modified to get more randomness in the ciphertext, thus increase the difficulty of breaking the encrypted text through analysis to obtain the original text. NIST statistical function were used to measure the randomness ratio in the encrypted text before and after modification, where there was a clear rise in the randomness ratio in the encoded text which obtained by using the modified algorithm against ciphertext by using the normal AES_GCM.

Selection criteria, crossover and mutation are three main operators of genetic algorithm’s performance. A lot of work has been done on these operators, but the crossover operator has a vital role in the operation of genetic algorithms. In literature, multiple crossover operators already exist with varying impact on the final results. In this article, we propose two new crossover operators for the genetic algorithms. One of them is based on the natural concept of crossover i.e. the upcoming offspring takes one bit from a parent and next from other parent and continuously takes bits till last one. The other proposed scheme is the extension of two-point crossover with the concept of multiplication rule. These operators are applied for eight benchmark problems in parallel with some traditional crossover operators. Empirical studies show a remarkable performance of the proposed crossover operators.

Facial Expression Recognition (FER) has gained interest among researchers due to its inevitable role in the human computer interaction. In this paper, an FER model is proposed using principal component analysis (PCA) as the dimensionality reduction technique, Gabor wavelets and Local binary pattern (LBP) as the feature extraction techniques and support vector machine (SVM) as the classification technique. The experimentation was done on Cohn-Kanade, JAFFE, MMI Facial Expression datasets and real time facial expressions using a webcam. The proposed methods outperform the existing methods surveyed.