Abstract
We present a new clustering algorithm based on the search for a stable partition with respect to a non parametric discrimination rule. A formal link between this method and the Hopfield connectionist model is shown, allowing for the definition of an energy function whose decrease at each iteration guarantees the stationarity of the sequence of partitions obtained. A link between this approach and the principle of classification likelihood maximisation is also studied.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Comptes Rendus de l'Academie des Sciences Series I Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
