Home
This Title All WIREs
WIREs RSS Feed
How to cite this WIREs title:
WIREs Data Mining Knowl Discov
Impact Factor: 2.541

A survey of game theoretic approach for adversarial machine learning

Full article on Wiley Online Library:   HTML PDF

Can't access this content? Tell your librarian.

The field of machine learning is progressing at a faster pace than ever before. Many organizations leverage machine learning tools to extract useful information from a massive amount of data. In particular, machine learning finds its application in cybersecurity that begins to enter the age of automation. However, machine learning applications in cybersecurity face unique challenges other domains rarely do—attacks from active adversaries. Problems in areas such as intrusion detection, banking fraud detection, spam filtering, and malware detection have to face  challenges of adversarial attacks that modify data so that malicious instances would evade detection by the learning systems. The adversarial learning problem naturally resembles a game between the learning system and the adversary. In such a game, both players would attempt to play their best strategies against each other while maximizing their own payoffs. To solve the game, each player would search for an optimal strategy against the opponent based on the prediction of the opponent's strategy choice. The problem becomes even more complicated in settings where the learning system may have to deal with many adversaries of unknown types. Applying game‐theoretic approach, robust learning techniques have been developed to specifically address adversarial attacks and the preliminary results are promising. In this review, we summarize these results. This article is categorized under: Technologies > Machine Learning Fundamental Concepts of Data and Knowledge > Key Design Issues in Data Mining
Adversarial attacks against a linear classifier on a two‐dimensional dataset. The red squares represent malicious samples and the green dots are benign samples. The green squares are malicious samples modified by the adversary. The middle line is the decision boundary of the linear classifier
[ Normal View | Magnified View ]
Standard support vector machine versus conservative support vector machine
[ Normal View | Magnified View ]

Browse by Topic

Technologies > Machine Learning
Fundamental Concepts of Data and Knowledge > Key Design Issues in Data Mining

Access to this WIREs title is by subscription only.

Recommend to Your
Librarian Now!

The latest WIREs articles in your inbox

Sign Up for Article Alerts