H. and L. Thi, Analyse numérique des algorithmes de l'optimisation DC. Approches locale et globale. Codes et simulations numériques en grande dimension. Applications, Thèse de Doctorat de l'Université de Rouen, 1994.

H. and L. Thi, ContributionàContributionà l'optimisation non convexe et l'optimisation globale : Théorie, Algorithmes et Applications, HabilitationàHabilitationà Diriger des Recherches, 1997.

H. and L. Thi, An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints, Mathematical Programming, Ser. A, vol.873, pp.401-426, 2000.

H. and L. Thi, Solving large scale Molecular distance geometry problem by a smoothing technique via the Gaussian transform an DC programming, Journal of Global Optimization, vol.27, pp.375-397, 2003.

H. , L. Thi, and T. Pham-dinh, Solving a class of linearly constrained indefinite quadratic problems by DC algorithms, Journal of Global Optimization, vol.11, pp.253-285, 1997.
URL : https://hal.archives-ouvertes.fr/hal-01636781

H. , L. Thi, and T. Pham-dinh, A Branch-and-Bound method via DC Optimization Algorithm and Ellipsoidal techniques for Box Constrained Nonconvex Quadratic Programming Problems, Journal of Global Optimization, vol.13, pp.171-206, 1998.

H. , L. Thi, and T. Pham-dinh, DC programming approach for large-scale molecular optimization via the general distance geometry problem, Nonconvex Optimization and Its Applications 40, Optimization in Computational Chemistry and Molecular Biology : Local and Global Approaches, pp.301-339, 2000.

H. , L. Thi, and T. Pham-dinh, Large Scale Molecular Conformation via the Exact Distance Geometry Problem, In Optimization, Lecture Notes in Economics and Mathematical Systems, vol.481, pp.260-277, 2000.

H. , L. Thi, and T. Pham-dinh, A continuous Approach for Globally Solving Linearly Constrained Quadratic Zero -One Programming Problems, Optimization, pp.93-120, 2001.

H. , L. Thi, and T. Pham-dinh, DC optimization approaches via Markov models for restoration of signals (1-D) and (2-D), Nonconvex Optimization and Its Applications Bibliographie 54 : In Advances in Convex Analysis and Global Optimization, pp.300-317, 2001.

H. , L. Thi, and T. Pham-dinh, DC programming approach and solution algorithm to the multidimensional scaling problem, Nonconvex Optimization and Its Applications 53 : In From Local to Global Optimization, pp.231-276, 2001.

H. , L. Thi, and T. Pham-dinh, DC Programming Approach for Multicommodity Network Optimization Problems with Step Increasing Cost Functions, Special Issue of Journal of Global Optimization, vol.22, pp.204-233, 2002.
URL : https://hal.archives-ouvertes.fr/hal-01636771

H. , L. Thi, T. Pham-dinh, and D. Programming, Theory, Algorithms, Applications : The State of the Art, First InternationalWorkshop on Global Constrained Optimization and Constraint Satisfaction, Laboratory of Modeling, Optimization & Operations Research, 2002.

H. , L. Thi, and T. Pham-dinh, Large scale molecular optimization from distances matrices by a DC optimization approach, SIAM Journal of Optimization, vol.141, pp.77-116, 2003.

H. , L. Thi, and T. Pham-dinh, A new algorithm for solving large scale molecular distance geometry problems, Applied Optimization : in Hight Performance Algorithms and Software for Nonlinear Optimization, pp.276-296, 2003.

H. , L. Thi, and T. Pham-dinh, The DC (Difference of Convex functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems, Annals of Operations Research, vol.133, pp.23-46, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01636759

H. , L. Thi, and T. Pham-dinh, A continuous approach for the concave cost supply problem via DC Programming and DCA
URL : https://hal.archives-ouvertes.fr/hal-01636752

H. Le-thi, T. Belghiti, and T. Pham-dinh, A new efficient algorithm based on DC programming and DCA for Clustering, Journal of Global Optimization, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01636755

H. Le-thi, T. Belghiti, and T. Pham-dinh, Clustering via DC programming and DCA, Proceeding de 13ème Rencontres de la Société Francophone de Classification SFC'06, pp.133-139, 2006.

H. Le-thi, M. L. Hoai, and T. Pham-dinh, Optimization based DC programming and DCA for Hierarchical Clustering, European Journal of Operational Research, vol.183, pp.1067-1085, 2007.

H. Le-thi, M. L. Hoai, and T. Pham-dinh, Une nouvelle approche basée sur la programmation DC et DCA pour la classification floue, pp.703-714, 2007.

H. Le-thi, T. Nguyen, and T. Pham-dinh, A Continuous DC Programming Approach To The Strategic Supply Chain Design Problem From Qualified Partner Set In Press, Available Online, European Journal of Operational Research, 2006.

H. Bibliographie23-], M. L. Le-thi, T. Hoai, T. Nguyen, and . Pham-dinh, Noisy Image Segmentation by Fuzzy C-Means Clustering based DCA, 2007.

H. Le-thi, T. Pham-dinh, and H. D. Nho, Towards Tikhonov regularization of non-linear ill-posed problems: a dc programming approach, Comptes Rendus Mathematique, vol.335, issue.12, pp.1073-1078, 2002.
DOI : 10.1016/S1631-073X(02)02611-0

URL : https://hal.archives-ouvertes.fr/hal-01636769

H. Le-thi, T. Pham-dinh, and H. D. Nho, Solving inverse problems for an elliptic equations by DC (Difference of Convex functions) programming, Journal of Global Optimization, vol.25, pp.407-423, 2003.

H. Le-thi, T. Pham-dinh, and H. D. Nho, On the ill-posedness of the trust region Subproblem, Journal of Inverse and Ill-posed Problems, pp.545-577, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01636764

H. Le-thi, T. Pham-dinh, and M. L. Dung, Numerical solution for optimization over the efficient set by DC optimization algorithm, Operations Research Letters, vol.19, pp.117-128, 1996.

H. Le-thi, T. Pham-dinh, and M. L. Dung, A combined DC Optimization : Ellipsoidal Branch-and-Bound Algorithm for Solving Nonconvex Quadratic Programming Problems, Journal of Combinatorial Optimization, vol.21, pp.9-28, 1998.
URL : https://hal.archives-ouvertes.fr/hal-01636777

H. Le-thi, T. Pham-dinh, and M. L. Dung, Simplicially-Constrained DC Optimization over Efficient and Weakly Efficient Sets, Journal of Optimization Theory and Applications, vol.1, issue.3, pp.503-531, 2003.
DOI : 10.1007/BF00120663

URL : https://hal.archives-ouvertes.fr/hal-01636793

H. Le-thi, T. Pham-dinh, T. Nguyen, and . Van, Combination between global and local methods for solving an optimization problem over the efficient set, European Journal of Operational Research, vol.142, issue.2, pp.257-270, 2002.
DOI : 10.1016/S0377-2217(01)00301-0

URL : https://hal.archives-ouvertes.fr/hal-01636770

H. Le-thi, T. Pham-dinh, N. Huynh, and . Van, Exact Penalty Techniques, DC Programming, SIAM Conference on Optimization, 2005.

H. Le-thi, T. Pham-dinh, V. Nguyen, and . Van, A Combined DCA and New Cutting Plane Techniques for Globally Solving Mixed zero-one Programming, SIAM Conference on Optimization, 2005.

T. and P. Dinh, Elements homoduaux relatifsàrelatifsà un couple de normes (?, ?) Applications au calcul de S ?? (A), 1975.

T. and P. Dinh, Calcul du maximum d'une forme quadratique définie positive sur la boule unité de la norme du max, 1976.

T. and P. Dinh, ContributionàContributionà la théorie de normes et ses applicationsàapplicationsà l'analyse numérique, Thèse de Doctorat d'Etat Es Science, 1981.

T. and P. Dinh, Convergence of subgradient method for computing the bound norm of matrices, Linear Alg. and Its Appl, pp.163-182, 1984.

T. and P. Dinh, Algorithmes de calcul d'une forme quadratique sur la boule unité de la norme maximum, Numer. Math, vol.45, pp.377-440, 1985.

T. and P. Dinh, Algorithms for solving a class of non convex optimization problems. Methods of subgradients, Fermat days 85, Mathematics for Optimization, 1986.

T. and P. Dinh, Duality in DC (difference of convex functions) optimization. Subgradient methods, Trends in Mathematical Optimization, International Series of Numer Math, vol.84, pp.277-293, 1988.

T. , P. Dinh, and H. Thi, Stabilité de la dualité lagrangienne en optimisation DC (différence de deux fonctions convexes), C.R. Acad, pp.379-384, 1994.

T. , P. Dinh, and H. Thi, Lagrangian stability and global optimality in nonconvex quadratic minimization over Euclidean balls and spheres, Journal of Convex Analysis, vol.2, pp.263-276, 1995.
URL : https://hal.archives-ouvertes.fr/hal-01664676

T. , P. Dinh, and H. Thi, DC optimization algorithms for globally minimizing nonconvex quadratic forms on Euclideans balls and spheres, Operations Research Letters, vol.19, pp.207-216, 1996.

T. , P. Dinh, and H. Thi, Convex analysis approach to d.c. programming : Theory, Algorithms and Applications, Acta Mathematica Vietnamica, dedicated to Professor Hoang Tuy on the occasion of his 70th birthday, pp.289-355, 1997.
URL : https://hal.archives-ouvertes.fr/hal-01664714

T. , P. Dinh, and H. Thi, DC optimization algorithms for solving the trust region subproblem, SIAM Journal of Optimization, vol.82, pp.476-505, 1998.

F. Akoa, Approches de points intérieurs et de programmation DC en optimisation non convexe. Code et simulations numériques industrielles, Thèse de Doctorat de l, 2005.

T. Phong, Analyse Numerique des Méthodes d'Optimisation Globale, Thèse de Doctoral, 1994.

T. Phong, T. Pham-dinh, and H. Thi, A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem, Journal of Global Optimization, vol.30, issue.2, pp.87-105, 1995.
DOI : 10.1007/BFb0121159

P. Thach, D.c. sets, d.c. functions and nonlinear equations, Mathematical Programming, vol.23, issue.1-3, pp.415-428, 1993.
DOI : 10.1007/BF01581278

URL : https://hal.archives-ouvertes.fr/medihal-01323679

V. and N. Van, Méthodes exactes pour l'optimisation DC polyédrale en variables mixtes 0-1 basées sur DCA et des nouvelles coupes, 2006.

R. Collobert, F. Sinz, J. Weston, and L. Bottou, Trading convexity for scalability, Proceedings of the 23rd international conference on Machine learning , ICML '06, 2006.
DOI : 10.1145/1143844.1143870

N. Krause and Y. Singer, Leveraging the margin more carefully, Twenty-first international conference on Machine learning , ICML '04, 2004.
DOI : 10.1145/1015330.1015344

Y. Liu, X. Shen, and H. Doss, Multicategory ??-Learning and Support Vector Machine: Computational Tools, Journal of Computational and Graphical Statistics, vol.14, issue.1, pp.219-236, 2005.
DOI : 10.1198/106186005X37238

Y. Liu and X. Shen, -Learning, Journal of the American Statistical Association, vol.101, issue.474, pp.500-509, 2006.
DOI : 10.1198/016214505000000781

J. Neumann, C. Schnörr, and G. Steidl, SVM-Based Feature Selection by Direct Objective Minimisation, Proc. of 26th DAGM Symposium, 2004.
DOI : 10.1007/978-3-540-28649-3_26

J. Neumann, C. Schnörr, and G. Steidl, Combined SVM-Based Feature Selection and Classification Machine Learning
DOI : 10.1007/s10994-005-1505-9

URL : https://link.springer.com/content/pdf/10.1007%2Fs10994-005-1505-9.pdf

X. Shen, From large margin classification to ?-learning

X. Shen, G. Tseng, X. Zhang, and W. Wong, On ??-Learning, On ?-Learning, pp.724-734, 2003.
DOI : 10.1198/016214503000000639

T. Schüle, C. Schnörr, S. Weber, and J. Hornegger, Discrete tomography by convex???concave regularization and D.C. programming, Discrete Applied Mathematics, vol.151, issue.1-3, pp.229-243, 2005.
DOI : 10.1016/j.dam.2005.02.028

T. Schüle, S. Weber, and C. Schnörr, Adaptive Reconstruction of Discrete-Valued Objects from few Projections, Electronic Notes in Discrete Mathematics, vol.20, pp.365-384, 2005.
DOI : 10.1016/j.endm.2005.05.074

S. Weber, C. Schnörr, T. Schüle, and J. Hornegger, Binary Tomography by Iterating Linear Programs, Computational Imaging and Vision -Geometric Properties from Incomplete Data, 2005.
DOI : 10.1007/1-4020-3858-8_10

URL : http://www5.informatik.uni-erlangen.de/Forschung/Publikationen/2005/Weber05-BTB.pdf

S. Weber, T. Schüle, and C. Schnörr, Prior Learning and Convex-Concave Regularization of Binary Tomography, Electronic Notes in Discrete Mathematics, vol.20, pp.313-327, 2005.
DOI : 10.1016/j.endm.2005.05.071

S. Weber, A. Nagy, T. Schüle, C. Schnörr, and A. Kuba, A Benchmark Evaluation of Large-Scale Optimization Approaches to Binary Tomography, DGCI 2006, pp.146-156, 2006.
DOI : 10.1007/11907350_13

A. Yuille and A. Rangarajan, The Convex Concave Procedure (CCCP), Advances in Neural Information Processing System 14

E. Balas, Disjunctive programming: Properties of the convex hull of feasible points, Discrete Applied Mathematics, vol.89, issue.1-3, 1974.
DOI : 10.1016/S0166-218X(98)00136-X

E. Balas, Disjunctive programming: Properties of the convex hull of feasible points, Discrete Applied Mathematics, vol.89, issue.1-3, pp.1-44, 1998.
DOI : 10.1016/S0166-218X(98)00136-X

H. Benson, Concave minimization : theoty, applications and algorithms in Handbook of Global Optimisation, pp.43-148, 1995.

H. Benson, Deterministic algorithm for constrained concave minimization : a unified critical survey Naval Research Logistics, pp.765-795, 1996.

H. Benson and R. Horst, A branch and bound-outer approximation algorithm for concave minimization over a convex set, Computers & Mathematics with Applications, vol.21, issue.6-7, pp.67-76, 1991.
DOI : 10.1016/0898-1221(91)90161-V

G. B. Dantzig, D. R. Fulkerson, and S. M. Johnson, emphSolution of a large scale traveling salesman problem, Operations Recheach, vol.2, pp.393-410, 1954.

E. W. Cheney and A. A. Goldstein, Newton's method for convex programming and Tchebycheff approximation, Numerische Mathematik, vol.8, issue.1, pp.253-268, 1959.
DOI : 10.2140/pjm.1958.8.415

R. Cottle and G. Dantzig, Complementary pivot theory of mathematical programming Linear algebra and its applications, pp.103-125, 1968.

G. Dantzig, D. Fulkerson, and S. Johnson, Solution of a large scale traveling salesman problem Operations Recheach, pp.393-410, 1954.

J. E. Falk and K. L. Hoffman, A Successive Underestimation Method for Concave Minimization Problems, Mathematics of Operations Research, vol.1, issue.3, pp.251-259, 1976.
DOI : 10.1287/moor.1.3.251

R. Fletcher, Pratical methods of Optimization John Wiley, 1980.

R. E. Gomory, Outline of an algorithm for integer solutions to linear programs, Recent Advances in Mathematical Programming, pp.269-302, 1963.
DOI : 10.1090/S0002-9904-1958-10224-4

R. Horst, N. Thoai, and H. , Tuy On a outer approximation concept in global optimisation Optimization, pp.255-264, 1989.

R. Horst and H. , Tuy Global Optimization : Deterministic Approaches Third edition, 1996.

K. Levenberg, A method for the solution or certain nonlinear problems in least quares Quart, Appl. Math, vol.2, 1944.

J. J. Moré and D. Sorensen, Computing a Trust Region Step, SIAM Journal on Scientific and Statistical Computing, vol.4, issue.3, pp.553-572, 1983.
DOI : 10.1137/0904038

M. W. Padberg, On the facial structure of set packing polyhedra, Mathematical Programming, vol.18, issue.1, pp.199-215, 1973.
DOI : 10.1007/BF01580121

R. Rockafellar, Monotone Operators and the Proximal Point Algorithm, SIAM Journal on Control and Optimization, vol.14, issue.5, pp.877-898, 1976.
DOI : 10.1137/0314056

S. J. Sadjadi and K. Ponnambalam, Advances in trust region algorithms for constrained optimization, Applied Numerical Mathematics, vol.29, issue.3, pp.423-443, 1999.
DOI : 10.1016/S0168-9274(98)00105-6

D. Sorensen, Newton???s Method with a Model Trust Region Modification, SIAM Journal on Numerical Analysis, vol.19, issue.2, pp.409-426, 1982.
DOI : 10.1137/0719026

S. Steihaug, The Conjugate Gradient Method and Trust Regions in Large Scale Optimization, SIAM Journal on Numerical Analysis, vol.20, issue.3, pp.626-637, 1983.
DOI : 10.1137/0720042

P. Toint, Towards an efficient sparsity exploiting Newton method for minimization Duff, I, Sparse Matrices and Their Uses, pp.57-88, 1981.

H. Tuy, On outer approximation methods for solving concave minimization problems, Acta Mathematica Vietnamica, vol.8, pp.3-34, 1983.

H. Tuy, Global Minimization of a Difference of Two Convex Functions Mathematics Programming Study, pp.150-182, 1987.

H. Tuy and D. , Optimisation : Theory, Methods and Algorithms, Handbook of Global Optimisation Horst and Pardalos eds, pp.149-216, 1995.

F. Rendl and H. , Wolkovicz A semidefinite framework to trust region subproblems with application to large scale minimization CORR Report 94-32, 1994.

C. R. Reeves and J. E. Rowe, Genetic algorithms-Principles and perspectives, 2002.

C. Darwin, On the Origin of Species by means of natural selection, or the Preservations of favored races in the struggle of life, 1859.

D. E. Goldberg, Genetic Algorithms in Search, Optimisation and Machine Learning, 1989.

C. L. Bridges and D. Goldberg, An analysis of multipoint crossover, Proceedings of the Foundation of Genetic Algorithms, 1991.

J. H. Holland, Adaptation in natural and artificial systems, 1975.

Z. Michalewicz, C. Belew, R. K. Booker, L. B. Icga, and M. Kaufman, Handling constraints in genetic algorithms, Proceedings of the Fourth International Conference on Genetic Algorithm, pp.151-157, 1991.

G. Syswerda, Uniform crossover in genetic algorithms, Proceedings of the third European conference on Genetic Algorithm, 1989.

M. N. Ahmed, S. Yamany, N. Mohamed, and A. , A modified fuzzy c-means algorithm for bias field estimation and segmentation of MRI data, IEEE Transactions on Medical Imaging, vol.21, issue.3, pp.193-199, 2002.
DOI : 10.1109/42.996338

J. C. Bezdek, L. O. Hall, and L. P. , Clake Review of MR image segmentation techniques using pattern recognition Medical Physics, pp.1033-1048, 1993.

C. Bouman and B. Liu, Segmentation of Textured Images Using a Multiple Resolution Approach Proc, IEEE Int'l Conf. on Acoust., Speech and Sig. Proc, pp.1124-1127, 1988.

P. Campadelli, D. Medici, and R. Schettini, Color Image Segmentation using Hopfield Networks Image and Vision Computing, pp.161-166, 1997.
DOI : 10.1016/s0262-8856(96)01121-3

J. Dunn, A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters, Journal of Cybernetics, vol.3, issue.3, pp.32-57, 1973.
DOI : 10.1080/01969727308546046

W. Hung, M. Yang, and D. Chen, Parameter selection for suppressed fuzzy c-means with an application to MRI segmentation, Pattern Recognition Letters, vol.27, issue.5, pp.424-438, 2006.
DOI : 10.1016/j.patrec.2005.09.005

E. Littman and E. Ritter, Adaptive color segmentation-a comparison of neural and statistical methods, IEEE Transactions on Neural Networks, vol.8, issue.1, pp.175-185, 1997.
DOI : 10.1109/72.554203

J. P. Pal and S. K. , A review on image segmentation techniques, Pattern Recognition, vol.26, issue.9, pp.1277-1294, 1993.
DOI : 10.1016/0031-3203(93)90135-J

J. Rajapakse, J. Giedd, and J. Rapoport, Statistical Approach to Segmentation of Singke-Chanel Cerebral MR, Images IEEE Trans. On Medical Imaging, vol.16, 2004.

D. Zhang and S. Chen, A novel kernelized fuzzy C-means algorithm with application in medical image segmentation, Artificial Intelligence in Medicine, vol.32, issue.1, pp.37-50, 2004.
DOI : 10.1016/j.artmed.2004.01.012

S. Nascimento and B. , Mirkin and F. Moura-Pires, Modeling Proportional Membership in Fuzzy Clustering, IEEE Transactions on Fuzzy Systems, vol.11, issue.2, 2003.

W. Glenn, X. Y. Wang, and J. M. Garibaldi, The Application of a Simulated Annealing Fuzzy Clustering Algorithm for Cancer Diagnosis, 2005.

M. E. Mendes-rodrigues and L. Sacks, A scalable hierarchical fuzzy clustering algorithm for text mining, Proc. of the 4th International Conference on Recent Advances in Soft Computing, pp.269-274, 2004.

C. H. Bennett, Quantum Cryptography, Scientific American, vol.267, issue.4, pp.752-753, 1992.
DOI : 10.1038/scientificamerican1092-50

L. Burnett, G. Carter, E. Dawson, and W. Millan, Efficient Methods for Generating MARS-Like S-Boxes, Fast Software Encryption 2000, pp.300-313, 2000.
DOI : 10.1007/3-540-44706-7_21

URL : https://link.springer.com/content/pdf/10.1007%2F3-540-44706-7_21.pdf

A. Clark, E. Dawson, and H. Bergen, COMBINATORIAL OPTIMIZATION AND THE KNAPSACK CIPHER, Cryptologia, vol.20, issue.1, pp.85-93, 1996.
DOI : 10.1080/0161-119691884807

A. Clark, E. Dawson, and H. Nieuwland, Cryptanalysis of polyalphabetic substitution ciphers using a parallel genetic algorithm, 1996 IEEE International Symposium on Information Theory and Its Applications, pp.339-342, 1996.

A. Clark and E. Dawson, Discrete optimisation : A powerful tool for cryptanalysis, PRAGOCRYPT'96 -Proceedings of the 1st International Conference on the Theory and Applications of Cryptology, pp.425-451, 1996.

A. Clark and E. Dawson, A parallel genetic algorithm for cryptanalysis of the polyalphabetic substitution cipher, Cryptologia, pp.129-138, 1997.

A. Clark and J. Jacob, Two-Stage Optimisation in the Design of Boolean Functions, 5th Australasian Conference on Information Security and Privacy, pp.242-254, 2000.
DOI : 10.1007/10718964_20

A. Clark, Almost Boolean Functions : the Design of Boolean Functions by Spectral Inversion, Proceedings of Conference on Evolutionary Computation, 2003.

J. Daemen and V. Rijmen, The design of Rijndael, 2002.
DOI : 10.1007/978-3-662-04722-4

L. Edmond, Les cahiers secrets de la cryptographie, Editions du rocher, 1972.

T. Jakobsen, Cryptanalysis of block ciphers with probabilistic non-linear relations of low degree, Crypto'98, pp.347-362, 1998.
DOI : 10.1007/BFb0055730

J. Giddy and R. Safavi-naini, Automated Cryptanalysis of Transposition Ciphers, The Computer Journal, vol.37, issue.5, pp.429-436, 1994.
DOI : 10.1093/comjnl/37.5.429

S. Goldwasser, S. Micali, and C. Rackoff, Knowledge Complexity of Identification Proof Schemes, 17th ACM Symposium on the Theory of Computing STOC, pp.291-304, 1985.

O. Levbedko and A. Topchy, On Efficiency of Genetic Cryptanalysis for Knapsack Ciphers, Poster Proceedings of ACDM 98, 1998.

M. Matsui, Linear Cryptanalysis Method for DES Cipher Advances in Cryptology - Eurocrypt'93, pp.386-396, 1993.

W. Millan, How to Improve the Non-linearity of Bijective S-boxes, 3rd Australian Conference on Information Security and Privacy, pp.181-192, 1998.

W. Millan, A. Clark, and E. Dawson, Heuristic design of cryptographically strong balanced Boolean functions, Advances in Cryptology EUROCRYPT'98, pp.489-499, 1998.
DOI : 10.1007/BFb0054148

W. Millan, L. Burnett, G. Carter, A. Clark, and E. Dawson, Evolutionary Heuristics for Finding Cryptographically Strong S-Boxes, ICICS 99, 1999.
DOI : 10.1007/978-3-540-47942-0_22

W. Millan, A. Clark, and E. Dawson, Boolean Function Design Using Hill Climbing Methods, LNCS 1978 4th Australian Conference on Information Security and Privacy, 1999.
DOI : 10.1007/3-540-48970-3_1

W. Millan, Evolutionary Generation of Bent Functions for Cryptography, Proceedings of Conference on Evolutionary Computation, 2003.

I. F. Yaseen and H. V. Sahasrabuddhe, Breaking Multiplicative Knapsack Ciphers Using a Genetic Algorithm, International Conference on Knowledge Based Computer Systems, pp.129-139, 1998.

D. Stinson, Cryptographie : Theorie et pratique, 2001.

R. Spillman, M. Janssen, B. Nelson, and M. Kepner, Use of a genetic algorithm in the cryptanalysis of simple substitution ciphers, Cryptologia, pp.31-44, 1993.

R. Spillman, Cryptanalysis of Knapsack Ciphers Using Genetic Algorithms Cryptologia, pp.367-377, 1993.

G. Celeux and G. Govaert, A classification EM algorithm for clustering and two stochastic versions, Computational Statistics & Data Analysis, vol.14, issue.3, pp.315-332, 1992.
DOI : 10.1016/0167-9473(92)90042-E

URL : https://hal.archives-ouvertes.fr/inria-00075196

G. Celeux and J. Diebolt, The SEM algorithm : a probabilistic teacher algorithm from the EM algorithm for the mixture problem, Computational Statistics Quarterly, vol.2, issue.1, pp.73-92, 1985.

A. P. Dempster, N. M. Laird, and D. B. Rubin, Maximum Likelihood from Incomplete Data via the EM Algorithm, Journal of Royal Statistical Society B, vol.39, pp.1-38, 1977.

E. Diday, Optimisation en classiffication automatique et reconnaissance de formes, Note Scient, INRIA n ?, vol.6, 1972.
DOI : 10.1051/ro/197206v300611

URL : https://www.rairo-ro.org/articles/ro/pdf/1972/03/ro197206V300611.pdf

E. W. Holman, Evolutionary and psychological effects in pre-evolutionary classifications, Journal of Classification, vol.213, issue.1, pp.29-39, 1985.
DOI : 10.1007/BF01908062

M. Dash, K. Choi, P. Scheuermann, and H. , Liu Feature selection for clustering - A Filter Solution, proceedings of IEEE International Conference of Data Mining, 2002.

H. Liu and R. Setiono, A Probabilistic Approach to Feature Selection -A Filter Solution, International Conference on Machine Learning, pp.319-327, 1996.

M. Law, M. Figueiredo, and A. K. Jain, Feature selection in mixture-based clustering, Advances in Neural Information Processing Systems, pp.609-616, 2002.

M. Nadif and F. X. Jollois, Accéelération de EM pour données qualitatives : ´ etude comparative de différentes versions, 4th French-Speaking Conference Bibliographie on Knowledge Discovery and Knowledge Management, pp.253-264, 2004.

J. Macqueen, Some methods for classiffcation and analysis of multivariate observations, Proceedings of the Fifth Berkeley Symposium on Mathematical statistics and probability, pp.281-297, 1967.

A. Meyerson, A k-Median Algorithme with running time Independent of Data Size, Machine Learning, pp.61-87, 2004.

P. Mitra, C. Murthy, and S. K. , Pal Unsupervised Feature Selection Using Feature Similarity, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.24178, issue.4, 2002.
DOI : 10.1109/34.990133

URL : http://www.facweb.iitkgp.ernet.in/~pabitra/paper/tpami02_feature.pdf

C. Muller, X. Polanco, J. Royaute, and Y. Toussaint, Acquisition et structuration des connaissances en corpus : ´ eléements méthodologiques, Inria, Institut National de Recherche en Informatique et en Automatique, 1997.

F. Z. Smadja, Retrieving Collocations from Text : Xtract, Computational Linguistics, vol.19, issue.1, pp.143-177, 1994.

C. R. Rao, he utilization of multiple measurements in problems of biological classiffication , T, Journal of Royal Statistical Society B, vol.10, pp.159-203, 1948.

N. Alon and J. Spencer, The probabilistic method, 1991.

S. Arora and R. Kannan, Learning mixtures of arbitrary Gaussians, Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp.247-274, 2001.

B. S. Bradley and O. L. Mangasarian, Feature selection via concave minimization and support vector machines, Machine Learning Proceedings of the Fifteenth International Conferences (ICML'98), pp.82-90, 1998.

J. Bezdek, Fuzzy mathematics in pattern classification, 1973.

J. Bezdek, Numerical taxonomy with fuzzy sets, Journal of Mathematical Biology, vol.8, issue.1, pp.57-71, 1974.
DOI : 10.1287/opre.17.6.1034

J. Bezdek, A Convergence Theorem for the Fuzzy ISODATA Clustering Algorithms IEEE Trans, Pattern Anal. Machine Intell, vol.2, issue.1, pp.1-8, 1980.

J. Bezdek, Pattern Recognition with Fuzzy Objective Function Algorithm, 1991.
DOI : 10.1007/978-1-4757-0450-1

J. C. Bezdek, C. Coray, R. Gunderson, and J. Watson, -Lines, SIAM Journal on Applied Mathematics, vol.40, issue.2, pp.339-372, 1981.
DOI : 10.1137/0140029

J. Bezdek, R. J. Hathaway, M. J. Sabin, and W. T. Tucker, Convergence theory for fuzzy c-means: Counterexamples and repairs, IEEE Transactions on Systems, Man, and Cybernetics, vol.17, issue.5, pp.873-877, 1987.
DOI : 10.1109/TSMC.1987.6499296

C. Bouveyron, Modélisation et classification des données de grande dimension applicationàapplicationà l'analyse d'image, Thèse de doctorat, 2006.

G. Cleuziou, Une méthode de classiddication non-supervisée pour l'apprentissage de r` egles et la recherche d'information, Thèse de doctorat, 2004.

R. N. Davé, Characterization and detection of noise in clustering, Pattern Recognition Letters, vol.12, issue.11, pp.657-664, 1991.
DOI : 10.1016/0167-8655(91)90002-4

D. Dembélé and P. Kastner, Fuzzy C-means method for clustering microarray data, Bioinformatics, vol.19, issue.8, pp.573-580, 2003.
DOI : 10.1093/bioinformatics/btg119

I. S. Dhilon, J. Korgan, and C. Nicholas, Feature Selection and Document Clustering, Comprehensive Survey of Text Mining, pp.73-100, 2003.
DOI : 10.1007/978-1-4757-4305-0_4

R. O. Duda and P. E. , Hart Pattern classification and scene analysis, 1972.

J. C. Dunn, A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters, Journal of Cybernetics, vol.3, issue.3, pp.32-57, 1973.
DOI : 10.1080/01969727308546046

T. Feder and D. Greene, Optimal algorithms for approximate clustering, Proceedings of the twentieth annual ACM symposium on Theory of computing , STOC '88, 1988.
DOI : 10.1145/62212.62255

D. Fisher, Knowledge acquisition via incremental conceptual clustering, Machine Learning, pp.139-172, 1987.
DOI : 10.4159/harvard.9780674866270

URL : https://link.springer.com/content/pdf/10.1007%2FBF00114265.pdf

K. Fukunaga, Statistical Pattern Recognition, AcademicPress, NY [201] I. Gitman and M.D. Levine, An Algorithm for Detecting Unimodal Fuzzy Sets and its Application as a Clustering Technique, IEEE Trans. Comput, issue.7, pp.19-583, 1970.

R. Hathaway and J. C. Bezdek, Local convergence of the fuzzy c-means algorithms, Pattern Recognition 19, pp.477-480, 1986.

R. Hathaway, J. C. Bezdek, and W. Tucker, An improved convergence theorem for the fuzzy c -means clustering algorithms, in The Analysis of Fuzzy Information, 1987.

R. Hathaway and J. C. Bezdek, Recent convergence results for the fuzzy c-means clustering algorithms, Journal of Classification, vol.5, issue.2, pp.237-247, 1988.
DOI : 10.1007/978-1-4757-0450-1

M. A. Ismail and S. A. Selim, On the local optimality of the fuzzy ISODATA clustering algorithm IEEETrans. Pattern Anal, Machine Intell, vol.8, issue.2, pp.284-288, 1986.

M. A. Ismail and S. A. Selim, Fuzzy c-means: Optimality of solutions and effective termination of the algorithm, Pattern Recognition, vol.19, issue.6, pp.481-485, 1986.
DOI : 10.1016/0031-3203(86)90048-8

F. Klawonn and F. Hoppner, What is Fuzzy About Fuzzy Clustering ? -Understanding and Improving the Concept of the Fuzzifier Advances in Intelligent Data Analysis, pp.254-264, 2003.

T. Kim, J. C. Bezdek, and R. Hathaway, Optimality tests for fixed points of the fuzzy c-means algorithm, Pattern Recognition, vol.21, issue.6, pp.651-663, 1988.
DOI : 10.1016/0031-3203(88)90037-4

R. Krishnapuram and J. Keller, A possibilistic Approch to Clustering, IEEE Trans. on Fuzzy Systems, vol.1, issue.2, 1993.

R. Krishnapuram and J. Keller, The possibilistic C-means algorithm: insights and recommendations, IEEE Transactions on Fuzzy Systems, vol.4, issue.3, pp.385-393, 1996.
DOI : 10.1109/91.531779

L. Khoja, ContributionàContributionà la Classification Floue non Supervisée, 1997.

Y. Liu, X. Shen, and H. Doss, Multicategory ??-Learning and Support Vector Machine: Computational Tools, Journal of Computational and Graphical Statistics, vol.14, issue.1, pp.219-236, 2005.
DOI : 10.1198/106186005X37238

Y. Liu, X. Shen, and . Multicategory?-learning, -Learning, Journal of the American Statistical Association, vol.101, issue.474, pp.500-509, 2006.
DOI : 10.1198/016214505000000781

O. L. Mangasarian, Mathematical Programming in Data Mining, Data Mining and Knowledge Discovery, vol.1, issue.2, pp.183-201, 1987.
DOI : 10.1023/A:1009735908398

B. Polyak, Introduction to Optimization, Optimization Software, Inc., Publication Division, 1987.

W. Pedrycz, Conditional Fuzzy C-Means, Pattern Recognition Letters, vol.17, issue.6, pp.625-631, 1996.
DOI : 10.1016/0167-8655(96)00027-X

J. Rajapakse, J. Giedd, and J. Rapoport, Statistical Approach to Segmentation of Singke-Chanel Cerebral MR Images, IEEE Trans. On Medical Imaging, vol.16, 2004.

X. Shen, G. C. Tseng, X. Zhang, and W. H. Wong, On ??-Learning, Journal of the American Statistical Association, vol.98, issue.463, pp.724-734, 2003.
DOI : 10.1198/016214503000000639

W. T. Tucker, Counterexamples to the convergence theorem of fuzzy ISODATA clustering algorithms, in The Analysis of Fuzzy Information, 1987.

A. L. Yuille and A. Rangarajan, The Convex Concave Procedure (CCCP), Advances in Neural Information Processing System 14, 2002.

G. Whitwell, Y. Wang, and J. M. Garibaldi, The Application of a Simulated Annealing Fuzzy Clustering Algorithm for Cancer Diagnosis, 2005.

M. J. Sabin, Convergence and Consistency of Fuzzy c-means/ISODATA Algorithms, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.9, issue.5, pp.661-668, 1987.
DOI : 10.1109/TPAMI.1987.4767960

M. Rodrigues and L. Sacks, scalable hierarchical fuzzy clustering algorithm for text mining, Proc. of the 4th International Conference on Recent Advances in Soft Computing, pp.269-274, 2004.

P. J. Rousseeuw, Discussion: Fuzzy Clustering At the Intersection, Technometrics, vol.37, issue.3, pp.283-286, 1995.
DOI : 10.1016/B978-0-12-714250-0.50014-0

E. R. Ruspini, A new approach to clustering, Information and Control, vol.15, issue.1, pp.22-32, 1969.
DOI : 10.1016/S0019-9958(69)90591-9

E. R. Ruspini, Numerical methods for fuzzy clustering, Information Sciences, vol.2, issue.3, pp.319-350, 1970.
DOI : 10.1016/S0020-0255(70)80056-1

M. S. Yang and K. F. Yu, -MEANS CLUSTERING PROCEDURE???, International Journal of General Systems, vol.16, issue.4, pp.397-411, 1990.
DOI : 10.1109/TPAMI.1980.4766964

A. J. Clark, Optimisation Heuristics for Cryptology, 1998.

A. Canteaut, C. Carlet, P. Charpin, and C. Fontaine, Propagation characteristic and correlation-immunity of hight nonlinenar boolean function, Advances in Cryptographie -EUROCRYPT, Number 1807 in LNCS, 2000.

J. F. Dillon, Elementary Hadamard Difference sets PhD Thesis, 1974.

S. Hirose and K. Ikeda, Relationships among Nonlinearity Criteria of Boolean Functions, IEICE Trans. on Fundamentals, issue.2, pp.235-243, 1995.

S. Hirose and K. Ikeda, Complexity of Boolean Functions Satisfying the Propagation Criterion, IEICE Trans. on Fundamentals, issue.4, pp.470-478, 1995.

S. Hirose and K. Ikeda, Propagation Characteristics of Boolean Functions and Their Balancedness, IEICE Trans. on Fundamentals, issue.1, pp.11-18, 1995.

M. L. Hoai, H. A. Le-thi, T. Pham-dinh, and P. Bouvry, A deterministic optimization approach for generating highly nonlinear balanced boolean function in cryptography, High Performance Scientific Computing, pp.6-10, 2006.

S. Maitra, On Nonlinearity and Autocorrelation Properties of Correlation Immune Boolean Functions, Journal of Infomation Science and engineering, vol.20, pp.305-323, 2004.

J. Seberry, X. M. Zhang, and Y. Zheng, Nonlinearly balanced boolean functions and their propagation characteristics Advances in Cryptographie -EUROCRYPT, Advances in Cryptology -CRYPT0'93, 1994.

W. Stallings, Cryptography and Network Security, 2003.

O. S. Rothaus, On ???bent??? functions, Journal of Combinatorial Theory, Series A, vol.20, issue.3, pp.300-305, 1976.
DOI : 10.1016/0097-3165(76)90024-8

D. Fisher, Iterative optimization and simplification of hierarchical clusterings, Journal of Artificial Intelligence Research, vol.4, pp.147-180, 1996.

A. K. Jain, M. N. Murty, and P. J. Flynn, Data clustering: a review, ACM Computing Surveys, vol.31, issue.3, pp.264-323, 1999.
DOI : 10.1145/331499.331504

J. B. Hiriart-urruty and C. , Convex analysis and Minimization Algorithms I &II, 1993.
DOI : 10.1007/978-3-662-06409-2

L. Jia, A. Bagirov, I. Ouveysi, and A. M. Rubinov, Optimization based clustering algorithms in Multicast group hierarchies, Proceedings of the Australian Telecommunications , Networks and Applications Conference, pp.0-646, 2003.

F. Murtagh, A Survey of Recent Advances in Hierarchical Clustering Algorithms, The Computer Journal, vol.26, issue.4, 1983.
DOI : 10.1093/comjnl/26.4.354

R. T. Rockafellar, Convex analysis, 1970.
DOI : 10.1515/9781400873173

T. Wong, R. Katz, and S. Mccanne, A Preference Clustering Protocol for Large-Scale Multicast Applications, Proceedings of the First International COST264 Workshop on Networked Group Communication, pp.1-18, 1999.
DOI : 10.1007/978-3-540-46703-8_1

J. A. Clark and J. L. Jacob, Fault Injection and a Timing Channel on an Analysis Technique, Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques : Advances in Cryptology, pp.181-196, 2002.
DOI : 10.1007/3-540-46035-7_12

A. Fiat and A. , How To Prove Yourself: Practical Solutions to Identification and Signature Problems, Proceedings of CRYPTO'86, pp.186-194, 1987.
DOI : 10.1007/3-540-47721-7_12

URL : http://dsns.csie.nctu.edu.tw/research/crypto/HTML/PDF/C86/186.PDF

M. Finiazs, Syndrome decoding in the Non-Standard Cases, My-Crypt, 2005.

L. Guillou, J. Quisquater, . Memory, C. G. Gunter, . L. Ed et al., A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission Advances in Cryptology -Proceedings of EUROCRYPT'88, Cryptanalysis of an Identifcation Scheme Based on the Permuted Perceptron Problem, Eurocrypt'99, pp.123-128, 1988.

K. Ohta and T. Okamoto, A Modification of the Fiat-Shamir Scheme In Gold-wasser S, Advances in Cryptology -Proceedings of CRYPTO'88, pp.232-242, 1989.

A. Shamir, An effcient identification scheme based on permuted kernels, 1998.
DOI : 10.1007/0-387-34805-0_54

URL : https://link.springer.com/content/pdf/10.1007%2F0-387-34805-0_54.pdf

J. Stern, A new identification scheme based on syndrome decoding, Advences in Cryptology-CRYPTO'93, 1990.

J. Stern, Designing Identification Schemes with Keys of Short Size In Desmedt Y.G, Advances in Cryptology -Proceedings of CRYPTO'94, pp.164-173, 1994.

G. Waters, Hierarchies for network evolution, Sixteenth UK Teletraffic Symposium on Management of Quality of Service -the New Challenge, 2000.

G. Waters and S. Lim, Applying clustering algorithms to multicast group hierarchies, 2003.

G. Waters, J. Crawford, and S. Lim, Optimising multicast structures for grid computing, Computer Communications, vol.27, issue.14, pp.27-1389, 2004.
DOI : 10.1016/j.comcom.2004.02.015