Synergy Creation Of Users In Kousarnet Social Scientific Network Using Graph Based Clustering Methods
In recent years, the number of users of social networks has grown significantly. The big challenge for these networks’ audience is How to communicate with the people present on these networks. Friend recommender systems try to fix this challenge by offering suggestions. In this study, data from the...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
Allameh Tabataba'i University Press
2021-05-01
|
| Series: | مطالعات مدیریت کسب و کار هوشمند |
| Subjects: | |
| Online Access: | https://ims.atu.ac.ir/article_12861_a1bfea76b560127d13014e7a5c3e3f72.pdf |
| Summary: | In recent years, the number of users of social networks has grown significantly. The big challenge for these networks’ audience is How to communicate with the people present on these networks. Friend recommender systems try to fix this challenge by offering suggestions. In this study, data from the social and scientific network of Kousarent were used. In this research, using 10 types of relationships between users without considering the friendship relationships, network graph created, and then by using 3 algorithms Louvain, Kmeans and Hierarchical graph clustering was performed to identify communities. Clusters obtained from Louvain's clustering algorithm had higher percentages of matching with friendships. Then, weights were calculated by genetic algorithm for each of 10 relationships and by applying Louvain clustering algorithm on the network graph, the highest percentage of matching with the optimal weight of each of the 10 relationships was obtained. In this case, the resulting clusters are optimal clusters containing the most similar users. So other users in the same cluster can be suggested as friends. The weight of the edges between the individuals in the graph was also used to prioritize the bids. At the end, the friend proposed method was evaluated and the percentage of suggested friends matched with the individual's true friends was calculated. |
|---|---|
| ISSN: | 2821-0964 2821-0816 |