Density-induced support vector data description

Citations

WEB OF SCIENCE

82
Citations

SCOPUS

112

초록

The purpose of data description is to give a compact description of the target data that represents most of its characteristics. In a support vector data description (SVDD), the compact description of target data is given in a hyperspherical model, which is determined by a small portion of data called support vectors. Despite the usefulness of the conventional SVDD, however, it may not identify the optimal solution of target description especially when the support vectors do not have the overall characteristics of the target data. To address the issue in SVDD methodology, we propose a new SVDD by introducing new distance measurements based on the notion of a relative density degree for each data point in order to reflect the distribution of a given data set. Moreover, for a real application, we extend the proposed method for the protein localization prediction problem which is a multiclass and multilabel problem. Experiments with various real data sets show promising results.

키워드

data domain description; density-induced support vector data description (D-SVDD); one-class classification; outlier detection; support vector data description (SVDD); PROTEIN LOCALIZATION; BUDDING YEAST; CLASSIFICATION; MACHINES; PREDICTION
제목
Density-induced support vector data description
저자
Lee, KiYoung; Kim, Dae-Won; Lee, Kwang H.; Lee, Doheon
DOI
10.1109/TNN.2006.884673
발행일
2007-01
유형
Article
저널명
IEEE Transactions on Neural Networks
권
18
호
1
페이지
284 ~ 289