Research on Recommendation Algorithm in Social Networks

2014 ◽  
Vol 496-500 ◽  
pp. 1865-1868
Author(s):  
Hu Xin Tang ◽  
Xu Qian
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Recommender System ◽  
Recommendation System ◽  
Simulation Experiment ◽  
Recommendation Algorithm ◽  
Simulation Experiments ◽  
Correlation Algorithm ◽  
Rapid Calculation ◽  
Relative Attractiveness

Research status and development of the recommendation system are studied, the focus of evaluation of recommender system and recommender system based on social network in two aspects, and puts forward some improved algorithm, and achieved certain results. KDD Cup 2012 Track data for the simulation experiments on the correlation algorithm based on search engine, has been shown in different positions on the relative attractiveness of advertising, numerical user. At the same time, rapid calculation of the degree of correlation between a user and other users of an algorithm is given, and then quickly given the recommendation results. KDD Cup 2012 Track data for the simulation experiment of the algorithm, and the analysis result is given.

Identifying Attack Models for Securing Cluster-Based Recommendation System

2020 ◽  
Vol 14 ◽  
Author(s):  
Amreen Ahmad ◽  
Tanvir Ahmad ◽  
Ishita Tripathi
Keyword(s):  
Collaborative Filtering ◽  
Recommender System ◽  
Recommendation System ◽  
Relevant Information ◽  
System Function ◽  
Recommendation Algorithm ◽  
Underlying Network ◽  
Entire Dataset ◽  
Attack Models ◽  
Wide Usage

: The immense growth of information has led to the wide usage of recommender systems for retrieving relevant information. One of the widely used methods for recommendation is collaborative filtering. However, such methods suffer from two problems, scalability and sparsity. In the proposed research, the two issues of collaborative filtering are addressed and a cluster-based recommender system is proposed. For the identification of potential clusters from the underlying network, Shapley value concept is used, which divides users into different clusters. After that, the recommendation algorithm is performed in every respective cluster. The proposed system recommends an item to a specific user based on the ratings of the item’s different attributes. Thus, it reduces the running time of the overall algorithm, since it avoids the overhead of computation involved when the algorithm is executed over the entire dataset. Besides, the security of the recommender system is one of the major concerns nowadays. Attackers can come in the form of ordinary users and introduce bias in the system to force the system function that is advantageous for them. In this paper, we identify different attack models that could hamper the security of the proposed cluster-based recommender system. The efficiency of the proposed research is validated by conducting experiments on student dataset.

scholarly journals Application of Improved Recommendation System Based on Spark Platform in Big Data Analysis

2016 ◽  
Vol 16 (6) ◽  
pp. 245-255 ◽  
Author(s):  
Li Xie ◽  
Wenbo Zhou ◽  
Yaosen Li
Keyword(s):  
Big Data ◽  
Recommender System ◽  
Recommendation System ◽  
Parallel Implementation ◽  
Implementation Process ◽  
Recommendation Algorithm ◽  
Filtration Problem ◽  
Information Filtration ◽  
Similarity Information ◽  
Better Than

Abstract In the era of big data, people have to face information filtration problem. For those cases when users do not or cannot express their demands clearly, recommender system can analyse user’s information more proactive and intelligent to filter out something users want. This property makes recommender system play a very important role in the field of e-commerce, social network and so on. The collaborative filtering recommendation algorithm based on Alternating Least Squares (ALS) is one of common algorithms using matrix factorization technique of recommendation system. In this paper, we design the parallel implementation process of the recommendation algorithm based on Spark platform and the related technology research of recommendation systems. Because of the shortcomings of the recommendation algorithm based on ALS model, a new loss function is designed. Before the model is trained, the similarity information of users and items is fused. The experimental results show that the performance of the proposed algorithm is better than that of algorithm based on ALS.

A New Contextual Influencer User Measure to Improve the Accuracy of Recommender System

2018 ◽  
Vol 9 (4) ◽  
pp. 38-51
Author(s):  
Maryam Jallouli ◽  
Sonia Lajmi ◽  
Ikram Amous
Keyword(s):  
Social Network ◽  
Recommender System ◽  
Recommendation System ◽  
Mean Absolute Error ◽  
Absolute Error ◽  
User Model ◽  
Context Aware ◽  
Additional Information ◽  
Context Element ◽  
Cold Start Problem

In the last decade, social-based recommender systems have become the best way to resolve a user's cold start problem. In fact, it enriches the user's model by adding additional information provided from his social network. Most of those approaches are based on a collaborative filtering and compute similarities between the users. The authors' preliminary objective in this work is to propose an innovative context aware metric between users (called contextual influencer user). These new similarities are called C-COS, C-PCC and C-MSD, where C refers to the category. The contextual influencer user model is integrated into a social based recommendation system. The category of the items is considered as the most pertinent context element. The authors' proposal is implemented and tested within the food dataset. The experimentation proved that the contextual influencer user measure achieves 0.873, 0.874, and 0.882 in terms of Mean Absolute Error (MAE) corresponding to C-cos, C-pcc and C-msd, respectively. The experimental results showed that their model outperforms several existing methods.

scholarly journals Dynamical Modeling, Analysis, and Control of Information Diffusion over Social Networks: A Deep Learning-Based Recommendation Algorithm in Social Network

2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Kefei Cheng ◽  
Xiaoyong Guo ◽  
Xiaotong Cui ◽  
Fengchi Shan
Keyword(s):  
Social Networks ◽  
Deep Learning ◽  
Social Network ◽  
Information Diffusion ◽  
Recommendation Algorithm ◽  
Central Sequence ◽  
Modeling Analysis ◽  
News Recommendation ◽  
Browsing Behavior ◽  
And Control

The recommendation algorithm can break the restriction of the topological structure of social networks, enhance the communication power of information (positive or negative) on social networks, and guide the information transmission way of the news in social networks to a certain extent. In order to solve the problem of data sparsity in news recommendation for social networks, this paper proposes a deep learning-based recommendation algorithm in social network (DLRASN). First, the algorithm is used to process behavioral data in a serializable way when users in the same social network browse information. Then, global variables are introduced to optimize the encoding way of the central sequence of Skip-gram, in which way online users’ browsing behavior habits can be learned. Finally, the information that the target users’ have interests in can be calculated by the similarity formula and the information is recommended in social networks. Experimental results show that the proposed algorithm can improve the recommendation accuracy.

scholarly journals Differentially Private Recommendation System Based on Community Detection in Social Network Applications

2018 ◽  
Vol 2018 ◽  
pp. 1-18 ◽  
Author(s):  
Gesu Li ◽  
Zhipeng Cai ◽  
Guisheng Yin ◽  
Zaobo He ◽  
Madhuri Siddula
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Community Detection ◽  
Recommendation System ◽  
Detection Method ◽  
Personal Information ◽  
The Internet ◽  
Sensitive Information ◽  
Network Applications ◽  
Target Attributes

The recommender system is mainly used in the e-commerce platform. With the development of the Internet, social networks and e-commerce networks have broken each other’s boundaries. Users also post information about their favorite movies or books on social networks. With the enhancement of people’s privacy awareness, the personal information of many users released publicly is limited. In the absence of items rating and knowing some user information, we propose a novel recommendation method. This method provides a list of recommendations for target attributes based on community detection and known user attributes and links. Considering the recommendation list and published user information that may be exploited by the attacker to infer other sensitive information of users and threaten users’ privacy, we propose the CDAI (Infer Attributes based on Community Detection) method, which finds a balance between utility and privacy and provides users with safer recommendations.

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

2015 ◽  
Vol 3 ◽  
pp. 27 ◽  
Author(s):  
Bahareh Shadi Shams Zamenjani
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Recommender Systems ◽  
Recommender System ◽  
User Behavior ◽  
Real Data ◽  
User Interests ◽  
Second Stage ◽  
Commercial Use ◽  
High Level

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.

scholarly journals Matrix Factorization Recommendation Algorithm Based on Multiple Social Relationships

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Sheng Bin ◽  
Gengxin Sun
Keyword(s):  
Social Networks ◽  
Recommender Systems ◽  
Social Relationships ◽  
Matrix Factorization ◽  
Social Relationship ◽  
Recommendation System ◽  
Social Recommendation ◽  
Recommendation Algorithm ◽  
Recommendation Algorithms

With the widespread use of social networks, social recommendation algorithms that add social relationships between users to recommender systems have been widely applied. Existing social recommendation algorithms only introduced one type of social relationship to the recommendation system, but in reality, there are often multiple social relationships among users. In this paper, a new matrix factorization recommendation algorithm combined with multiple social relationships is proposed. Through experiment results analysis on the Epinions dataset, the proposed matrix factorization recommendation algorithm has a significant improvement over the traditional and matrix factorization recommendation algorithms that integrate a single social relationship.

REPERIO

2013 ◽  
pp. 63-83
Author(s):  
Frank Meyer ◽  
Damien Poirier ◽  
Isabelle Tellier ◽  
Françoise Fessant
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Web Service ◽  
Mobile Device ◽  
Recommender System ◽  
Data Sources ◽  
Sources Of Information ◽  
External Sources ◽  
Industrial Context ◽  
Item Item

In this chapter, the authors describe Reperio, a flexible and generic industrial recommender system able to deal with several kinds of data sources (content-based, collaborative, social network) in the same framework and to work on multi-platforms (Web service in a multi-user mode and mobile device in a mono-user mode). The item-item matrix is the keystone of the architecture for its efficiency and flexibility properties. In the first part, the authors present core functionalities and requirements of recommendation in an industrial context. In the second part, they present the architecture of the system and the main issues involved in its development. In the last part, the authors report experimental results obtained using Reperio on benchmarks extracted from the Netflix Prize with different filtering strategies. To illustrate the interest and flexibility of the architecture, they also explain how it is possible to take into account, for recommendations, external sources of information. In particular, the authors show how to exploit user generated contents posted on social networks to fill the item-item matrix. The process proposed includes a step of opinion classification.

scholarly journals Distributed recommender system using multi-agent for social networks

2021 ◽  
Author(s):  
Lubaid Ahmed
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Recommender Systems ◽  
Recommender System ◽  
Network Simulator ◽  
Clustering Methods ◽  
Agent Based Simulation ◽  
Agent Based ◽  
Data Mining Algorithms ◽  
Multi Agent

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.

scholarly journals Distributed recommender system using multi-agent for social networks

2021 ◽  
Author(s):  
Lubaid Ahmed
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Recommender Systems ◽  
Recommender System ◽  
Network Simulator ◽  
Clustering Methods ◽  
Agent Based Simulation ◽  
Agent Based ◽  
Data Mining Algorithms ◽  
Multi Agent

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.

Sign in / Sign up

Export Citation Format

Share Document