Clustering is the decomposition of similar objects in the data sequence to take place in the same groups. Although kmeans from partitioned cluster analysis algorithms is popular in clustering, it has three fundamental deficiencies in terms of insufficient computation, user-defined number of clusters and local minimum in search. The X-means algorithm is an alternative algorithm that, after every run of the k-means, can find the number k in the specified range, giving local decisions about which subclusters of the existing centers should be better fit to fit the given value. A new algorithm has been proposed to optimize the Bayesian Informatization (BIC) with X-means and to efficiently search the number of clusters and clusters. In this study, k-means and x-means clustering were applied to the same dataset with the help of WEKA. It is seen that the work done with K-means is tested with Silhoutte coefficient, x-means with BIC, and x-means clustering algorithm produces more effective results than k-means clustering algorithm.