Skip to Main content Skip to Navigation

Approches de la programmation DC et DCA en data mining : modélisation parcimonieuse de données.

Abstract : In this thesis, we investigate the DC Programming and DCA approaches in DataMining. More precisely, we are interested in the sparse approximation problems in sparse modelling. The work focuses on theoretical and algorithmic studies, mainly based on DC Programming and DCA. We established interesting properties concerning DC and quadratic reformulations for these problems with the help of new exact penalty techniques in DC programming. These results give new insights on these sparse approximation problems and so allow a better understanding and a better handling of these problems. These novel techniques were applied in both contexts of sparse eigenvalue problem and sparse approximation in linear models.The simple and nice structure of the obtained reformulations are suitably adapted to DC programming and DCA. Computational experiments are very interesting and promising, illustrating the potential of the novel approach.
Document type :
Complete list of metadatas

Cited literature [163 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Tuesday, February 7, 2012 - 10:28:08 AM
Last modification on : Friday, November 29, 2019 - 3:15:55 AM
Long-term archiving on: : Tuesday, May 8, 2012 - 2:22:28 AM


Version validated by the jury (STAR)


  • HAL Id : tel-00667179, version 1


Mamadou Thiao. Approches de la programmation DC et DCA en data mining : modélisation parcimonieuse de données.. Autre [q-bio.OT]. INSA de Rouen, 2011. Français. ⟨NNT : 2011ISAM0015⟩. ⟨tel-00667179⟩



Record views


Files downloads