The unparalleled accomplishment of social networking sites, such as Facebook, LinkedIn and Twitter has modernized and transformed the way people communicate to each other. Nowadays, a huge amount of information is being shared by online users through these social networking sites. Various online friendship sites such as Facebook and Orkut, allow online friends to share their thoughts or opinions, comment on others' timeline or photos, and most importantly, meet new online friends who were known to them before. However, the question remains as to how to quickly propagate one's online network by including more and more new friends. For this, one of the easy methods used is list of 'Suggested Friends' provided by these online social networking sites. For suggestion of friends, prediction of links for each online user is needed to be made based on studying the structural properties of the network. Link prediction is one of the key research directions in social network analysis which has attracted much attention in recent years. This paper discusses about a novel efficient link prediction technique LinkGyp and many other commonly used existing prediction techniques for suggestion of friends to online users of a social network and also carries out experimental evaluations to make a comparative analysis among each technique. Our results on three real social network datasets show that the novel LinkGyp link prediction technique yields more accurate results than several existing link prediction techniques.
Influence maximization in Online Social Networks (OSNs) is the task of finding a small subset of nodes, often called as seed nodes that could maximize the spread of influence in the network. With the success of OSNs such as Twitter, Facebook, Flickr and Flixster, the phenomenon of influence exerted by such online social network users on several other online users, and how it eventually propagates in the network, has recently caught the attention of computer researchers to be mainly applied in the marketing field. However, the enormous amount of nodes or users available in OSNs poses a great challenge for researchers to study such networks for influence maximization. In this paper, we study efficient influence maximization by comparing the general Greedy algorithm with two other centrality algorithms often used for this purpose.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.