Data Poisoning Attacks on Linked Data with Graph Regularization

abstract: Social media has become the norm of everyone for communication. The usage of social media has increased exponentially in the last decade. The myriads of Social media services such as Facebook, Twitter, Snapchat, and Instagram etc allow people to connect with their friends, and followers fr...

Full description

Bibliographic Details
Other Authors: Magham, Venkatesh (Author)
Format: Dissertation
Language:English
Published: 2019
Subjects:
Online Access:http://hdl.handle.net/2286/R.I.53572
id ndltd-asu.edu-item-53572
record_format oai_dc
spelling ndltd-asu.edu-item-535722019-05-16T03:01:25Z Data Poisoning Attacks on Linked Data with Graph Regularization abstract: Social media has become the norm of everyone for communication. The usage of social media has increased exponentially in the last decade. The myriads of Social media services such as Facebook, Twitter, Snapchat, and Instagram etc allow people to connect with their friends, and followers freely. The attackers who try to take advantage of this situation has also increased at an exponential rate. Every social media service has its own recommender systems and user profiling algorithms. These algorithms use users current information to make different recommendations. Often the data that is formed from social media services is Linked data as each item/user is usually linked with other users/items. Recommender systems due to their ubiquitous and prominent nature are prone to several forms of attacks. One of the major form of attacks is poisoning the training set data. As recommender systems use current user/item information as the training set to make recommendations, the attacker tries to modify the training set in such a way that the recommender system would benefit the attacker or give incorrect recommendations and hence failing in its basic functionality. Most existing training set attack algorithms work with ``flat" attribute-value data which is typically assumed to be independent and identically distributed (i.i.d.). However, the i.i.d. assumption does not hold for social media data since it is inherently linked as described above. Usage of user-similarity with Graph Regularizer in morphing the training data produces best results to attacker. This thesis proves the same by demonstrating with experiments on Collaborative Filtering with multiple datasets. Dissertation/Thesis Magham, Venkatesh (Author) Liu, Huan (Advisor) Wu, Liang (Committee member) Amor, Hani Ben (Committee member) Arizona State University (Publisher) Computer science Information science Collaborative filtering Data poisoning attacks Graph laplacian Graph regularization Linked data Matrix factorization eng 41 pages Masters Thesis Computer Science 2019 Masters Thesis http://hdl.handle.net/2286/R.I.53572 http://rightsstatements.org/vocab/InC/1.0/ 2019
collection NDLTD
language English
format Dissertation
sources NDLTD
topic Computer science
Information science
Collaborative filtering
Data poisoning attacks
Graph laplacian
Graph regularization
Linked data
Matrix factorization
spellingShingle Computer science
Information science
Collaborative filtering
Data poisoning attacks
Graph laplacian
Graph regularization
Linked data
Matrix factorization
Data Poisoning Attacks on Linked Data with Graph Regularization
description abstract: Social media has become the norm of everyone for communication. The usage of social media has increased exponentially in the last decade. The myriads of Social media services such as Facebook, Twitter, Snapchat, and Instagram etc allow people to connect with their friends, and followers freely. The attackers who try to take advantage of this situation has also increased at an exponential rate. Every social media service has its own recommender systems and user profiling algorithms. These algorithms use users current information to make different recommendations. Often the data that is formed from social media services is Linked data as each item/user is usually linked with other users/items. Recommender systems due to their ubiquitous and prominent nature are prone to several forms of attacks. One of the major form of attacks is poisoning the training set data. As recommender systems use current user/item information as the training set to make recommendations, the attacker tries to modify the training set in such a way that the recommender system would benefit the attacker or give incorrect recommendations and hence failing in its basic functionality. Most existing training set attack algorithms work with ``flat" attribute-value data which is typically assumed to be independent and identically distributed (i.i.d.). However, the i.i.d. assumption does not hold for social media data since it is inherently linked as described above. Usage of user-similarity with Graph Regularizer in morphing the training data produces best results to attacker. This thesis proves the same by demonstrating with experiments on Collaborative Filtering with multiple datasets. === Dissertation/Thesis === Masters Thesis Computer Science 2019
author2 Magham, Venkatesh (Author)
author_facet Magham, Venkatesh (Author)
title Data Poisoning Attacks on Linked Data with Graph Regularization
title_short Data Poisoning Attacks on Linked Data with Graph Regularization
title_full Data Poisoning Attacks on Linked Data with Graph Regularization
title_fullStr Data Poisoning Attacks on Linked Data with Graph Regularization
title_full_unstemmed Data Poisoning Attacks on Linked Data with Graph Regularization
title_sort data poisoning attacks on linked data with graph regularization
publishDate 2019
url http://hdl.handle.net/2286/R.I.53572
_version_ 1719183404380979200