Scribd
Upload
36 views1 page

A Bi-Objective Hyper Heuristic SVM For Bigdata Cyber Security

This document is the abstract of a paper that proposes a novel hyper-heuristic framework for optimizing support vector machine (SVM) configurations for big data cyber security problems. The framework uses a bi-objective optimization approach to consider both accuracy and model complexity when searching for effective SVM configurations. It consists of high-level strategies and low-level heuristics to explore the search space. The framework integrates decomposition and Pareto-based approaches to approximate the optimal SVM configurations. It was evaluated on malware classification and intrusion detection problems and was shown to be effective compared to other algorithms.

Uploaded by

Bindhu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
36 views1 page

A Bi-Objective Hyper Heuristic SVM For Bigdata Cyber Security

This document is the abstract of a paper that proposes a novel hyper-heuristic framework for optimizing support vector machine (SVM) configurations for big data cyber security problems. The framework uses a bi-objective optimization approach to consider both accuracy and model complexity when searching for effective SVM configurations. It consists of high-level strategies and low-level heuristics to explore the search space. The framework integrates decomposition and Pareto-based approaches to approximate the optimal SVM configurations. It was evaluated on malware classification and intrusion detection problems and was shown to be effective compared to other algorithms.

Uploaded by

Bindhu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

A BI-OBJECTIVE HYPER HEURISTIC SVM FOR BIGDATA

CYBER SECURITY
Bindu B
V1 sem MCA, Department of Master Of Computer Science,
Sir M Visvesvaraya Institute of Technology, Bangalore, India

ABSTRACT

Cyber security in the context of big data is known to be a critical problem and presents a
great challenge to the research community. Machine learning algorithms have been suggested as
candidates for handling big data security problems. Among these algorithms, support vector
machines (SVMs) have achieved remarkable success on various classification problems. However,
to establish an effective SVM, the user needs to dene the proper SVM configuration in advance,
which is a challenging task that requires expert knowledge and a large amount of manual effort for
trial and error. In this paper, we formulate the SVM configuration process as a bi-objective
optimization problem in which accuracy and model complexity are considered as two conflicting
objectives. We propose a novel hyper-heuristic framework for bi-objective optimization that is
independent of the problem domain. This is the first time that a hyper-heuristic has been developed
for this problem. The proposed hyper-heuristic framework consists of a high-level strategy and
low-level heuristics. The high-level strategy uses the search performance to control the selection
of which low-level heuristic should be used to generate a new SVM configuration. The low-level
heuristics each use different rules to effectively explore the SVM configuration search space. To
address bi-objective optimization, the proposed framework adaptively integrates the strengths of
decomposition- and Pareto-based approaches to approximate the Pareto set of SVM
configurations. The effectiveness of the proposed framework has been evaluated on two cyber
security problems: Microsoft malware big data classification and anomaly intrusion detection. The
obtained results demonstrate that the proposed framework is very effective, if not superior,
compared with its counterparts and other algorithms.
Keywords: support vector machine, hyper-heuristic approach.

You might also like