Perturbation based Fuzzified k-Mode Clustering Method for Privacy Preserving Recommender System

2022 ◽  
Vol 16 (1) ◽  
pp. 0-0
Keyword(s):  
Perturbation Method ◽  
Recommender System ◽  
Cluster Size ◽  
Perturbation Methods ◽  
Information Overload ◽  
Clustering Method ◽  
Privacy And Security ◽  
Product Selection ◽  
Clustering Approach ◽  
User Ratings

Recommender systems are extensively used today to ease out the problem of information overload and facilitate the product selection by users in e-commerce market. Both privacy and security are two major concerns of the user in these systems. For the protection of the user’s rating, there are several existing works on the basis of encryption or randomization methodologies. This paper proposes a methodology that not only protects the privacy of ratings but also provides better accuracy. After applying fuzzification on the user ratings, random rotation and perturbation methods are used before being fed to the collaborative filtering system. In this process, similar users are grouped into clusters by which recommendation is made. By considering different cluster size on four different datasets, the proposed fuzzified k-Mode clustering method provides less MAE and RMSE value as compared to other k-Means and k-Mode clustering approach and also achieves the better privacy than randomized perturbation method by obtaining IVDM value i.e. 0.67, 0.61, 0.55 and 0.7.

scholarly journals TCLUST: Trimming Approach of Robust Clustering Method

2014 ◽  
Vol 8 (4) ◽  
Author(s):  
Muhamad Alias Md. Jedi ◽  
Robiah Adnan
Keyword(s):  
Clustering Algorithm ◽  
Likelihood Function ◽  
R Package ◽  
Clustering Method ◽  
Number Of Clusters ◽  
Robust Clustering ◽  
Scatter Matrix ◽  
Group Assignment ◽  
Log Likelihood ◽  
Clustering Approach

TCLUST is a method in statistical clustering technique which is based on modification of trimmed k-means clustering algorithm. It is called “crisp” clustering approach because the observation is can be eliminated or assigned to a group. TCLUST strengthen the group assignment by putting constraint to the cluster scatter matrix. The emphasis in this paper is to restrict on the eigenvalues, λ of the scatter matrix. The idea of imposing constraints is to maximize the log-likelihood function of spurious-outlier model. A review of different robust clustering approach is presented as a comparison to TCLUST methods. This paper will discuss the nature of TCLUST algorithm and how to determine the number of cluster or group properly and measure the strength of group assignment. At the end of this paper, R-package on TCLUST implement the types of scatter restriction, making the algorithm to be more flexible for choosing the number of clusters and the trimming proportion.

scholarly journals Enhanced Hybrid Recommender System using Social Friend Network

2014 ◽  
Vol 10 (4) ◽  
pp. 2023-2031
Author(s):  
Shalmali A. Patil ◽  
Reena Pagare
Keyword(s):  
Collaborative Filtering ◽  
Social Relationships ◽  
Recommender System ◽  
Social Relationship ◽  
Information Overload ◽  
Great Success ◽  
Traditional System ◽  
Use Of Data ◽  
The Social ◽  
Hybrid Recommender

Lots of people employ recommender systems to diminish the information overload over the internet. This leads the user in a personalized manner to hit upon interesting or helpful objects in a huge space of possible options. Amongst different techniques, Collaborative filtering recommender system has pulled off great success. But this technique pays no heed towards the social relationship of the users. This problem gave birth to the Social recommender system technology which possesses the capability to recognize users likings and preferences and their social relationships. In this paper, we present novel method where we combine collaborative filtering recommender system with social friend network to use social relationships. For this, we have made use of data related to users which provides their interests as well as their social relationship. Our method helps to find the friends with dissimilar tastes and determine the close friends amongst direct friends of targeted user which has more similar tastes. This proposed approach resulted in more precise and realistic results than traditional system.

scholarly journals Movie Recommenadation System

2021 ◽  
Vol 9 (4) ◽  
pp. 13-16
Author(s):  
Gandhali Malve ◽  
Lajree Lohar ◽  
Tanay Malviya ◽  
Shirish Sabnis
Keyword(s):  
Machine Learning ◽  
Recommender System ◽  
Recommendation System ◽  
Learning Algorithms ◽  
Recommendation Systems ◽  
Machine Learning Algorithms ◽  
The Internet ◽  
Amount Of Information ◽  
System Recommendation ◽  
User Ratings

Today the amount of information in the internet growth very rapidly and people need some instruments to find and access appropriate information. One of such tools is called recommendation system. Recommendation systems help to navigate quickly and receive necessary information. Many of us find it difficult to decide which movie to watch and so we decided to make a recommender system for us to better judge which movie we are more likely to love. In this project we are going to use Machine Learning Algorithms to recommend movies to users based on genres and user ratings. Recommendation system attempt to predict the preference or rating that a user would give to an item.

scholarly journals The Approximate Solution of Fractional Fredholm Integrodifferential Equations by Variational Iteration and Homotopy Perturbation Methods

2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
Abdelouahab Kadem ◽  
Adem Kilicman
Keyword(s):  
Approximate Solution ◽  
Perturbation Method ◽  
Iteration Method ◽  
Homotopy Perturbation Method ◽  
Perturbation Methods ◽  
Variational Iteration Method ◽  
Integrodifferential Equations ◽  
Variational Iteration ◽  
Homotopy Perturbation ◽  
Constant Coefficients

Variational iteration method and homotopy perturbation method are used to solve the fractional Fredholm integrodifferential equations with constant coefficients. The obtained results indicate that the method is efficient and also accurate.

Recommender Technologies and Emerging Applications

2019 ◽  
pp. 458-470
Author(s):  
Young Park
Keyword(s):  
Recommender Systems ◽  
Recommender System ◽  
Information Overload ◽  
Future Research ◽  
Research Topics ◽  
Emerging Trends ◽  
System Approaches ◽  
Age Of Information

This chapter presents a brief overview of the field of recommender technologies and their emerging application domains. The authors explain the current major recommender system approaches within a unifying model, discuss emerging applications of recommender systems beyond traditional e-commerce, and outline emerging trends and future research topics, along with additional readings in the area of recommender technologies and applications. They believe that personalized recommender technologies will continue to advance and be applied in a variety of traditional and emerging application domains to assist users in the age of information overload.

Toward Geospatial Collaborative Tourism Recommender Systems

2018 ◽  
pp. 212-248
Author(s):  
Zahra Bahramian ◽  
Rahim Ali Abbaspour ◽  
Christophe Claramunt
Keyword(s):  
Recommender Systems ◽  
Recommender System ◽  
World Wide ◽  
Information Overload ◽  
Spatial Information ◽  
User Profile ◽  
User Preferences ◽  
Research Issues ◽  
The World ◽  
Information Finding

Tourism activities are highly dependent on spatial information. Finding the most interesting travel destinations and attractions and planning a trip are still open research issues to GIScience research applied to the tourism domain. Nowadays, huge amounts of information are available over the world wide web that may be useful in planning a visit to destinations and attractions. However, it is often time consuming for a user to select the most interesting destinations and attractions and plan a trip according to his own preferences. Tourism recommender systems (TRSs) can be used to overcome this information overload problem and to propose items taking into account the user preferences. This chapter reviews related topics in tourism recommender systems including different tourism recommendation approaches and user profile representation methods applied in the tourism domain. The authors illustrate the potential of tourism recommender systems as applied to the tourism domain by the implementation of an illustrative geospatial collaborative recommender system using the Foursquare dataset.

EDMC: An Energy-Efficient Distributed Multi-Hop Clustering Approach for Wireless Sensor Networks

2012 ◽  
Vol 198-199 ◽  
pp. 1668-1671
Author(s):  
Zhu Guo Li ◽  
Bing Wen Wang ◽  
Li Zhu Feng
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Wireless Sensor ◽  
Clustering Method ◽  
The Past ◽  
Decrease Energy Consumption ◽  
Potential Applications ◽  
Clustering Approach

The past few years have witnessed increasing focus on the potential applications of wireless sensor networks. Sensors in these networks are expected to be remotely dispersed in large number and to operate autonomously and unattended. Clustering is a widely used technique that can enhance scalability and decrease energy consumption over sensor networks. We present an energy-efficient distributed multi-hop clustering approach for sensor networks, which combined multi-hop transmission with clustering method, aiming to balance the energy dissipation and prolong the whole network lifetime. Simulations showed that the protocol proposed worked nearly 100% more efficient compared with LEACH and HEED.

An Effective Recommender System Based on Clustering Technique for TED Talks

2020 ◽  
Vol 15 (1) ◽  
pp. 35-51 ◽  
Author(s):  
Faiz Maazouzi ◽  
Hafed Zarzour ◽  
Yaser Jararweh
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
Recommender System ◽  
Information Overload ◽  
State Of The Art ◽  
Pearson Correlation ◽  
Enormous Amount ◽  
Powerful Mechanism ◽  
Ted Talks

With the enormous amount of information circulating on the Web, it is becoming increasingly difficult to find the necessary and useful information quickly and efficiently. However, with the emergence of recommender systems in the 1990s, reducing information overload became easy. In the last few years, many recommender systems employ the collaborative filtering technology, which has been proven to be one of the most successful techniques in recommender systems. Nowadays, the latest generation of collaborative filtering methods still requires further improvements to make the recommendations more efficient and accurate. Therefore, the objective of this article is to propose a new effective recommender system for TED talks that first groups users according to their preferences, and then provides a powerful mechanism to improve the quality of recommendations for users. In this context, the authors used the Pearson Correlation Coefficient (PCC) method and TED talks to create the TED user-user matrix. Then, they used the k-means clustering method to group the same users in clusters and create a predictive model. Finally, they used this model to make relevant recommendations to other users. The experimental results on real dataset show that their approach significantly outperforms the state-of-the-art methods in terms of RMSE, precision, recall, and F1 scores.

Sign in / Sign up

Export Citation Format

Share Document