A deterministic biologically plausible classifier - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2002

A deterministic biologically plausible classifier


Considering the «data classification» problem it is known that efficient classifiers only consider a few (pertinent) parameters. This seems in contradiction with usual biological plausible models, based on neuronal networks, which intrinsically have a lot of parameters. Here, we propose to solve this apparent contradiction, building a link between biological plausible models and classifiers with low Vapnik-Chernovenkis dimension. The -somehow very simple- key idea is to consider piece-wise linear classifiers of minimal dimension, as a generalization of support-vector machine. This allows to solve the previous dilemma at both a theoretical and computational levels, including some elements of biological plausibility. Experimentation of a small interactive toy demonstration to analyze the performances of these mechanisms is reported, while the methodology is validated on a real experimental problems.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4489.pdf (1.17 Mo) Télécharger le fichier

Dates and versions

inria-00072099 , version 1 (23-05-2006)


  • HAL Id : inria-00072099 , version 1


Thierry Viéville, Sylvie Crahay. A deterministic biologically plausible classifier. [Research Report] RR-4489, INRIA. 2002. ⟨inria-00072099⟩
108 View
286 Download


Gmail Facebook Twitter LinkedIn More