- Tytuł:
- Strict Maximum Separability of Two Finite Sets: An Algorithmic Approach
- Autorzy:
- Cendrowska, D.
- Powiązania:
- https://bibliotekanauki.pl/articles/908540.pdf
- Data publikacji:
- 2005
- Wydawca:
- Uniwersytet Zielonogórski. Oficyna Wydawnicza
- Tematy:
-
klasyfikator binarny
metoda rekurencyjna
rozdzielność optymalna
binary classifiers
recursive methods
optimal separability - Opis:
- 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.
- Źródło:
-
International Journal of Applied Mathematics and Computer Science; 2005, 15, 2; 295-304
1641-876X
2083-8492 - Pojawia się w:
- International Journal of Applied Mathematics and Computer Science
- Dostawca treści:
- Biblioteka Nauki
Artykuł