The Kernelized Geometrical Bisection Methods

Xiaomao Liu, Shujuan Cao, Junbin Gao, Jun Zhang

    Research output: Contribution to journalArticlepeer-review

    15 Downloads (Pure)

    Abstract

    In this paper, we developed two new classifiers: the kernelized geometrical bisection method and its extended version. The derivation of our methods is based on the so-called 'kernel trick' in which samples in the input space are mapped onto almost linearly separable data in a high-dimensional feature space associated with a kernel function. A linear hyperplane can be constructed through bisecting the line connecting the nearest points between two convex hulls created by mapped samples in the feature space. Computational experiments show that the proposed algorithms are more competitive and effective than the well-known conventional methods.
    Original languageEnglish
    Pages (from-to)680-688
    Number of pages9
    JournalLecture Notes in Computer Science
    Volume4492
    Issue number2007
    DOIs
    Publication statusPublished - 2007

    Fingerprint

    Dive into the research topics of 'The Kernelized Geometrical Bisection Methods'. Together they form a unique fingerprint.

    Cite this