Aboul Ella Hassanien (Abo)

This article presents a New Neutrosophic C-Means (NNCMs) method for clustering. It uses the neutrosophic logic (NL), to generalize the Fuzzy C-Means (FCM) clustering system. The NNCMs system assigns objects to clusters using three degrees of membership: a degree of truth, a degree of indeterminacy, and a degree of falsity, rather than only the truth degree used in the FCM. The indeterminacy degree, in the NL, helps in categorizing objects laying in the intersection and the boundary areas. Therefore, the NNCMs reaches more accurate results in clustering. These degrees are initialized randomly without any constraints. That is followed by calculating the clusters’ centers. Then, iteratively, the NNCMs updates the membership values of every object, and the clusters’ centers. Finally, it measures the accuracy and tests the objective function. The performance of the proposed system is tested on the six real-world databases: Iris, Wine, Wisconsin Diagnostic Breast Cancer, Seeds, Pima, and Statlog (Heart). The comparison between the two systems shows that the proposed NNCMs is more accurate.

In last few years many approaches have been proposed to detect communities in social networks using diverse ways. Community detection is one of the important researches in social networks and graph analysis. This paper presents a cuckoo search optimization algorithm with Lévy flight for community detection in social networks. Experimental on well-known benchmark data sets demonstrates that the proposed algorithm can define the structure and detect communities of complex networks with high accuracy and quality. In addition, the proposed algorithm is compared with some swarms algorithms including discrete bat algorithm, artificial fish swarm, discrete Krill Herd, ant lion algorithm and lion optimization algorithm and the results show that the proposed algorithm is competitive with these algorithms.

Investigating information credibility is an important problem in online social networks such as Twitter. Since misleading information can get easily propagated in Twitter, ranking tweets according to their credibility can help to detect rumors and identify misinformation. In this paper, we propose a Petri net model to visualise tweet credibility in Twitter. We consider the uniform resource locator (URL) as an effective feature in evaluating tweet credibility since it is used to identify the source of tweets, especially for newsworthy tweets. We perform an experimental evaluation on about 1000 tweets, and show that the proposed model is effective for assigning tweets to two classes: credible and incredible tweets, which each class being further divided into two sub-classes (“credible” and “seem credible” and “doubtful” and “incredible” tweets, respectively) based on appropriate features.