Social Network Analysis for Precise Friend Suggestion for Twitter by Associating Multiple Networks Using ML

Social Network Analysis for Precise Friend Suggestion for Twitter by Associating Multiple Networks Using ML

Dharmendra Kumar Singh Singh, Nithya N., Rahunathan L., Preyal Sanghavi, Ravirajsinh Sajubha Vaghela, Poongodi Manoharan, Mounir Hamdi, Godwin Brown Tunze
DOI: 10.4018/IJITWE.304050
Article PDF Download
Open access articles are freely available for download

Abstract

The main aim in this paper is to create a friend suggestion algorithm that can be used to recommend new friends to a user on Twitter when their existing friends and other details are given. The information gathered to make these predictions includes the user's friends, tags, tweets, language spoken, ID, etc. Based on these features, the authors trained their models using supervised learning methods. The machine learning-based approach used for this purpose is the k-nearest neighbor approach. This approach is by and large used to decrease the dimensionality of the information alongside its feature space. K-nearest neighbor classifier is normally utilized in arrangement-based situations to recognize and distinguish between a few parameters. By using this, the features of the central user's non-friends were compared. The friends and communities of a user are likely to be very different from any other user. Due to this, the authors select a single user and compare the results obtained for that user to suggest friends.
Article Preview
Top

Literature Survey

The author talks about different networks and finds the relationship to recommend friends. It has two major components first being related networks by selecting important features and the second being network structure and preserving most of it. It is based on friend correlation and considers effect in different social roles. Huang et al. (2016).

The author gives idea about a new friend recommendation system using artificial bee colony(ABC) which indicates a link between users. It is based on the structural properties of the social network. Firstly, it finds the relevant parameters for the relationship among users using social topology. The sub- graph of the network is composed of users and all users within the network separated by three degrees of separation, then based on the subgraph new links are suggested thus indicating new friends. Akbari et al. (2013).

The paper gives a idea about a more precise friend recommendation with 2 stages. In the first stage the information of the relationship between text and users, then align the recommended friends. In the second stage, they built the topic model of the relationship between image features and users. Huang et al. (2017).

The paper proposed a novel semantic-based recommendation of friends based on their lifestyles. They take advantage of smartphones, friend books to discover the lifestyle of a user from user-centric data and then measure the similarity of lifestyle to finally recommend from with similar lifestyles. The friend book finally keeps a list of people with the highest score to recommend a friend. Wang et al. (2015).

The paper gives idea about users who want to meet friends on social media, they interviewed active users and then developed a friend request acceptance model to refer to various factors that influence it. They found out the major factor that impacts the person who accepts the friend request, mostly person with common hobbies and mutual friend is accepted. Rashtian et al. (2014).

The paper talks about how to find short paths between users in a network which would indicate their closeness and will also result in them being a good recommendation as a friend. These are based on email contact, it is found that the kind of things people talk or find is a huge factor in determining their closeness. Adamic and Adar (2005).

Complete Article List

Search this Journal:
Reset
Volume 19: 1 Issue (2024)
Volume 18: 1 Issue (2023)
Volume 17: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 16: 4 Issues (2021)
Volume 15: 4 Issues (2020)
Volume 14: 4 Issues (2019)
Volume 13: 4 Issues (2018)
Volume 12: 4 Issues (2017)
Volume 11: 4 Issues (2016)
Volume 10: 4 Issues (2015)
Volume 9: 4 Issues (2014)
Volume 8: 4 Issues (2013)
Volume 7: 4 Issues (2012)
Volume 6: 4 Issues (2011)
Volume 5: 4 Issues (2010)
Volume 4: 4 Issues (2009)
Volume 3: 4 Issues (2008)
Volume 2: 4 Issues (2007)
Volume 1: 4 Issues (2006)
View Complete Journal Contents Listing