Éditeur(s) : HAL CCSD
Résumé : International audience
In this paper we propose a hybrid approach using mutual information and multi-objective optimization for feature subset selection problem. The hybrid aspect is due to the sequence of a filter method and a wrapper method in order to take advantages of both. The filter method reduces the exploration space by keeping subsets having good internal properties and the wrapper method chooses among the remaining subsets with a classification performances criterion. In the filter step, the subsets are evaluated in a multi-objective way to ensure diversity within the subsets. The evaluation is based on the mutual information to estimate the dependency between features and classes and the redundancy between features within the same subset. We kept the non-dominated (Pareto optimal) subsets for the second step. In the wrapper step, the selection is made according to the stability of the subsets regarding classification performances during learning stage on a set of classifiers to avoid the specialization of the selected subsets for a given classifiers. The proposed hybrid approach is experimented on a variety of reference data sets and compared to the classical feature selection methods FSDD and mRMR. The resulting algorithm outperforms these algorithms and the computation complexity remains acceptable even if it increases with regards to these two fast selection methods.
Journal of Informatics and Mathematical Sciences

hal-01375982
https://hal.archives-ouvertes.fr/hal-01375982

Éditeur(s) : HAL CCSD Kluwer
Résumé : This paper presents some considerations about hybrid optimization algorithms useful to optimize real complex system. The given indication could be used by readers to conceive hybrid algorithms. These considerations have been deducted from a concrete application case: the satellites constellations design problem. But each of the advanced techniques proposed in this paper are considered in a more general way to solve other problems. This problem is used to illustrate the techniques along the paper because it is grouping many characteristics (di culties) of contemporary real complex systems: the size and the characteristics of the search space engendered by a combinatorial problem; The irregularity of the criterions; The mathematical and physical heterogeneity of parameters forbids the use of classical algorithms; The evaluation of a solution, which uses a time consuming simulation; A need of accurate values. More details are available in previous papers ([?], [?], [?], [?]). For these reasons, we could learn a lot from this experiment in order to detach hybrid techniques usable for problems having close characteristics. This paper presents the historic leading to the current algorithm, the modeling of the complex system and the sophisticated algorithm proposed to optimize it. Application cases and ways to built signi cant tests of hybrid algorithm are also given.
International Federation for Information Processing

hal-00602279
https://hal.archives-ouvertes.fr/hal-00602279

Éditeur(s) : HAL CCSD
Résumé : International audience
This paper deals with hybrid optimization take different methods to solve a complex problem. As if the choice of concerning methods is important, the way to combine them is determinant for an ef cient search. The article deals with cooperation strategy between the different layers of an hybrid optimization algorithm. We describ the way it is articulated for an Satellite Constellation Optimization problem. This cooperation allows a dynamical adaptation of the optimization algorithm parameters according to the mutual advance of each search
Journal Européen des Systèmes Avancés

hal-00602267
https://hal.archives-ouvertes.fr/hal-00602267

Éditeur(s) : HAL CCSD
Résumé : International audience
This paper presents some considerations about hybrid optimization algorithms useful to optimize real complex system. The given indication could be used by readers to conceive hybrid algorithms. These considerations have been deducted from a concrete application case: the satellites constellations design problem. But each of the advanced techniques proposed in this paper are considered in a more general way to solve other problems. This problem is used to illustrate the techniques along the paper because it is grouping many characteristics (di culties) of contemporary real complex systems: the size and the characteristics of the search space engendered by a combinatorial problem; The irregularity of the criterions; The mathematical and physical heterogeneity of parameters forbids the use of classical algorithms; The evaluation of a solution, which uses a time consuming simulation; A need of accurate values. More details are available in previous papers ([?], [?], [?], [?]). For these reasons, we could learn a lot from this experiment in order to detach hybrid techniques usable for problems having close characteristics. This paper presents the historic leading to the current algorithm, the modeling of the complex system and the sophisticated algorithm proposed to optimize it. Application cases and ways to built signi cant tests of hybrid algorithm are also given.
HPCSE Proceedings
Toulouse, France

hal-00602264
https://hal.archives-ouvertes.fr/hal-00602264

Éditeur(s) : HAL CCSD Yokohama
Résumé : International audience
We make use of the viscosity technique to develop a convergent method for approximating a common element of the set of fixed points of a demicontractive operator and the set of solutions of a monotone equilibrium problem. The proposed algorithm is obtained by coupling a modified hybrid steepest descent method with the extragradient algorithm. Under mild conditions, the strong convergence of the sequences generated by the algorithm is obtained. Using this result we obtain two corollaries which improve or develop several corresponding results in this field.
Journal of Nonlinear and Convex Analysis

hal-00779988
https://hal.univ-antilles.fr/hal-00779988

Éditeur(s) : HAL CCSD School of Communications and Informatics
Résumé : International audience
The hybrid proximal point algorithm introduced by Solodov and Svaiter allowing significant relaxation of the tolerance requirements imposed on the solution of proximal subproblems will be combined with the inertial method introduced by Alvarez and Attouch which incorporates second order information to achieve faster convergence. The weak convergence of the resulting method will be investigated for finding zeroes of a maximal monotone operator in a Hilbert space.
ISSN: 1443-5756

hal-00780745
https://hal.univ-antilles.fr/hal-00780745
https://hal.univ-antilles.fr/hal-00780745/document
https://hal.univ-antilles.fr/hal-00780745/file/170_03_www.pdf

Éditeur(s) : HAL CCSD Taylor & Francis
Résumé : International audience
This article is concerned with a generalization of the hybrid steepest descent method from variational inequalities to the multivalued case. This will be reached by replacing the multivalued operator by its Yosida approximate, which is always Lipschitz continuous. It is worth mentioning that the hybrid steepest descent method is an algorithmic solution to variational inequality problems over the fixed point set of certain nonexpansive mappings and has remarkable applicability to the constrained nonlinear inverse problems like image recovery and MIMO communication systems
ISSN: 0163-0563

hal-00776641
https://hal.univ-antilles.fr/hal-00776641
DOI : 10.1080/01630563.2011.619676

Éditeur(s) : HAL CCSD Microbiology Society
Résumé : International audience
An actinobacterial strain, designated ViU22(T), was isolated from a natural uranium-rich soil and was studied using a polyphasic approach. Cells formed orange-pigmented colonies, were rod-shaped, Gram-positive (non-staining method), non-motile and non-spore-forming. This organism grew in 0-4.5 % (w/v) NaCl and at 15-37 °C, with optimal growth occurring in 0.5 % (w/v) NaCl and at 30 °C. Comparative 16S rRNA gene sequence analysis revealed that the strain ViU22(T) belonged to the genus Microbacterium. It exhibited highest 16S rRNA gene sequence similarity with the type strains of Microbacterium testaceum (98.14 %) and Microbacterium binotii (98.02 %). The DNA-DNA relatedness of strains ViU22(T) with the most closely related type strains Microbacterium testaceum and Microbacterium binotii DSM 19164(T) was 20.10 % (± 0.70) and 28.05 % (± 0.35), respectively. Strain ViU22(T) possessed a type B2β peptidoglycan with partial substitution of glutamic acid by 3-hydroxy glutamic acid. The major menaquinones were MK-11 and MK-12. Major polar lipids detected in the strain ViU22(T) were diphosphatidylglycerol, phosphatidylglycerol, an unknown phospholipid and unknown glycolipids. The predominant fatty acids were anteiso-C15 : 0, anteiso-C17 : 0 and iso-C16 : 0, a pattern reported for other Microbacterium species. The major cell-wall sugars were galactose, xylose and mannose and the DNA G+C content was 71 mol%. Together, the DNA-DNA hybridization results and the differentiating phenotypic characteristics, showed that strain ViU22(T) should be classified as the type strain of a novel species within the genus Microbacterium, for which the name Microbacterium lemovicicum sp. nov. is proposed. The type strain is ViU22(T) ( = ATCC BAA-2396(T) = CCUG 62198(T) = DSM 25044(T)).
ISSN: 1466-5026

hal-01561095
https://hal-amu.archives-ouvertes.fr/hal-01561095
PUBMED : 23264499
DOI : 10.1099/ijs.0.048454-0