Block Clustering Based on Difference of Convex Functions (DC) Programming and DC Algorithms | Citedby Results | Neural Computation | MIT Press

Skip to Main Content

Skip Nav Destination

Block Clustering Based on Difference of Convex Functions (DC) Programming and DC Algorithms

Neural Computation (2013) 25 (10): 2776–2807.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Open issues and recent advances in DC programming and DCA

Hoai An Le Thi
Tao Pham Dinh

Journal of Global Optimization (2023)

Collaborative DCA: An intelligent collective optimization scheme, and its application for clustering

Hoai An Le Thi
Ngoc Thanh Nguyen
Edward Szczerbicki
Bogdan Trawiński
Van Du Nguyen

Journal of Intelligent & Fuzzy Systems (2019) 37 (6): 7511.

DC programming and DCA: thirty years of developments

Hoai An Le Thi
Tao Pham Dinh

Mathematical Programming (2018) 169 (1): 5.

Efficient approaches for ℓ 2-ℓ 0 regularization and applications to feature selection in SVM

Hoai An Le Thi
Tao Pham Dinh
Mamadou Thiao

Applied Intelligence (2016) 45 (2): 549.

Efficient Nonnegative Matrix Factorization by DC Programming and DCA

Hoai An Le Thi
Xuan Thanh Vo
Tao Pham Dinh

Neural Computation (2016) 28 (6): 1163.

DC approximation approaches for sparse optimization

H.A. Le Thi
T. Pham Dinh
H.M. Le
X.T. Vo

European Journal of Operational Research (2015) 244 (1): 26.

Self-organizing maps by difference of convex functions optimization

Hoai An Le Thi
Manh Cuong Nguyen

Data Mining and Knowledge Discovery (2014) 28 (5-6): 1336.