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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Neural computation Ročník 25; číslo 10; s. 2776
Hlavní autoři: Le, Hoai Minh, Le Thi, Hoai An, Dinh, Tao Pham, Huynh, Van Ngai
Médium: Journal Article
Jazyk:angličtina
Vydáno: United States 01.10.2013
Témata:
Algorithms
Artificial Intelligence
Brain Neoplasms - pathology
Cluster Analysis
Computer Simulation
Databases, Factual
Fuzzy Logic
Humans
Lung Neoplasms - pathology
Neoplasms - pathology
Problem Solving
Software
ISSN:1530-888X, 1530-888X
On-line přístup:Zjistit podrobnosti o přístupu
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 are developed to build an appropriate equivalent DC program of the block clustering problem. They lead to an elegant and explicit DCA scheme for the resulting DC program. Computational experiments show the robustness and efficiency of the proposed algorithm and its superiority over standard algorithms such as two-mode K-means, two-mode fuzzy clustering, and block classification EM.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1530-888X
1530-888X
DOI:10.1162/NECO_a_00490