Belief-based chaotic algorithm for support vector data description

Javad Hamidzadeh

doi:10.1007/s00500-018-3083-3

2018-02-20

PRE

Javad Hamidzadeh *

DOI：10.1007/s00500-018-3083-3

原文链接

原文求助

摘要

En 中文

One of the efficient tools to handle segregation of imbalanced data is support vector data description (SVDD). In contrast to support vector machine (SVM), enclosing target data in a hyper-sphere by SVDD leads to avoid biasing toward major data. SVDD can gain the best description of data when its free parameters are set to proper values. In this paper, we propose belief-based chaotic krill herd algorithm for SVDD (BCKH-SVDD) with the aim of designing effective description of data. First, we introduce a new SVDD based on belief function theory, and then, we tune the free parameters by chaotic krill herd algorithm. Belief function theory is one of the best methods to enhance decision making for uncertain data. By adding a new belief-based weight, we can decide better about the data around the SVDD boundary and the classification will be more precise. Chaotic krill herd optimization algorithm introduces chaotic maps in the krill herd algorithm. With the help of chaotic maps, the two issues, namely local optima avoidance and convergence speed, can be overcome. Thus, chaotic krill herd algorithm is constructed based on chaotic functions and automatic switching between global and local searches of krill herd. To present the power of BCKH-SVDD, several experiments have been conducted based on tenfold cross-validation over real-world data sets from UCI repository. Experimental results show the superiority of the proposed algorithm to state-of-the-art methods in terms of classification accuracy, precision and recall measures.

Keyword:

One-class classification

Support vector data description

Belief function theory

Outlier detection

Belief-based chaotic algorithm for SVDD