M. T. Ta, H. A. , L. Thi, L. Boudjeloud, and ?. Assala, Clustering Data Stream by a Sub-window Approach Using DCA, Machine Learning and Data Mining in Pattern Recognition Lecture Notes in Computer Science, vol.7376, pp.978-981, 2012.
DOI : 10.1007/978-3-642-31537-4_22

M. T. Ta, H. A. , L. Thi, L. Boudjeloud, and ?. Assala, Clustering data streams over sliding windows by DCA. Advanced Computational Methods for Knowledge Engineering, Studies in Computational Intelligence, vol.479, pp.1860-949, 2013.

L. Boudjeloud, ?. Assala, and T. M. Thuy, Determine Optimal Number of Clusters with an Elitist Evolutionary Approach, Lecture Notes in Computer Science, vol.8444, pp.324-335, 2014.
DOI : 10.1007/978-3-319-06605-9_27

L. Boudjeloud, ?. Assala, and T. M. Thuy, A clustering algorithm based on elitist evolutionary approach, International Journal of Bio-Inspired Computation, vol.1, issue.1
DOI : 10.1504/IJBIC.2016.10004315

A. Abraham, N. Nedjah, L. De, and M. Mourelle, Evolutionary Computation: from Genetic Algorithms to Genetic Programming, Genetic Systems Programming, pp.1-20, 2006.
DOI : 10.1007/3-540-32498-4_1

C. Charu, P. S. Aggarwal, and . Yu, A framework for clustering uncertain data streams, Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, ICDE '08, pp.150-159, 2008.

C. Charu, J. Aggarwal, J. Han, P. S. Wang, and . Yu, A framework for clustering evolving data streams, Very large Database, pp.81-92, 2003.

C. Charu, J. Aggarwal, J. Han, P. S. Wang, and . Yu, A framework for projected clustering of high dimensional data streams, Proceedings of the Thirtieth International Conference on Very Large Data Bases, pp.852-863, 2004.

J. Alcalá-fdez, A. Fernández, J. Luengo, J. Derrac, and S. García, Keel data-mining software tool: Data set repository, integration of algorithms and experimental analysis framework. Multiple-Valued Logic and Soft Computing, pp.255-287, 2011.

D. Aloise, P. Hansen, and L. Liberti, An improved column generation algorithm for minimum sum-of-squares clustering, Mathematica Programming, pp.195-220, 2012.
DOI : 10.1007/s00357-004-0017-9

A. Auslender, Optimisation: méthodes numériques. Ma??triseMa??trise de mathématiques et applications fondamentales, 1976.

B. Babcock, M. Datar, R. Motwani, O. Liadan, and . Callaghan, Maintaining variance and k-medians over data stream windows, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '03, pp.234-243, 2003.
DOI : 10.1145/773153.773176

B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom, Models and issues in data stream systems, Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '02, pp.1-16, 2002.
DOI : 10.1145/543613.543615

G. , P. Babu, and M. N. Murty, A near-optimal initial seed value selection in k-means algorithm using a genetic algorithm, Pattern Recognition Letters, vol.14, issue.10, pp.763-769, 1993.

G. , P. Babu, and M. N. Murty, Simulated annealing for selecting optimal initial seeds in the k-means algorithm, Indian Journal of Pure & Applied Mathematics, vol.25, issue.12, pp.85-94, 1994.

S. Belongie, C. Carson, H. Greenspan, and J. Malik, Color-and texturebased image segmentation using em and its application to content-based image retrieval, Proceedings of the Sixth International Conference on Computer Vision, ICCV '98, pp.675-682, 1998.

J. Beringer and E. Hullermeier, Online clustering of parallel data streams, Data & Knowledge Engineering, vol.58, issue.2, pp.180-204, 2006.
DOI : 10.1016/j.datak.2005.05.009

C. James and . Bezdek, Pattern Recognition with Fuzzy Objective Function Algorithms, 1981.

J. Blackard, Comparative accuracies of artificial neural networks and discriminant analysis in predicting forest cover types from cartographic variables, Computers and Electronics in Agriculture, vol.24, issue.3, pp.131-151, 1999.
DOI : 10.1016/S0168-1699(99)00046-0

T. Blickle, Theory of Evolutionary Algorithms and Application to System Synthesis, 1996.

S. Paul, O. L. Bradley, and . Mangasarian, Feature selection via concave minimization and support vector machines, ICML, pp.82-90, 1998.

P. S. Bradley, U. M. Fayyad, and C. Reina, Scaling clustering algorithms to large databases, Proceeding Fourth International Conference Knowledge Discovery and Data Mining, pp.9-15, 1998.
DOI : 10.1145/545151.545176

T. Cali´nskicali´nski and J. Harabasz, A Dendrite Method for Cluster Analysis, Communications in Statistics - Simulation and Computation, vol.3, issue.1, pp.1-27, 1974.
DOI : 10.1080/03610917408548446

F. Cao, M. Ester, W. Qian, and A. Zhou, Density-Based Clustering over an Evolving Data Stream with Noise, 2006 SIAM Conference on Data Mining, pp.328-339, 2006.
DOI : 10.1137/1.9781611972764.29

D. B. Carr, R. J. Littlefield, and W. L. Nichloson, Scatterplot Matrix Techniques for Large N, Proceedings of the Seventeenth Symposium on the Interface of Computer Sciences and Statistics on Computer Science and Statistics, pp.297-306, 1986.
DOI : 10.2307/2289444

M. E. Celebi, H. A. Kingravi, and P. A. Vela, A comparative study of efficient initialization methods for the k-means clustering algorithm, Expert Systems with Applications, vol.40, issue.1, pp.200-210, 2013.
DOI : 10.1016/j.eswa.2012.07.021

A. Chambolle, R. A. De-vore, N. Lee, and B. J. Lucier, Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage, IEEE Transactions on Image Processing, vol.7, issue.3, pp.319-335, 1998.
DOI : 10.1109/83.661182

E. Y. Chan, W. Ching, M. K. Ng, and J. Z. Huang, An optimization algorithm for clustering using weighted dissimilarity measures, Pattern Recognition, vol.37, issue.5, pp.943-952, 2004.
DOI : 10.1016/j.patcog.2003.11.003

C. Chang and C. Lin, LIBSVM, ACM Transactions on Intelligent Systems and Technology, vol.2, issue.3, p.27, 2011.
DOI : 10.1145/1961189.1961199

M. Charikar and S. Guha, Improved combinatorial algorithms for the facility location and k-median problems, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), p.378, 1999.
DOI : 10.1109/SFFCS.1999.814609

M. Chen and Y. Lu, A novel elitist multiobjective optimization algorithm: Multiobjective extremal optimization, European Journal of Operational Research, vol.188, issue.3, pp.637-651, 2008.
DOI : 10.1016/j.ejor.2007.05.008

O. , C. Soon, and H. A. Le-thi, Learning sparse classifiers with difference of convex functions algorithms. Optimization Methods and Software, pp.830-854, 2013.

X. Hong-dang, C. S. Vincent, . Lee, A. Ng, K. Ciptadi et al., An EM-Based Algorithm for Clustering Data Streams in Sliding Windows, DASFAA, pp.230-235, 2009.
DOI : 10.1145/1281192.1281210

X. Hong-dang, C. S. Vincent, . Lee, K. Ng, and . Ong, Incremental and Adaptive Clustering Stream Data over Sliding Window, Lecture Notes in Computer Science, vol.11, issue.2, pp.660-674, 2009.
DOI : 10.1016/B978-155860869-6/50039-1

S. Das, A. Abraham, and A. Konar, Automatic kernel clustering with a Multi-Elitist Particle Swarm Optimization Algorithm, Pattern Recognition Letters, vol.29, issue.5, pp.688-699, 2008.
DOI : 10.1016/j.patrec.2007.12.002

L. David, D. W. Davies, and . Bouldin, A cluster separation measure, IEEE Transactions on Pattern Analysis Machine Intelligence, vol.1, issue.2, pp.224-227, 1979.

A. P. Dempster, N. M. Laird, and D. B. Rubin, Maximum likelihood from incomplete data via the EM algorithm, Journal of the Royal Statistical Society: Series B, vol.39, pp.1-38, 1977.

H. Do, A. Kalousis, and M. Hilario, Feature Weighting Using Margin and Radius Based Error Bound Optimization in SVMs, pp.315-329, 2009.
DOI : 10.1145/1143844.1143870

J. C. Dunn, Well-Separated Clusters and Optimal Fuzzy Partitions, Journal of Cybernetics, vol.4, issue.1, pp.95-104, 1974.
DOI : 10.1080/01969727408546059

M. Ester, H. Kriegel, J. Sander, and X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, KDD, pp.226-231, 1996.

F. Farnstrom, J. Lewis, and C. Elkan, Scalability for clustering algorithms revisited, ACM SIGKDD Explorations Newsletter, vol.2, issue.1, pp.51-57, 2000.
DOI : 10.1145/360402.360419

A. Fawzi, M. Davies, and P. Frossard, Dictionary learning for fast classification based on soft-thresholding. CoRR, abs/1402, 1973.

D. B. Fogel, The advantages of evolutionary computation, Biocomputing and Emergent Computation: Proceedings of BCEC97, pp.1-11, 1997.

H. Frigui and O. Nasraoui, Unsupervised learning of prototypes and attribute weights, Pattern Recognition, vol.37, issue.3, pp.567-581, 2004.
DOI : 10.1016/j.patcog.2003.08.002

G. Gasso, A. Rakotomamonjy, and S. Canu, Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming, IEEE Transactions on Signal Processing, vol.57, issue.12, pp.4686-4698, 2009.
DOI : 10.1109/TSP.2009.2026004

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

S. Gou, X. Zhuang, Y. Li, C. Xu, and L. Jiao, Multi-elitist immune clonal quantum clustering algorithm, Neurocomputing, vol.101, pp.275-289, 2013.
DOI : 10.1016/j.neucom.2012.08.022

S. Guha, R. Rastogi, and K. Shim, CURE, ACM SIGMOD Record, vol.27, issue.2, pp.73-84, 1998.
DOI : 10.1145/276305.276312

S. Guha, N. Mishra, R. Motwani, O. Liadan, and . Callaghan, Clustering data streams, 41st Annual Symposium on Foundations of Computer Science, FOCS, pp.12-14, 2000.

S. Guha, A. Meyerson, N. Mishra, R. Motwani, O. Liadan et al., Clustering data streams: theory and practice, IEEE Transactions on Knowledge and Data Engineering, vol.15, issue.3, pp.515-528, 2003.
DOI : 10.1109/TKDE.2003.1198387

M. Robert, L. G. Haralick, and . Shapiro, Image segmentation techniques, 1985.

R. Horst and H. Tuy, Global optimization -deterministic approache, 1996.

C. Huang and R. Harris, A comparison of several vector quantization codebook generation approaches, IEEE Transactions on Image Processing, vol.2, issue.1, pp.108-112, 1993.
DOI : 10.1109/83.210871

J. Huang, M. K. Ng, H. Rong, and Z. Li, Automated variable weighting in k-means type clustering, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.27, issue.5, pp.657-668, 2005.
DOI : 10.1109/TPAMI.2005.95

B. Jacek, B. Marcin, D. Wlodzislaw, and K. Adam, Infosel++ library, 2014.

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

K. Anil and . Jain, Data clustering: 50 years beyond k-means, Pattern Recognition Letters, issue.8, pp.31-651, 2010.

C. Jin, J. Yu, A. Zhou, and F. Cao, Efficient clustering of uncertain data streams, Knowledge and Information Systems, vol.28, issue.1, pp.1-31, 2013.
DOI : 10.1145/1376616.1376698

L. Jing, M. K. Ng, and J. Z. Huang, An Entropy Weighting k-Means Algorithm for Subspace Clustering of High-Dimensional Sparse Data, IEEE Transactions on Knowledge and Data Engineering, vol.19, issue.8, pp.1026-1041, 2007.
DOI : 10.1109/TKDE.2007.1048

L. Jinyan and L. Huiqing, Kent ridge bio-medical data set repository, 2014.

J. Júdice, M. Raydan, S. S. Rosa, and S. A. Santos, On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm, Numerical Algorithms, vol.13, issue.3, pp.391-407, 2008.
DOI : 10.1090/S0025-5718-03-01614-4

H. Julia and K. Joshua, Cluster generators for large high-dimensional data sets with large numbers of clusters

L. Kaufman and P. Rousseeuw, Clustering by Means of Medoids, Reports of the Faculty of Mathematics and Informatics. Faculty of Mathematics and Informatics, 1987.

E. Keogh, X. Xi, L. Wei, and C. A. Ratanamahatana, The ucr time series classification/clustering homepage [www.cs.ucr, 2006.

E. Kokiopoulou, D. Kressner, N. Paragios, and P. Frossard, Optimal Image Alignment With Random Projections of Manifolds: Algorithm and Geometric Analysis, Proceedings of EUSIPCO, 2009.
DOI : 10.1109/TIP.2010.2102044

P. Kudová, Clustering Genetic Algorithm, 18th International Conference on Database and Expert Systems Applications (DEXA 2007), pp.138-142, 2007.
DOI : 10.1109/DEXA.2007.65

P. J. Laurent, Approximation et optimisation, volume 1 of Collection Enseignement des sciences, 1972.

M. , L. Hoai, and M. T. Ta, Dc programming and dca for solving minimum sum-of-squares clustering using weighted dissimilarity measures. Transaction Computational Collective Intelligence, pp.113-131, 2014.

M. L. Hoai, H. A. Le-thi, T. Pham-dinh, and P. Bouvry, A deterministic optimization approach for generating highly nonlinear balanced boolean functions in cryptography, Modeling, Simulation and Optimization of Complex Processes, pp.381-391, 2008.

M. L. Hoai, H. A. Le-thi, T. Pham-dinh, and P. Bouvry, A combined dca: Ga for constructing highly nonlinear balanced boolean functions in cryptography, Journal of Global Optimization, vol.47, issue.4, pp.597-613, 2010.

M. L. Hoai, A. Yassine, and R. Moussi, Dca for solving the scheduling of lifting vehicle in an automated port container terminal, Computational Management Science, vol.9, issue.2, pp.273-286, 2012.

M. L. Hoai, H. A. Le-thi, and M. C. Nguyen, Dca based algorithms for feature selection in semi-supervised support vector machines, Machine Learning and Data Mining in Pattern Recognition, pp.528-542, 2013.

M. L. Hoai, H. A. Le-thi, T. Pham-dinh, and V. N. Huynh, Block clustering based on difference of convex functions (dc) programming and dc algorithms, Neural Computation, issue.10, pp.252776-2807, 2013.

M. L. Hoai, T. B. Nguyen, M. T. Ta, and H. A. Le-thi, Image segmentation via feature weighted fuzzy clustering by a dca based algorithm, Advanced Computational Methods for Knowledge Engineering, pp.53-63

H. A. Le-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, 1994.

H. A. Le-thi, ContributionàContributionà l'optimisation non convexe et l'optimisation globale: Théorie, Algoritmes et Applications, 1997.

H. A. Le-thi, Dc programming and dca in machine learning, 2012.

H. A. Le-thi and M. Moeini, Long-Short Portfolio Optimization Under Cardinality Constraints by Difference of Convex Functions Algorithm, Journal of Optimization Theory and Applications, vol.196, issue.1???2, pp.199-224, 2014.
DOI : 10.1016/j.ejor.2008.03.015

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

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

H. A. Le-thi and T. Pham-dinh, Dc programming approach for solving the multidimensional scaling problem. Nonconvex Optimizations and Its Applications: Special Issue From Local to Global Optimization, pp.231-276, 2001.

H. A. Le-thi and T. Pham-dinh, Dc programming: Theory, algorithms and applications, The State of the Proceedings of The First International Workshop on Global Constrained Optimization and Constraint Satisfaction (Cocos' 02), 2002.

H. A. Le-thi and T. Pham-dinh, Large-scale molecular optimization from distance matrices by a d.c. optimization approach, SIAM Journal on Optimization, vol.14, issue.1, pp.77-114, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01636768

H. A. Le-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 Operation Research, vol.133, pp.1-423, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01636759

H. A. Le-thi and T. Pham-dinh, DC programming in communication systems: challenging problems and methods, Vietnam Journal of Computer Science, vol.56, issue.10, pp.15-28
DOI : 10.1109/TVT.2006.873836

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

H. A. Le-thi and D. Q. Tran, Solving continuous min max problem for single period portfolio selection with discrete constraints by DCA, Optimization, vol.8, issue.8, pp.611025-1038, 2012.
DOI : 10.1016/S0165-1889(99)00088-3

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

H. A. Le-thi and D. Q. Tran, Optimizing a multi-stage production/inventory system by DC programming based approaches, Computational Optimization and Applications, vol.8, issue.1, pp.441-468, 2014.
DOI : 10.1016/0305-0483(80)90003-1

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

H. A. Le-thi, T. Pham-dinh, and M. L. Dung, Exact penalty in d.c. programming, Vietnam Journal of Mathematics, vol.27, issue.2, pp.169-178, 1999.
URL : https://hal.archives-ouvertes.fr/hal-01664702

H. A. Le-thi, T. Pham-dinh, and V. T. Nguyen, 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. A. Le-thi, M. T. Belghiti, and T. Pham-dinh, A new efficient algorithm based on dc programming and dca for clustering, Journal of Global Optimization, vol.37, issue.4, pp.593-608, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01636755

H. A. 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, issue.3, pp.1067-1085, 2007.

H. A. Le-thi, M. L. Hoai, and T. Pham-dinh, Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms, Advances in Data Analysis and Classification, vol.15, issue.3, pp.85-104, 2007.
DOI : 10.1515/9781400873173

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

H. A. Le-thi, T. P. Nguyen, and T. Pham-dinh, A continuous dc programming approach to the strategic supply chain design problem from qualified partner set, European Journal of Operational Research, vol.183, issue.3, pp.1001-1012, 2007.

H. A. Le-thi, M. L. Hoai, T. P. Nguyen, and T. Pham-dinh, Noisy image segmentation by a robust clustering algorithm based on dc programming and dca, ICDM, pp.72-86, 2008.

H. A. Le-thi, M. L. Hoai, V. V. Nguyen, and T. Pham-dinh, A DC programming approach for feature selection in support vector machines learning, Advances in Data Analysis and Classification, vol.3, issue.1???3, pp.259-278, 2008.
DOI : 10.1007/978-1-4757-2440-0

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

H. A. Le-thi, M. L. Hoai, V. V. Nguyen, and T. Pham-dinh, Combined feature selection and classification using DCA, 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies, pp.233-239, 2008.
DOI : 10.1109/RIVF.2008.4586361

H. A. Le-thi, Q. T. Nguyen, K. Phan-tran, and T. Pham-dinh, Energy minimization-based cross-layer design in wireless networks, Proceeding of the High Performance Computing & Simulation Conference, pp.283-289, 2008.

H. A. Le-thi, V. V. Nguyen, and O. Samir, Gene Selection for Cancer Classification Using DCA, Advanced Data Mining and Applications, pp.62-72, 2008.
DOI : 10.1007/978-3-540-88192-6_8

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

H. A. Le-thi, M. Moeini, and T. Pham-dinh, Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA, Computational Management Science, vol.20, issue.3, pp.459-475, 2009.
DOI : 10.1515/9781400873173

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

H. A. Le-thi, M. Moeini, and T. Pham-dinh, DC programming approach for portfolio optimization under step increasing transaction costs, Optimization, vol.22, issue.3, pp.267-289, 2009.
DOI : 10.1016/j.amc.2005.05.005

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

H. A. Le-thi, Q. T. Nguyen, H. T. Nguyen, and T. Pham-dinh, Solving the earliness tardiness scheduling problem by dc programming and dca, Mathematica Balkanica, pp.271-288, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01664541

H. A. Le-thi, Q. T. Nguyen, H. T. Nguyen, and T. Pham-dinh, A time-indexed formulation of earliness tardiness scheduling via dc programming and dca, Computer Science and Information Technology IMCSIT '09. International Multiconference on, pp.779-784, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01025671

H. A. Le-thi, T. Pham-dinh, and S. Bouallagui, Cryptanalysis of an identification scheme based on the perceptron problem using a hybridization of deterministic optimization and genetic algorithm, Proceedings of the 2009 International Conference on Security and Management, World Congress in Computer Science Computer Engineering, and Applied Computing, pp.117-123, 2009.

H. A. Le-thi, T. Pham-dinh, and V. N. Huynh, Exact penalty techniques in dc programming, Journal of Global Optimization, pp.1-27, 2011.

H. A. Le-thi, T. Pham-dinh, and V. N. Huynh, Exact penalty and error bounds in DC programming, Journal of Global Optimization, vol.92, issue.2, pp.509-535, 2012.
DOI : 10.1007/s101070100278

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

H. A. Le-thi, T. Pham-dinh, and D. Q. Tran, A DC programming approach for a class of bilevel programming problems and its application in portfolio selection, Numerical Algebra, Control and Optimization (NACO), vol.2, issue.1, pp.167-185, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01636726

H. A. Le-thi, M. T. Le, and T. B. Nguyen, A novel approach to automated cell counting based on a difference of convex functions algorithm (dca), Computational Collective Intelligence. Technologies and Applications, pp.336-345

H. A. Le-thi, M. L. Hoai, T. Pham-dinh, and V. N. Huynh, Binary classification via spherical separator by DC programming and DCA, Journal of Global Optimization, vol.15, issue.4, pp.1393-1407, 2013.
DOI : 10.1162/08997660360581958

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

H. A. Le-thi, T. B. Nguyen, and M. L. Hoai, Sparse Signal Recovery by Difference of Convex Functions Algorithms, Intelligent Information and Database Systems, pp.387-397
DOI : 10.1007/978-3-642-36543-0_40

H. A. Le-thi, D. Q. Tran, and H. A. Kondo, A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors, Journal of Industrial and Management Optimization (JIMO), pp.1-20, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01387300

H. A. Le-thi, X. T. Vo, and T. Pham-dinh, Robust Feature Selection for SVMs under Uncertain Data, Advances in Data Mining. Applications and Theoretical Aspects, pp.151-165
DOI : 10.1007/978-3-642-39736-3_12

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

H. A. Le-thi, P. Damel, P. Nadège, and T. P. Nguyen, The Confrontation of Two Clustering Methods in Portfolio Management: Ward???s Method Versus DCA Method, Advanced Computational Methods for Knowledge Engineering of Advances in Intelligent Systems and Computing, pp.87-98, 2014.
DOI : 10.1007/978-3-319-06569-4_6

H. A. Le-thi, A. V. Le, X. T. Vo, and Z. Ahmed, A Filter Based Feature Selection Approach in MSVM Using DCA and Its Application in Network Intrusion Detection, Intelligent Information and Database Systems, pp.403-413, 2014.
DOI : 10.1007/978-3-319-05458-2_42

H. A. Le-thi, M. L. Hoai, and T. Pham-dinh, New and efficient dca based algorithms for minimum sum-of-squares clustering, Pattern Recognition, vol.47, issue.1, pp.388-401, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01636670

H. A. Le-thi and M. Moeini, Portfolio selection under buy-in threshold constraints using dc programming and dca, Service Systems and Service Management, pp.296-300, 2006.

H. A. Le-thi, Dc programming and dca, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01664024

. Kwong-sak, Y. Leung, and . Liang, Adaptive elitist-population based genetic algorithm for multimodal function optimization, Genetic and Evolutionary Computation - GECCO'2003, pp.1160-1171, 2003.

Y. Liang and K. Leung, Genetic Algorithm with adaptive elitist-population strategies for multimodal function optimization, Applied Soft Computing, vol.11, issue.2, pp.2017-2034, 2011.
DOI : 10.1016/j.asoc.2010.06.017

Y. Linde, A. Buzo, and R. M. Gray, An Algorithm for Vector Quantizer Design, IEEE Transactions on Communications, vol.28, issue.1, pp.84-95, 1980.
DOI : 10.1109/TCOM.1980.1094577

M. Lemaitre, X. Rastgoo, F. Rafael, P. Miralles, and . Casale, Pruning adaboost for continuous sensors mining applications, Ubiquitous Data Mining Works, 20th European Conference in Artificial Intelligence -ECAI, pp.53-57, 2012.

J. Macqueen, Some methods for classification and analysis of multivariate observations, 5-th Berkeley Symposium on Mathematical Statistics and Probability, pp.281-297, 1967.

P. C. Mahalanobis, On the generalised distance in statistics, Proceedings of the National Institute of Sciences, India, pp.49-55, 1936.

T. Mamadou, T. Pham-dinh, and H. A. Le-thi, A dc programming approach for sparse eigenvalue problem, Internationale Conference on Machine learninh ICML 2010, pp.1063-1070, 2010.

Z. Asghari-varzaneh-marjan-kuchaki-rafsanjani and N. Emami-chukanlo, A survey of hierarchical clustering algorithms, The Journal of Mathematics and Computer Science, vol.5, issue.3, pp.229-240, 2012.

D. Martin, C. Fowlkes, D. Tal, and J. Malik, A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001, pp.416-423, 2001.
DOI : 10.1109/ICCV.2001.937655

V. Melnykov, W. Chen, and R. Maitra, Package for Simulating Data to Study Performance of Clustering Algorithms, Journal of Statistical Software, vol.51, issue.12, pp.1-25
DOI : 10.18637/jss.v051.i12

G. Milligan and M. Cooper, An examination of procedures for determining the number of clusters in a data set, Psychometrika, vol.77, issue.2, pp.159-179, 1985.
DOI : 10.1080/00223980.1963.9916640

M. Mohri and A. Medina, Learning theory and algorithms for revenue optimization in second-price auctions with reserve, Proceedings of the 31st International Conference on Machine Learning, 2014.

M. Mokhtar, A. Shuib, and D. Mohamad, Mathematical programming models for portfolio optimization problem: A review, International Journal of Social, Human Science and Engineering, vol.8, issue.2, pp.76-83

B. Ndiaye, T. Pham-dinh, and H. A. Le-thi, Single straddle carrier routing problem in port container terminals: Mathematical model and solving approaches, International Journal of Intelligent Information and Database Systems IJIIDS, pp.21-31, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01664533

C. L. Blake, D. J. Newman, and C. J. Merz, UCI repository of machine learning databases, 2014.

R. T. Ng and J. Han, Clarans: a method for clustering objects for spatial data mining. Knowledge and Data Engineering, IEEE Transactions on, vol.14, issue.5, pp.1003-1016, 2002.

C. N. Nguyen, H. A. Le-thi, and T. Pham-dinh, A branch and bound algorithm based on dc programming and dca for strategic capacity planning in supply chain design for a new market opportunity, Operations Research Proceedings 2006, volume 2006 of Operations Research Proceedings, pp.515-520, 2007.

D. M. Nguyen, H. A. Le-thi, and T. Pham-dinh, A Cross-Entropy Method for Value-at-Risk Constrained Optimization, Intelligent Information and Database Systems, pp.442-451, 2011.
DOI : 10.1023/A:1010091220143

Q. T. Nguyen and H. A. Le-thi, Solving an Inventory Routing Problem in Supply Chain by DC Programming and DCA, Intelligent Information and Database Systems, pp.432-441, 2011.
DOI : 10.1007/978-3-540-87477-5_40

S. Nittel and K. T. Leung, Parallelizing clustering of geoscientific data sets using data streams, Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004., pp.73-84, 2004.
DOI : 10.1109/SSDM.2004.1311195

S. Nittel, K. T. Leung, and A. Braverman, Scaling clustering algorithms for massive data sets using data streams, Proceedings. 20th International Conference on Data Engineering, p.830, 2004.
DOI : 10.1109/ICDE.2004.1320061

O. Liadan, A. Callaghan, R. Meyerson, N. Motwani, S. Mishra et al., Streaming-data algorithms for high-quality clustering, ICDE, pp.685-694, 2002.

N. R. 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

G. K. Palshikar, Simple Algorithms for Peak Detection in Time-Series, Proceeding 1st International Conference Advanced Data Analysis, Business Analytics and Intelligence, 2009.

W. Pan, X. Shen, and B. Liu, Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty, Journal of Machine Learning Research, vol.14, issue.1, pp.1865-1889, 2013.

V. N. Pham, H. A. Le-thi, and T. Pham-dinh, A dc programming framework for portfolio selection by minimizing the transaction costs, Advanced Computational Methods for Knowledge Engineering, pp.31-40

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, Algorithms for solving a class of non convex optimization problems. Methods of subgradients, 1986.

T. , P. Dinh, and S. E. Bernoussi, Duality in d. c. (difference of convex functions) optimization . Subgradient methods. Trends in mathematical optimization, 4th French-German Conference, pp.277-293, 1986.

T. , P. Dinh, and H. A. Le-thi, Convex analysis approach to d.c. programming: theory, algorithms and applications, Acta Mathematica Vietnamica, vol.22, issue.1, pp.289-355, 1997.
URL : https://hal.archives-ouvertes.fr/hal-01664714

T. , P. Dinh, and H. A. Le-thi, Recent advances in dc programming and dca, Transactions on Computational Collective Intelligence, vol.8342, pp.1-37, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01664024

T. , P. Dinh, and H. A. Le-thi, Dc optimization algorithms for solving the trust region subproblem, SIAM Journal of Optimization, vol.8, issue.2, pp.476-505, 1998.

T. Pham-dinh, C. N. Nguyen, and H. A. Le-thi, DC programming and DCA for globally solving the value-at-risk, Computational Management Science, vol.8, issue.1, pp.477-501, 2009.
DOI : 10.21314/JOR.2000.038

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

T. Pham-dinh, V. N. Pham, and H. A. Le-thi, DC Programming and DCA for Portfolio Optimization with Linear and Fixed Transaction Costs, Intelligent Information and Database Systems, pp.392-402
DOI : 10.1007/978-3-319-05458-2_41

D. N. Phan, M. C. Nguyen, and H. A. Le-thi, A dc programming approach for sparse linear discriminant analysis, Advanced Computational Methods for Knowledge Engineering of Advances in Intelligent Systems and Computing, pp.65-74

S. Sultan-noman-qasem and . Shamsuddin, Memetic Elitist Pareto Differential Evolution algorithm based Radial Basis Function Networks for classification problems, Applied Soft Computing, vol.11, issue.8, pp.5565-5581, 2011.
DOI : 10.1016/j.asoc.2011.05.002

N. J. Radcliffe, Equivalence class analysis and presentation of strong rules, In Knowledge Discovery in Database, vol.11, pp.229-248, 1991.

J. Ren, R. Ma, and J. Ren, Density-Based Data Streams Clustering over Sliding Windows, 2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery, pp.248-252, 2009.
DOI : 10.1109/FSKD.2009.553

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

J. Sarma and K. Jong, Selection: generation gap methods, Handbook on Evolutionary Computation, pp.21-23, 1997.

C. Schnörr, Signal and image approximation with level-set constraints, Computing, vol.27, issue.2, pp.137-160, 2007.
DOI : 10.1017/CBO9780511983658

S. Sharma and S. Rai, Genetic k-means algorithm -implementation and analysis, International Journal of Recent Technology and Engineering (IJRTE), vol.1, issue.2, pp.117-120, 2012.

A. Gomes and D. Silva, European workshop on data stream analysis In Analyzing the Evolution of Web Usage Data, pp.77-79, 2007.

W. Skarbek and A. Koschan, Colour image segmentation: A survey, 1994.

W. , N. Street, and Y. Kim, A streaming ensemble algorithm (sea) for large-scale classification, Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '01, pp.377-382, 2001.

A. S. Ta, H. A. Le-thi, D. Khadraoui, and T. Pham-dinh, Solving qos routing problems by dca, Intelligent Information and Database Systems, pp.460-470, 2010.

A. S. Ta, H. A. Le-thi, D. Khadraoui, and T. Pham-dinh, Solving multicast qos routing problem in the context v2i communication services using dca, Computer and Information Science (ICIS) IEEE/ACIS 9th International Conference, pp.471-476, 2010.

A. S. Ta, H. A. Le-thi, D. Khadraoui, and T. Pham-dinh, Solving Partitioning-Hub Location-Routing Problem using DCA, Journal of Industrial and Management Optimization, vol.8, issue.1, pp.87-102, 2012.
DOI : 10.3934/jimo.2012.8.87

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

A. S. Ta, T. Pham-dinh, H. A. Le-thi, and D. Khadraoui, Solving many to many multicast qos routing problem using dca and proximal decomposition technique, International Conference on Computing, Networking and Communications (ICNC2012), pp.809-814, 2012.

L. Tang, L. Chang-jie-tang, C. Duan, Y. Li, C. Xi-jiang et al., MovStream: An efficient algorithm for monitoring clusters evolving in data streams, 2008 IEEE International Conference on Granular Computing, pp.582-587, 2008.
DOI : 10.1109/GRC.2008.4664715

X. Tian, G. Gasso, and S. Canu, A multiple kernel framework for inductive semi-supervised SVM learning, Advances in artificial neural networks, machine learning, and computational intelligence, pp.46-58, 2011.
DOI : 10.1016/j.neucom.2011.12.036

J. F. Toland, Duality in nonconvex optimization, Journal of Mathematical Analysis and Applications, vol.66, issue.2, pp.399-415, 1978.
DOI : 10.1016/0022-247X(78)90243-3

L. Tu and Y. Chen, Stream data clustering based on grid density and attraction, ACM Transactions on Knowledge Discovery from Data, vol.3, issue.3, pp.1-12, 2009.
DOI : 10.1145/1552303.1552305

J. B. Urruty, Generalized differentiability duality and optimization for problem dealing with differences of convex functions, Lecture Notes in Economics and Mathematical Systems, vol.256, pp.260-277, 1986.

L. Vendramin, R. J. Campello, and E. R. Hruschka, On the Comparison of Relative Clustering Validity Criteria, Proceedings of the SIAM International Conference on Data Mining, pp.733-744, 2009.
DOI : 10.1137/1.9781611972795.63

J. and V. Llahi, Color Constancy and Image Segmentation Techniques for Applications to Mobile Robotics, 2005.

H. D. Vinod, Integer Programming and the Theory of Grouping, Journal of the American Statistical Association, vol.15, issue.5, pp.506-519, 1969.
DOI : 10.1080/01621459.1963.10500845

N. Vucic, S. Shi, and M. Schubert, Dc programming approach for resource allocation in wireless networks, WiOpt, pp.380-386, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00502213

J. Wang, X. Shen, and W. Pan, On efficient large margin semisupervised learning: Method and theory, Journal of Machine Learning Research, vol.10, pp.719-742, 2009.

K. Wang, P. Zhong, and Y. Zhao, Training robust support vector regression via d. c. program, Journal of Information & Computational Science, vol.7, issue.12, pp.2385-2394, 2010.

S. Weber, T. Schüle, A. Kuba, and C. Schnörr, Binary Tomography with Deblurring, Combinatorial Image Analysis, pp.375-388, 2006.
DOI : 10.1007/11774938_30

D. Whitley, An overview of evolutionary algorithms: practical issues and common pitfalls. Information and Software Technology, pp.817-831, 2001.

C. Wu, C. Li, and Q. Long, A DC programming approach for sensor network localization with uncertainties in anchor positions, Journal of Industrial and Management Optimization, vol.10, issue.3, pp.817-826, 2014.
DOI : 10.3934/jimo.2014.10.817

L. Yang and L. Wang, A class of semi-supervised support vector machines by DC programming, Advances in Data Analysis and Classification, vol.112, issue.15, pp.417-433, 2013.
DOI : 10.1016/j.talanta.2013.03.016

Y. Ying, K. Huang, and C. Campbell, Enhanced protein fold recognition through a novel data integration approach, BMC Bioinformatics, vol.10, issue.1, p.267, 2009.
DOI : 10.1186/1471-2105-10-267

A. L. Yuille and A. Rangarajan, The Concave-Convex Procedure, Neural Computation, vol.39, issue.4, pp.915-936, 2003.
DOI : 10.1162/08997660260028674

C. Zhang, C. Jin, and A. Zhou, Efficiently Clustering Probabilistic Data Streams, pp.273-284, 2009.
DOI : 10.1145/1265530.1265565

T. Zhang, R. Ramakrishnan, and M. Livny, Birch: An efficient data clustering method for very large databases, Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pp.103-114, 1996.

Y. Zhong and E. Aghezzaf, A dc programming approach to solve the singlevehicle inventory routing problem, Proceedings of the international conference CIE39, 2009.

Y. Zhong and E. Aghezzaf, Combining DC-programming and steepest-descent to solve the single-vehicle inventory routing problem, Computers & Industrial Engineering, vol.61, issue.2, pp.313-321, 2011.
DOI : 10.1016/j.cie.2011.02.006

A. Zhou, F. Cao, W. Qian, and C. Jin, Tracking clusters in evolving data streams over sliding windows, Knowledge and Information Systems, vol.15, issue.2, pp.181-214, 2008.
DOI : 10.1007/s10115-007-0070-x

X. Zhu, W. Ding, P. S. Yu, and C. Zhang, One-class learning and concept summarization for data streams, Knowledge and Information Systems, vol.9, issue.3, pp.523-553, 2011.
DOI : 10.1007/s10115-005-0212-y

X. Zhu, Stream data mining repository, 2014.