Members

Vincent Branders

Contact Information

Vincent Branders
PhD Student
UCL / EPL / ICTEAM / INGI
Place Sainte Barbe, 2 bte L5.02.01
1348 Louvain-la-Neuve
Belgium

Office: Réaumur A.158 (1st floor)
Phone: +32 10 47 91 06
Email: Vincent [period] Branders [snail] uclouvain [period] be

Biography

Vincent Branders

Vincent Branders is a PhD Student in the Machine Learning Group of the Université catholique de Louvain.



Publications

Article de périodique (Journal article)
2019
  • Branders, Vincent ; Schaus, Pierre ; Dupont, Pierre. Identifying gene-specific subgroups: an alternative to biclustering. In: BMC Bioinformatics, Vol. 20, no.625, p. 13 (2019). doi:10.1186/s12859-019-3289-0. http://hdl.handle.net/2078.1/223506

  • Communication à un colloque (Conference Paper)
  • Branders, Vincent ; Derval, Guillaume ; Schaus, Pierre ; Dupont, Pierre. Mining a Maximum Weighted Set of Disjoint Submatrices. Discovery Science. In: Discovery Science : Lecture Notes in Computer Science (LNCS), Springer, 2019. 9783030337773, p. 18-28. doi:10.1007/978-3-030-33778-0_2. http://hdl.handle.net/2078.1/223472

  • 2017
  • Branders, Vincent ; Schaus, Pierre ; Dupont, Pierre. Mining a sub-matrix of maximal sum. 6th International Workshop on New Frontiers in Mining Complex Patterns in conjunction with ECML-PKDD 2017 (Skopje (MK), 22/09/2017). In: Proceedings of the 6th International Workshop on New Frontiers in Mining Complex Patterns in conjunction with ECML-PKDD 2017. http://hdl.handle.net/2078.1/189737

  • Contribution à ouvrage collectif (Book Chapter)
    2019
  • Derval, Guillaume ; Branders, Vincent ; Dupont, Pierre ; Schaus, Pierre. The Maximum Weighted Submatrix Coverage Problem: A CP Approach. In: Louis-Martin Rousseau, Kostas Stergiou, Integration of Constraint Programming, Artificial Intelligence, and Operations Research : Lecture Notes in Computer Science (Lecture Notes in Computer Science; 11494), Springer, Cham, 2019, p. 258-274. 978-3-030-19212-9. doi:10.1007/978-3-030-19212-9_17. http://hdl.handle.net/2078.1/218893

  • 2018
  • Branders, Vincent ; Schaus, Pierre ; Dupont, Pierre. Combinatorial Optimization Algorithms to Mine a Sub-Matrix of Maximal Sum. In: Annalisa Appice, Corrado Loglisci, Giuseppe Manco, Elio Masciari, Zbigniew W. Ras, New Frontiers in Mining Complex Patterns (Lecture notes in computer science; vol 10785), 2018, p. 65-79. 978-3-319-78679-7. doi:10.1007/978-3-319-78680-3_5. http://hdl.handle.net/2078.1/196614