Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Ivan, Lavallée"'
Publikováno v:
Journal of Computational Science. 4:219-231
We propose in this paper two new competitive unsupervised clustering algorithms: the first algorithm deals with ultrametric data, it has a computational cost of O(n). The second algorithm has two strong features: it is fast and flexible on the proces
Autor:
Yves Samson, Richard Levy, Stéphane Lehéricy, Bruno Dubois, Ivan Lavallée, Bénédicte Batrancourt, Michel Lamure, Dominique Hasboun
Publikováno v:
Comptes Rendus Biologies. 325:439-455
This study proposes a closer look at the neuropsychological method defined as the study of the neural bases of the behavioural and cognitive functions using an organisation–representation model for current data and knowledge of the brain, and the a
Autor:
Ivan Lavallée, Hichem Baâla
Publikováno v:
Comptes Rendus de l'Académie des Sciences - Series I - Mathematics. 333:383-388
Resume Comme [3] pour le probleme dit des «Tours de Hanoi », on donne ici une version iterative generale de la multiplication de Strasen [5] qui fait l'economie de la derecursivation et de la gestion des piles afferentes a la gestion des sept appel
Autor:
Ivan Lavallée
Publikováno v:
Quaderni. 25:43-58
Lavallée Ivan. L'ombre de l'intelligence. In: Quaderni, n°25, Printemps 1995. Intelligence artificielle et entreprise : l'entreprise intelligente ? pp. 43-58.
Publikováno v:
INDIN
The FFUCA (Fast and Flexible Unsupervised Clustering Algorithm) is a fast clustering method based on ultrametric properties. It aggregates data in the same way as partitional methods. But, it elects representatives differently. Indeed, in FFUCA the c
Autor:
Said Fouchal, Ivan Lavallée
Publikováno v:
Q2SWinet
We introduce in this paper a competitive unsupervised clustering algorithm which has two strong features: it is fast and flexible on the processed data type as well as in terms of precision. Our approach has a computational cost, in the worst case, o
Publikováno v:
In The 3rd IEEE conference on Data Mining and Optimization
Jun 2011, Putra jaya, Malaysia
Jun 2011, Putra jaya, Malaysia
We propose in this paper a novel clustering algorithm in ultrametric spaces. It has a computational cost of O(n). This method is based on the ultratriangle inequality property. Using the order induced by an ultrametric in a given space, we demonstrat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::47bfb301d617be6107e28fb3200dafd8
https://hal.science/hal-00643431
https://hal.science/hal-00643431
Publikováno v:
In The 3rd IEEE International Workshop on Performance Evaluation of Communications in Distributed Systems and Web based Service Architectures
Jun 2011, Corfu, Greece
ISCC
Jun 2011, Corfu, Greece
ISCC
Resume We propose in this paper a novel clustering algorithm in ultrametric spaces. It has a computational cost of O(n). This method is based on the ultratriangle inequality property. Using the order of ultrametric space we demonstrate that we can de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9bd149bf4fe5255b8264672aa87d3296
https://hal.archives-ouvertes.fr/hal-00643429
https://hal.archives-ouvertes.fr/hal-00643429
Publikováno v:
SAC
Complex systems are composed of many heterogeneous elements organized in a hierarchical way, whose mutual interactions make emergent collective behaviors to appear at the highest levels of observation. In biology, as shown by the integrative physiolo
Autor:
Bénédicte, Batrancourt, Richard, Levy, Stéphane, Lehericy, Dominique, Hasboun, Yves, Samson, Ivan, Lavallée, Michel, Lamure, Bruno, Dubois
Publikováno v:
Comptes rendus biologies. 325(4)
This study proposes a closer look at the neuropsychological method defined as the study of the neural bases of the behavioural and cognitive functions using an organisation-representation model for current data and knowledge of the brain, and the app