GPOGC: Gaussian Pigeon-Oriented Graph Clustering Algorithm for Social Networks Cluster

Abstract

As the continuous development of mobile social networks, the structure of the mobile social network increasingly becomes complex. It not only speeds up information transmission between people but also expands the scope of information exchange, which has become an essential and important social media in people's social life. How to effectively identify and classify these online communities has important practical significance for the study of social networks. Correctly detecting the community structure of mobile social networks can not only improve the accuracy of friend recommendation, link prediction, service user positioning, product marketing, and other aspects but also provide an important basis for the monitoring of online public opinion. But the traditional social network cluster method based on the trust degree mainly calculates the user trust by analyzing the interactive feedback information between users. This method cannot effectively solve the ''cold start'' problem in the trust calculation process, that is, for the new network node, the trust value of this node cannot be accurately measured due to the lack of interaction with other nodes. Focusing on this problem, we propose a Gaussian pigeon-oriented graph clustering algorithm for social networks' cluster in this paper. A graph model is first built. Then, an efficient K-medoid algorithm is utilized to search the user center in all groups. The Gaussian pigeon algorithm is used to search the similarity between each user and the central user. Users that meet the similarity threshold are divided into the same user group. Finally, the simulation results show that the proposed method has better cluster effect than other state-ofthe-art social networks' clustering approaches.INDEX TERMS Social network, Gaussian pigeon algorithm, graph clustering, K-medoid algorithm.

A novel A* method fusing bio-inspired algorithm for mobile robot path planning

“…In the landmark operator, the population quantity is too small in the later iteration period, which affects the optimization of the algorithm. In the stage of landmark operator, the population size can be slightly larger at the beginning of iteration [27][28][29], but it should gradually decrease as the iteration number increases. Logsig function has the characteristics of nonlinear reduction from 1 to 0, so Logsig function is introduced in this paper as the adaptive step of the pigeon number, and the improved landmark operator update formula is shown as follows:…”

A Generative Adversarial Network Model Based on Intelligent Data Analytics for Music Emotion Recognition under IoT

“…e main processes include the emotion database establishment, the phonetic emotion features extraction, dimensionality reduction and features selection, and emotion classification and recognition. ere are many methods for music emotion recognition, which have achieved better effects, such as hidden Markov model (HMM) [6], artificial neural network (ANN) [7], Gaussian mixture model (GMM) [8], support vector machine (SVM) [9], K-nearest neighbor (KNN) [10], and maximum likelihood Bayesian classification [11,12]. However, the research objects (languages) are different, and there is no unified standard for the corpus database, so the recognition results are greatly different with each other.…”

Student Behavior Recognition From Heterogeneous View Perception in Class Based on 3-D Multiscale Residual Dense Network for the Analysis of Case Teaching

“…Also, the network can be trained end-to-end, which makes the model calculation more efficient. In the numerous deep learning network structures, the convolutional neural network (CNN) is the most widely used (Sun et al, 2019 ; Teng and Li, 2019 ; Yin and Bi, 2019 ).…”