The Geodesic Classification Problem on Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Electronic Notes in Theoretical Computer Science Year : 2019

The Geodesic Classification Problem on Graphs


Motivated by the significant advances in integer optimization in the past decade, Bertsimas and Shioda developed an integer optimization method to the classical statistical problem of classification in a multi-dimensional space, delivering a software package called CRIO (Classification and Regression via Integer Optimization). Following those ideas, we define a new classification problem, exploring its combinatorial aspects. That problem is defined on graphs using the geodesic convexity as an analogy of the Euclidean convexity in the multidimensional space. We denote such a problem by Geodesic Classification (GC) problem. We propose an integer programming formulation for the GC problem along with a branch-and-cut algorithm to solve it. Finally, we show computational experiments in order to evaluate the combinatorial optimization efficiency and classification accuracy of the proposed approach.
Fichier principal
Vignette du fichier
MacedodeAraujoetal2019.pdf (382.23 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02393316 , version 1 (04-12-2019)



Paulo Henrique Macêdo de Araújo, Manoel Campêlo, Ricardo Correa, Martine Labbé. The Geodesic Classification Problem on Graphs. Electronic Notes in Theoretical Computer Science, 2019, 346, pp.65 - 76. ⟨10.1016/j.entcs.2019.08.007⟩. ⟨hal-02393316⟩
27 View
85 Download



Gmail Facebook Twitter LinkedIn More