Finding best clustering for big networks with minimum objective function by using probabilistic Tabu search

Abstract EN

Fuzzy C-means (FCM) is a clustering method used for collecting similar data elements within the group according to specific measurements.

Tabu is a heuristic algorithm.

In this paper, Probabilistic Tabu Search for FCM implemented to find a global clustering based on the minimum value of the Fuzzy objective function.

The experiments designed for different networks, and cluster’s number the results show the best performance based on the comparison that is done between the values of the objective function in the case of using standard FCM and Tabu-FCM, for the average of ten runs.