A near linear algorithm for testing linear separability in two dimensions

Sylvain Contassot-Vivier 1, * David Elizondo 2
* Auteur correspondant
1 ALGORILLE - Algorithms for the Grid
Inria Nancy - Grand Est, LORIA - NSS - Department of Networks, Systems and Services
Abstract : We present a near linear algorithm for determining the linear separability of two sets of points in a two-dimensional space. That algorithm does not only detects the linear separability but also computes separation information. When the sets are linearly separable, the algorithm provides a description of a separation hyperplane. For non linearly separable cases, the algorithm indicates a negative answer and provides a hyperplane of partial separation that could be useful in the building of some classification systems.
Type de document :
Communication dans un congrès
EANN 2012 - 13th International Conference on Engineering Applications of Neural Networks, Sep 2012, London, United Kingdom. 2012
Liste complète des métadonnées

https://hal.inria.fr/hal-00726624
Contributeur : Sylvain Contassot-Vivier <>
Soumis le : jeudi 30 août 2012 - 18:53:29
Dernière modification le : jeudi 11 janvier 2018 - 06:25:23

Identifiants

  • HAL Id : hal-00726624, version 1

Collections

Citation

Sylvain Contassot-Vivier, David Elizondo. A near linear algorithm for testing linear separability in two dimensions. EANN 2012 - 13th International Conference on Engineering Applications of Neural Networks, Sep 2012, London, United Kingdom. 2012. 〈hal-00726624〉

Partager

Métriques

Consultations de la notice

381