Marketing based on user behavior on Facebook social network through recommender system design

Author(s):  
Bahareh Shadi Shams Zamenjani

t— the influence of social networks among people and at the same time inevitable spread of commercial use of them. Accordingly, in order to sell products, recommender systems designed based on user behavior on social networks, providing a variety of commercial offers tailored to the user. The accuracy of recommender systems that make recommendations to users, and how many of the proposals are accepted by the users is important. In this paper, a recommender system is designed based on user behavior in social network Facebook in two acts and suggests that users purchase their favorite products. The first step is to examine user behavior based on user interests will be given an offer to buy products. In the second stage recommender system uses data mining techniques and suggestions to the user that is associated with their previous purchases. This is real data and the real results of it and it is valid, as well as the results show a high level of accuracy recommender system is designed to offer suggestions to users.

2021 ◽  
Author(s):  
Lubaid Ahmed

Social networks have become significant tools due to the vast and useful information existing in them. The social platforms also act as the storage of entered choices of millions of users for various applications such as political surveys, research studies, marketing product preferences and many more. Social network recommender systems exploit this information and direct users in selecting their choices. It is clear that recommender systems should be efficient enough to be able to process the huge magnitude of data that has been generated in recent years by social network users. This research proposes a foundation of an efficient and scalable recommender system to be able to process large amount of data (i.e. Big data) in a short amount of time. The main goal is providing scalability and efficiency of the recommender system. The simulation of the prototype of such a distributed recommender system by using multi-agent based technologies shows promising results. These prototypes provide recommendations to users about other users with the similar interests in online and distributed manner as real recommender systems. The agents can simulate users or can be used as the containers of algorithms for comparing the similarity between users by different approaches, such as cosine similarity and clustering methods for testing and examining real scenarios. To be able to test these prototypes in agent-based simulation environment an agent-based framework is developed. This framework has three modules named social network crawler, social network simulator and employed prototype of the distributed recommender system that use different text and data mining algorithms. Finally, newly developed performance metric (called Scalability Factor) is introduced that shows the minimum number of servers needed to be able to run the agent systems in parallel. This thesis shows using a distributed and parallel model for recommender systems is the key to increase the speed of recommendation convergence and as a result to provide scalability. Multi-agent based simulation results, coupled with numerical analysis affirm that the proposed solution provides scalability and efficiency for recommender systems.


2021 ◽  
Author(s):  
Lubaid Ahmed

Social networks have become significant tools due to the vast and useful information existing in them. The social platforms also act as the storage of entered choices of millions of users for various applications such as political surveys, research studies, marketing product preferences and many more. Social network recommender systems exploit this information and direct users in selecting their choices. It is clear that recommender systems should be efficient enough to be able to process the huge magnitude of data that has been generated in recent years by social network users. This research proposes a foundation of an efficient and scalable recommender system to be able to process large amount of data (i.e. Big data) in a short amount of time. The main goal is providing scalability and efficiency of the recommender system. The simulation of the prototype of such a distributed recommender system by using multi-agent based technologies shows promising results. These prototypes provide recommendations to users about other users with the similar interests in online and distributed manner as real recommender systems. The agents can simulate users or can be used as the containers of algorithms for comparing the similarity between users by different approaches, such as cosine similarity and clustering methods for testing and examining real scenarios. To be able to test these prototypes in agent-based simulation environment an agent-based framework is developed. This framework has three modules named social network crawler, social network simulator and employed prototype of the distributed recommender system that use different text and data mining algorithms. Finally, newly developed performance metric (called Scalability Factor) is introduced that shows the minimum number of servers needed to be able to run the agent systems in parallel. This thesis shows using a distributed and parallel model for recommender systems is the key to increase the speed of recommendation convergence and as a result to provide scalability. Multi-agent based simulation results, coupled with numerical analysis affirm that the proposed solution provides scalability and efficiency for recommender systems.


2006 ◽  
Vol 25 (4) ◽  
pp. 237-246
Author(s):  
Tomas Hellström

This paper presents a qualitative study of mechanisms enabling social network formation in the R&D unit of a large technology-based organization. Drawing on interviews with 37 high-level technical and administrative unit members, a number of social network enablers could be discerned, which related to the need for effective location mechanisms, special “enrolment spaces”, and mechanisms for forging contacts. It was also possible to identify a number of higher-order factors for facilitation of network formation, namely hierarchical enablers and communicative and assimilative factors. Based on these results, the paper makes suggestions as to the theoretical and practical significance of social network enabling mechanisms in R&D organizations.


2021 ◽  
Author(s):  
Syeda Nadia Firdaus

Social network is a hot topic of interest for researchers in the field of computer science in recent years. These social networks such as Facebook, Twitter, Instagram play an important role in information diffusion. Social network data are created by its users. Users’ online activities and behavior have been studied in various past research efforts in order to get a better understanding on how information is diffused on social networks. In this study, we focus on Twitter and we explore the impact of user behavior on their retweet activity. To represent a user’s behavior for predicting their retweet decision, we introduce 10-dimentional emotion and 35-dimensional personality related features. We consider the difference of a user being an author and a retweeter in terms of their behaviors, and propose a machine learning based retweet prediction model considering this difference. We also propose two approaches for matrix factorization retweet prediction model which learns the latent relation between users and tweets to predict the user’s retweet decision. In the experiment, we have tested our proposed models. We find that models based on user behavior related features provide good improvement (3% - 6% in terms of F1- score) over baseline models. By only considering user’s behavior as a retweeter, the data processing time is reduced while the prediction accuracy is comparable to the case when both retweeting and posting behaviors are considered. In the proposed matrix factorization models, we include tweet features into the basic factorization model through newly defined regularization terms and improve the performance by 3% - 4% in terms of F1-score. Finally, we compare the performance of machine learning and matrix factorization models for retweet prediction and find that none of the models is superior to the other in all occasions. Therefore, different models should be used depending on how prediction results will be used. Machine learning model is preferable when a model’s performance quality is important such as for tweet re-ranking and tweet recommendation. Matrix factorization is a preferred option when model’s positive retweet prediction capability is more important such as for marketing campaign and finding potential retweeters.


2021 ◽  
Author(s):  
Syeda Nadia Firdaus

Social network is a hot topic of interest for researchers in the field of computer science in recent years. These social networks such as Facebook, Twitter, Instagram play an important role in information diffusion. Social network data are created by its users. Users’ online activities and behavior have been studied in various past research efforts in order to get a better understanding on how information is diffused on social networks. In this study, we focus on Twitter and we explore the impact of user behavior on their retweet activity. To represent a user’s behavior for predicting their retweet decision, we introduce 10-dimentional emotion and 35-dimensional personality related features. We consider the difference of a user being an author and a retweeter in terms of their behaviors, and propose a machine learning based retweet prediction model considering this difference. We also propose two approaches for matrix factorization retweet prediction model which learns the latent relation between users and tweets to predict the user’s retweet decision. In the experiment, we have tested our proposed models. We find that models based on user behavior related features provide good improvement (3% - 6% in terms of F1- score) over baseline models. By only considering user’s behavior as a retweeter, the data processing time is reduced while the prediction accuracy is comparable to the case when both retweeting and posting behaviors are considered. In the proposed matrix factorization models, we include tweet features into the basic factorization model through newly defined regularization terms and improve the performance by 3% - 4% in terms of F1-score. Finally, we compare the performance of machine learning and matrix factorization models for retweet prediction and find that none of the models is superior to the other in all occasions. Therefore, different models should be used depending on how prediction results will be used. Machine learning model is preferable when a model’s performance quality is important such as for tweet re-ranking and tweet recommendation. Matrix factorization is a preferred option when model’s positive retweet prediction capability is more important such as for marketing campaign and finding potential retweeters.


Data Mining ◽  
2013 ◽  
pp. 1230-1252
Author(s):  
Luca Cagliero ◽  
Alessandro Fiori

This chapter presents an overview of social network features such as user behavior, social models, and user-generated content to highlight the most notable research trends and application systems built over such appealing models and online media data. It first describes the most popular social networks by analyzing the growth trend, the user behaviors, the evolution of social groups and models, and the most relevant types of data continuously generated and updated by the users. Next, the most recent and valuable applications of data mining techniques to social network models and user-generated content are presented. Discussed works address both social model extractions tailored to semantic knowledge inference and automatic understanding of the user-generated content. Finally, prospects of data mining research on social networks are provided as well.


Author(s):  
Frédéric Adam

Network analysis, a body of research that concentrates on the social networks that connect actors in society, has been found to have many applications in areas where researchers struggle to understand the complex workings of organisations (Nohria, 1992). Social network analysis (SNA) acknowledges that individuals are characterised just as much by their relationships with one another (which is often neglected in traditional research) as by their specific attributes (Knoke & Kuklinski, 1982) and that, beyond individuals, society itself is made of networks (Kilduff & Tsai, 2003). It is the study of the relationships between actors and between clusters of actors in organisations and in society that has been labeled network analysis. These high level observations about network analysis indicate that this orientation has great potential for the study of how managers, groups of managers, and organisations make decisions, following processes that unfold over long periods of time and that are sometimes very hard to fully comprehend without reference to a network approach. This article proposes to investigate the potential application of network analysis to the study of individual and organizational decision making and to leverage its strengths for the design and development of better decision aids.


2018 ◽  
Vol 44 (6) ◽  
pp. 802-817 ◽  
Author(s):  
Carlos Rios ◽  
Silvia Schiaffino ◽  
Daniela Godoy

Location-based recommender systems (LBRSs) are gaining importance with the proliferation of location-based services provided by mobile devices as well as user-generated content in social networks. Collaborative approaches for recommendation rely on the opinions of like-minded people, so-called neighbours, for prediction. Thus, an adequate selection of such neighbours becomes essential for achieving good prediction results. The aim of this work is to explore different strategies to select neighbours in the context of a collaborative filtering–based recommender system for POI (places of interest) recommendations. Whereas standard methods are based on user similarity to delimit a neighbourhood, in this work several strategies are proposed based on direct social relationships and geographical information extracted from location-based social networks (LBSNs). The impact of the different strategies proposed has been evaluated and compared against the traditional collaborative filtering approach using a dataset from a popular network as Foursquare. In general terms, the proposed strategies for selecting neighbours based on the different elements available in a LBSN achieve better results than the traditional collaborative filtering approach. Our findings can be helpful both to researchers in the recommender systems area and to recommender system developers in the context of LBSNs, since they can take into account our results to design and provide more effective services considering the huge amount of knowledge produced in LBSNs.


Author(s):  
Dalia Sulieman ◽  
Maria Malek ◽  
Hubert Kadima ◽  
Dominique Laurent

In this article, the authors consider the basic problem of recommender systems that is identifying a set of users to whom a given item is to be recommended. In practice recommender systems are run against huge sets of users, and the problem is then to avoid scanning the whole user set in order to produce the recommendation list. To cope with problem, they consider that users are connected through a social network and that taxonomy over the items has been defined. These two kinds of information are respectively called social and semantic information. In their contribution the authors suggest combining social information with semantic information in one algorithm in order to compute recommendation lists by visiting a limited part of the social network. In their experiments, the authors use two real data sets, namely Amazon.com and MovieLens, and they compare their algorithms with the standard item-based collaborative filtering and hybrid recommendation algorithms. The results show satisfying accuracy values and a very significant improvement of performance, by exploring a small part of the graph instead of exploring the whole graph.


2014 ◽  
Vol 543-547 ◽  
pp. 1856-1859
Author(s):  
Xiang Cui ◽  
Gui Sheng Yin

Recommender systems have been proven to be valuable means for Web online users to cope with the information overload and have become one of the most powerful and popular tools in electronic commerce. We need a method to solve such as what items to buy, what music to listen, or what news to read. The diversification of user interests and untruthfulness of rating data are the important problems of recommendation. In this article, we propose to use two phase recommendation based on user interest and trust ratings that have been given by actors to items. In the paper, we deal with the uncertain user interests by clustering firstly. In the algorithm, we compute the between-class entropy of any two clusters and get the stable classes. Secondly, we construct trust based social networks, and work out the trust scoring, in the class. At last, we provide some evaluation of the algorithms and propose the more improve ideas in the future.


Sign in / Sign up

Export Citation Format

Share Document