Skip to Main content Skip to Navigation
Journal articles

Scale Genetic Programming for large Data Sets: Case of Higgs Bosons Classification

Abstract : Extract knowledge and significant information from very large data sets is a main topic in Data Science, bringing the interest of researchers in machine learning field. Several machine learning techniques have proven effective to deal with massive data like Deep Neuronal Networks. Evolutionary algorithms are considered not well suitable for such problems because of their relatively high computational cost. This work is an attempt to prove that, with some extensions, evolutionary algorithms could be an interesting solution to learn from very large data sets. We propose the use of the Cartesian Genetic Programming (CGP) as meta-heuristic approach to learn from the Higgs big data set. CGP is extended with an active sampling technique in order to help the algorithm to deal with the mass of the provided data. The proposed method is able to take up the challenge of dealing with the complete benchmark data set of 11 million events and produces satisfactory preliminary results.
Document type :
Journal articles
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download
Contributor : Sana Ben Hamida <>
Submitted on : Friday, September 13, 2019 - 1:52:17 PM
Last modification on : Wednesday, October 28, 2020 - 9:52:06 AM
Long-term archiving on: : Saturday, February 8, 2020 - 11:26:13 AM


Scale Genetic Programming for ...
Publisher files allowed on an open archive



Hmida Hmida, Sana Ben Hamida, Amel Borgi, Marta Rukoz. Scale Genetic Programming for large Data Sets: Case of Higgs Bosons Classification. Procedia Computer Science, Elsevier, 2018, 126, pp.302-311. ⟨10.1016/j.procs.2018.07.264⟩. ⟨hal-02286084⟩



Record views


Files downloads