A New Privacy-Preserving Data Mining Method Using Non-negative Matrix Factorization and Singular Value Decomposition

2018 ◽  
Vol 102 (2) ◽  
pp. 1799-1808 ◽  
Author(s):  
Guang Li ◽  
Rui Xue
Keyword(s):  
Data Mining ◽  
Singular Value Decomposition ◽  
Matrix Factorization ◽  
Privacy Preserving ◽  
Singular Value ◽  
Mining Method ◽  
Privacy Preserving Data Mining ◽  
Data Mining Method ◽  
Value Decomposition ◽  
Non Negative Matrix Factorization

A Perturbation Method Based on Singular Value Decomposition and Feature Selection for Privacy Preserving Data Mining

2014 ◽  
Vol 10 (1) ◽  
pp. 55-76 ◽  
Author(s):  
Mohammad Reza Keyvanpour ◽  
Somayyeh Seifi Moradi
Keyword(s):  
Data Mining ◽  
Feature Selection ◽  
Singular Value Decomposition ◽  
Perturbation Method ◽  
Privacy Preserving ◽  
Singular Value ◽  
Privacy Preserving Data Mining ◽  
Selection For ◽  
Value Decomposition ◽  
Different Levels

In this study, a new model is provided for customized privacy in privacy preserving data mining in which the data owners define different levels for privacy for different features. Additionally, in order to improve perturbation methods, a method combined of singular value decomposition (SVD) and feature selection methods is defined so as to benefit from the advantages of both domains. Also, to assess the amount of distortion created by the proposed perturbation method, new distortion criteria are defined in which the amount of created distortion in the process of feature selection is considered based on the value of privacy in each feature. Different tests and results analysis show that offered method based on this model compared to previous approaches, caused the improved privacy, accuracy of mining results and efficiency of privacy preserving data mining systems.

A Perturbation Method Based on Singular Value Decomposition and Feature Selection for Privacy Preserving Data Mining

2016 ◽  
pp. 281-304
Author(s):  
Mohammad Reza Keyvanpour ◽  
Somayyeh Seifi Moradi
Keyword(s):  
Data Mining ◽  
Feature Selection ◽  
Singular Value Decomposition ◽  
Perturbation Method ◽  
Privacy Preserving ◽  
Singular Value ◽  
Privacy Preserving Data Mining ◽  
New Model ◽  
Value Decomposition ◽  
Different Levels

In this study, a new model is provided for customized privacy in privacy preserving data mining in which the data owners define different levels for privacy for different features. Additionally, in order to improve perturbation methods, a method combined of singular value decomposition (SVD) and feature selection methods is defined so as to benefit from the advantages of both domains. Also, to assess the amount of distortion created by the proposed perturbation method, new distortion criteria are defined in which the amount of created distortion in the process of feature selection is considered based on the value of privacy in each feature. Different tests and results analysis show that offered method based on this model compared to previous approaches, caused the improved privacy, accuracy of mining results and efficiency of privacy preserving data mining systems.

A Perturbation Method Based on Singular Value Decomposition and Feature Selection for Privacy Preserving Data Mining

2015 ◽  
pp. 854-874
Author(s):  
Mohammad Reza Keyvanpour ◽  
Somayyeh Seifi Moradi
Keyword(s):  
Data Mining ◽  
Feature Selection ◽  
Singular Value Decomposition ◽  
Perturbation Method ◽  
Privacy Preserving ◽  
Singular Value ◽  
Privacy Preserving Data Mining ◽  
New Model ◽  
Value Decomposition ◽  
Different Levels

In this study, a new model is provided for customized privacy in privacy preserving data mining in which the data owners define different levels for privacy for different features. Additionally, in order to improve perturbation methods, a method combined of singular value decomposition (SVD) and feature selection methods is defined so as to benefit from the advantages of both domains. Also, to assess the amount of distortion created by the proposed perturbation method, new distortion criteria are defined in which the amount of created distortion in the process of feature selection is considered based on the value of privacy in each feature. Different tests and results analysis show that offered method based on this model compared to previous approaches, caused the improved privacy, accuracy of mining results and efficiency of privacy preserving data mining systems.

scholarly journals Introduction to Matrix Factorization for Recommender Systems

2021 ◽  
Author(s):  
Shalin Shah
Keyword(s):  
Singular Value Decomposition ◽  
Online Education ◽  
Recommender Systems ◽  
Matrix Factorization ◽  
Gradient Descent ◽  
Large Scale ◽  
Singular Value ◽  
Factorization Algorithms ◽  
Value Decomposition ◽  
Interaction History

Recommender systems aim to personalize the experience of user by suggesting items to the user based on the preferences of a user. The preferences are learned from the user’s interaction history or through explicit ratings that the user has given to the items. The system could be part of a retail website, an online bookstore, a movie rental service or an online education portal and so on. In this paper, I will focus on matrix factorization algorithms as applied to recommender systems and discuss the singular value decomposition, gradient descent-based matrix factorization and parallelizing matrix factorization for large scale applications.

Sign in / Sign up

Export Citation Format

Share Document