Community Detection for Cold Start Problem in Personalization: Community Detection is Large Social Network Graphs Based on Users’ Structural Similarities and Their Attribute Similarities

2016 ◽  
Author(s):  
Ankush Bhatia
Keyword(s):  
Social Network ◽  
Community Detection ◽  
Cold Start ◽  
Cold Start Problem

scholarly journals Dealing with Pure New User Cold-Start Problem in Recommendation System Based on Linked Open Data and Social Network Features

2020 ◽  
Vol 2020 ◽  
pp. 1-20
Author(s):  
Usha Yadav ◽  
Neelam Duhan ◽  
Komal Kumar Bhatia
Keyword(s):  
Social Network ◽  
Recommendation System ◽  
Research Work ◽  
Recommendation Systems ◽  
Open Data ◽  
Computation Time ◽  
Cold Start ◽  
Linked Open Data ◽  
Hybrid Recommendation ◽  
Cold Start Problem

Preferring accuracy over computation time or vice versa is very challenging in the context of recommendation systems, which encourages many researchers to opt for hybrid recommendation systems. Currently, researchers are trying hard to produce correct and accurate recommendations by suggesting the use of ontology, but the lack of techniques renders to take its full advantage. One of the major issues in recommender systems bothering many researchers is pure new user cold-start problem which arises due to the absence of information in the system about the new user. Linked Open Data (LOD) initiative sets standards for interoperability among cross domains and has gathered enormous amount of data over the past years, which provides various ways by which recommender system’s performance can be improved by enriching user’s profile with relevant features. This research work focuses on solving pure new user cold-start problem by building user’s profile based on LOD, collaborative features, and social network-based features. Here, a new approach is devised to compute item similarity based on ontology, thus predicting the rating of nonrated item. A modified method to calculate user’s similarity based on collaborative features to deal with other issues such as accuracy and computation time is also proposed. The empirical results and comparative analysis of the proposed hybrid recommendation system dictate its better performance specifically for providing solution to pure new user cold-start problem.

P2PCF: A collaborative filtering based recommender system for peer to peer social networks

2021 ◽  
pp. 1-19
Author(s):  
Lyes Badis ◽  
Mourad Amad ◽  
Djamil Aïssani ◽  
Sofiane Abbar
Keyword(s):  
Social Networks ◽  
Information Retrieval ◽  
Social Network ◽  
Collaborative Filtering ◽  
Recommender System ◽  
Cold Start ◽  
Peer To Peer ◽  
Public Concerns ◽  
Cold Start Problem ◽  
Filtering Approach

The recent privacy incidents reported in major media about global social networks raised real public concerns about centralized architectures. P2P social networks constitute an interesting paradigm to give back users control over their data and relations. While basic social network functionalities such as commenting, following, sharing, and publishing content are widely available, more advanced features related to information retrieval and recommendation are still challenging. This is due to the absence of a central server that has a complete view of the network. In this paper, we propose a new recommender system called P2PCF. We use collaborative filtering approach to recommend content in P2P social networks. P2PCF enables privacy preserving and tackles the cold start problem for both users and content. Our proposed approach assumes that the rating matrix is distributed within peers, in such a way that each peer only sees interactions made by her friends on her timeline. Recommendations are then computed locally within each peer before they are sent back to the requester. Our evaluations prove the effectiveness of our proposal compared to a centralized scheme in terms of recall and coverage.

scholarly journals EXPRESS: Overcoming the Cold Start Problem of CRM using a Probabilistic Machine Learning Approach

2021 ◽  
pp. 002224372110329
Author(s):  
Nicolas Padilla ◽  
Eva Ascarza
Keyword(s):  
Machine Learning ◽  
Cold Start ◽  
Customer Relationship ◽  
Exponential Families ◽  
Modeling Framework ◽  
Wide Range ◽  
The Moment ◽  
Probabilistic Machine Learning ◽  
Marketing Actions ◽  
Cold Start Problem

The success of Customer Relationship Management (CRM) programs ultimately depends on the firm's ability to identify and leverage differences across customers — a very diffcult task when firms attempt to manage new customers, for whom only the first purchase has been observed. For those customers, the lack of repeated observations poses a structural challenge to inferring unobserved differences across them. This is what we call the “cold start” problem of CRM, whereby companies have difficulties leveraging existing data when they attempt to make inferences about customers at the beginning of their relationship. We propose a solution to the cold start problem by developing a probabilistic machine learning modeling framework that leverages the information collected at the moment of acquisition. The main aspect of the model is that it exibly captures latent dimensions that govern the behaviors observed at acquisition as well as future propensities to buy and to respond to marketing actions using deep exponential families. The model can be integrated with a variety of demand specifications and is exible enough to capture a wide range of heterogeneity structures. We validate our approach in a retail context and empirically demonstrate the model's ability at identifying high-value customers as well as those most sensitive to marketing actions, right after their first purchase.

Sign in / Sign up

Export Citation Format

Share Document