Creator:

Cendrowska, Dorota

Contributor:

Korbicz, Józef (1951- ) - red. ; Uciński, Dariusz - red.

Title:

Strict maximum separability of two finite sets: An algorithmic approach

Group publication title:

AMCS, Volume 15 (2005)

Subject and Keywords:

binary classifiers ; recursive methods ; optimal separability

Abstract:

The paper presents a recursive algorithm for the investigation of a strict, linear separation in the Euclidean space. In the case when sets are linearly separable, it allows us to determine the coefficients of the hyperplanes. An example of using this algorithm as well as its drawbacks are shown. Then the algorithm of determining an optimal separation (in the sense of maximizing the distance between the two sets) is presented.

Publisher:

Zielona Góra: Uniwersytet Zielonogórski

Date:

2005

Resource Type:

artykuł

Pages:

295-304

Source:

AMCS, volume 15, number 2 (2005) ; click here to follow the link

Language:

eng

License CC BY 4.0:

click here to follow the link

Rights:

Biblioteka Uniwersytetu Zielonogórskiego