본문 바로가기
  • Home

Context Dependent Fusion with Support Vector Machines

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2013, 18(7), pp.37-45
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Gyeongyong Heo 1

1동의대학교

Accredited

ABSTRACT

Context dependent fusion (CDF) is a fusion algorithm that combines multiple outputs from different classifiers to achieve better performance. CDF tries to divide the problem context into several homogeneous sub-contexts and to fuse data locally with respect to each sub-context. CDF showed better performance than existing methods, however, it is sensitive to noise due to the large number of parameters optimized and the innate linearity limits the application of CDF. In this paper, a variant of CDF using support vector machines (SVMs) for fusion and kernel principal component analysis (K-PCA) for context extraction is proposed to solve the problems in CDF, named CDF-SVM. Kernel PCA can shape irregular clusters including elliptical ones through the non-linear kernel transformation and SVM can draw a non-linear decision boundary. Regularization terms is also included in the objective function of CDF-SVM to mitigate the noise sensitivity in CDF. CDF-SVM showed better performance than CDF and its variants, which is demonstrated through the experiments with a landmine data set.

Citation status

* References for papers published after 2023 are currently being built.