Block clustering based on difference of convex functions (DC) programming and DC algorithms

We investigate difference of convex functions (DC) programming and the DC algorithm (DCA) to solve the block clustering problem in the continuous framework, which traditionally requires solving a hard combinatorial optimization problem. DC reformulation techniques and exact penalty in DC programming...

Full description

Saved in:
Bibliographic Details
Published in:Neural computation Vol. 25; no. 10; p. 2776
Main Authors: Le, Hoai Minh, Le Thi, Hoai An, Dinh, Tao Pham, Huynh, Van Ngai
Format: Journal Article
Language:English
Published: United States 01.10.2013
Subjects:
ISSN:1530-888X, 1530-888X
Online Access:Get more information
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first