Data

Tools

Indexes

Applications

Experiments

Awesome

An open API service indexing awesome lists of open source software.

https://github.com/sherstpasha/thefittest

Implementation of data mining methods that use evolutionary algorithms
https://github.com/sherstpasha/thefittest

algorithm differential-evolution evolutionary-algorithms genetic-algorithm genetic-programming heuristic-search optimization optimization-algorithms

Last synced: 5 months ago
JSON representation

Implementation of data mining methods that use evolutionary algorithms

Awesome Lists containing this project

README 

          
.. image:: https://img.shields.io/pypi/v/thefittest?label=PyPI%20-%20Package%20version

    :target: https://pypi.org/project/thefittest/

    :alt: PyPI - Package version

.. image:: https://static.pepy.tech/badge/thefittest

    :target: https://pepy.tech/project/thefittest

    :alt: Downloads

.. image:: https://komarev.com/ghpvc/?username=thefittest

    :alt: Profile views

.. image:: https://codecov.io/github/sherstpasha/thefittest/coverage.svg?branch=master

    :alt: codecov.io

.. image:: https://app.codacy.com/project/badge/Grade/4c47b6de61c4422180529bbc360262c4

    :target: https://app.codacy.com/gh/sherstpasha/thefittest/dashboard?utm_source=gh&utm_medium=referral&utm_content=&utm_campaign=Badge_grade

    :alt: Codacy Badge

.. image:: https://img.shields.io/badge/code%20style-black-000000.svg

    :target: https://github.com/psf/black

    :alt: Code style: black

.. image:: https://readthedocs.com/projects/sherstpasha-pavel/badge/?version=latest&token=71adf5d63b55f0def96b09e1ce4c60f8d57cbdaed7db777117f34e4718d5a1ea

    :target: https://sherstpasha-pavel.readthedocs-hosted.com/ru/latest/?badge=latest

    :alt: Documentation Status

    

.. image:: docs/logos/logo1.png

   :align: center



``thefittest`` is an open-source library designed for the efficient application of classical evolutionary algorithms and their effective modifications in optimization and machine learning. Our project aims to provide performance, accessibility, and ease of use, opening up the world of advanced evolutionary methods to you.



Features of ``thefittest``

--------------------------



**Performance**

  Our library is developed using advanced coding practices and delivers high performance through integration with `NumPy `_, `Scipy `_, `Numba `_, and `scikit-learn `_.



**Versatility**

  ``thefittest`` offers a wide range of classical evolutionary algorithms and effective modifications, making it the ideal choice for a variety of optimization and machine learning tasks.



**Integration with scikit-learn**

  Easily integrate machine learning methods from ``thefittest`` with `scikit-learn `_ tools, creating comprehensive and versatile solutions for evolutionary optimization and model training tasks.



Installation

------------



**Basic installation** (for evolutionary algorithms and symbolic regression):



.. code-block:: bash



    pip install thefittest



This installation includes all evolutionary optimizers (GA, DE, SHADE, etc.) and symbolic regression with GP.



**Full installation with neural networks** (requires GPU with CUDA):



First, install PyTorch with CUDA support from the official website: https://pytorch.org/get-started/locally/



For example, for CUDA 12.4:



.. code-block:: bash



    pip3 install torch --index-url https://download.pytorch.org/whl/cu124



Then install thefittest:



.. code-block:: bash



    pip install thefittest



This enables neural network models (``MLPEAClassifier``, ``MLPEARegressor``, ``GeneticProgrammingNeuralNetClassifier``, ``GeneticProgrammingNeuralNetRegressor``) with GPU acceleration.



Usage Example

-------------



The following example demonstrates how to use ``thefittest`` library with the SHADE optimizer to minimize a custom objective function. This quick start example showcases the main components needed to set up and run an optimization.



.. code-block:: python



    from thefittest.optimizers import SHADE



    # Define the objective function to minimize

    def custom_problem(x):

        return (5 - x[:, 0])**2 + (12 - x[:, 1])**2



    # Initialize the SHADE optimizer with custom parameters

    optimizer = SHADE(

        fitness_function=custom_problem,

        iters=25,

        pop_size=10,

        left_border=-100,

        right_border=100,

        num_variables=2,

        show_progress_each=10,

        minimization=True,

    )



    # Run the optimization

    optimizer.fit()



    # Retrieve and print the best solution found

    fittest = optimizer.get_fittest()

    print('The fittest individ:', fittest['phenotype'])

    print('with fitness', fittest['fitness'])



Machine Learning Example

------------------------



This example demonstrates how to train a machine learning model on the Iris dataset using ``thefittest`` library's ``MLPEAClassifier`` with the SHAGA evolutionary optimizer.



.. code-block:: python



    from thefittest.optimizers import SHAGA

    from thefittest.benchmarks import IrisDataset

    from thefittest.classifiers import MLPEAClassifier



    from sklearn.model_selection import train_test_split

    from sklearn.preprocessing import minmax_scale

    from sklearn.metrics import confusion_matrix, f1_score



    # Load the Iris dataset

    data = IrisDataset()

    X = data.get_X()

    y = data.get_y()



    # Scale features to the [0, 1] range

    X_scaled = minmax_scale(X)



    # Split the data into training and test sets

    X_train, X_test, y_train, y_test = train_test_split(X_scaled, y, test_size=0.1)



    # Initialize the MLPEAClassifier with SHAGA as the optimizer

    model = MLPEAClassifier(

        n_iter=500,

        pop_size=500,

        hidden_layers=[5, 5],

        weights_optimizer=SHAGA,

        weights_optimizer_args={"show_progress_each": 10}

    )



    # Train the model

    model.fit(X_train, y_train)

    

    # Make predictions on the test set

    predict = model.predict(X_test)



    # Evaluate the model

    print("confusion_matrix: \n", confusion_matrix(y_test, predict))

    print("f1_score: \n", f1_score(y_test, predict, average="macro"))



Dependencies

------------



``thefittest`` requires the following packages (installed automatically with ``pip install thefittest``):



- `Python (>=3.7,<=3.13) `_;

- `numpy (>=1.26) `_;

- `numba (>=0.60) `_;

- `scipy `_;

- `scikit-learn (>=1.4) `_;

- `joblib (>=1.3.0) `_.



Optional dependencies

---------------------



Some extra packages can be installed manually if needed:



- `networkx `_ — required for visualization methods that work with objects such as ``Net`` and ``Tree``;

- `torch (>=2.0) `_ with **CUDA** support — required for neural network models (``MLPEAClassifier``, ``MLPEARegressor``, ``GeneticProgrammingNeuralNetClassifier``, ``GeneticProgrammingNeuralNetRegressor``). Install from https://pytorch.org/get-started/locally/



``thefittest`` contains methods

-------------------------------



- **Genetic algorithm** (Holland, J. H. (1992). Genetic algorithms. Scientific American, 267(1), 66-72):



  - **Self-configuring genetic algorithm** (`Semenkin, E.S., Semenkina, M.E. Self-configuring Genetic Algorithm with Modified Uniform Crossover Operator. LNCS, 7331, 2012, pp. 414-421. `_);

  - **SHAGA** (`Stanovov, Vladimir & Akhmedova, Shakhnaz & Semenkin, Eugene. (2019). Genetic Algorithm with Success History based Parameter Adaptation. 180-187. `_);

  - **PDPGA** (`Niehaus, J., Banzhaf, W. (2001); Adaption of Operator Probabilities in Genetic Programming. In: Miller, J., Tomassini, M., Lanzi, P.L., Ryan, C., Tettamanzi, A.G.B., Langdon, W.B. (eds) Genetic Programming. EuroGP 2001. Lecture Notes in Computer Science, vol 2038. Springer, Berlin, Heidelberg. `_).



- **Differential evolution** (Storn, Rainer & Price, Kenneth. (1995). Differential Evolution: A Simple and Efficient Adaptive Scheme for Global Optimization Over Continuous Spaces. Journal of Global Optimization. 23)



  - **jDE** (`Brest, Janez & Greiner, Sao & Bošković, Borko & Mernik, Marjan & Zumer, Viljem. (2007). Self-Adapting Control Parameters in Differential Evolution: A Comparative 13. 945 - 958. `_);

  - **SHADE** (`Tanabe, Ryoji & Fukunaga, Alex. (2013). Success-history based parameter adaptation for Differential Evolution. 2013 IEEE Congress on Evolutionary Computation, CEC 2013. 71-78. `_).



- **Genetic programming** (Koza, John R.. “Genetic programming - on the programming of computers by means of natural selection.” Complex Adaptive Systems (1993)):



  - **Self-configuring genetic programming** (`Semenkin, Eugene & Semenkina, Maria. (2012). Self-configuring genetic programming algorithm with modified uniform crossover. 1-6. `_).

  - **PDPGP** (`Niehaus, J., Banzhaf, W. (2001); Adaption of Operator Probabilities in Genetic Programming. In: Miller, J., Tomassini, M., Lanzi, P.L., Ryan, C., Tettamanzi, A.G.B., Langdon, W.B. (eds) Genetic Programming. EuroGP 2001. Lecture Notes in Computer Science, vol 2038. Springer, Berlin, Heidelberg. `_).



- **Genetic programming of neural networks (GPNN)** (`Lipinsky L., Semenkin E., Bulletin of the Siberian State Aerospace University., 3(10), 22-26 (2006). In Russian`_);

- **Multilayer perceptron trained by evolutionary algorithms** (`Cotta, Carlos & Alba, Enrique & Sagarna, R. & Larranaga, Pedro. (2002). Adjusting Weights in Artificial Neural Networks using Evolutionary Algorithms. `_);



Benchmarks

----------



- **CEC2005** (`Suganthan, Ponnuthurai & Hansen, Nikolaus & Liang, Jing & Deb, Kalyan & Chen, Ying-ping & Auger, Anne & Tiwari, Santosh. (2005). Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization. Natural Computing. 341-357`_);

- **Symbolicregression17. 17 test regression problem from the paper** (`Semenkin, Eugene & Semenkina, Maria. (2012). Self-configuring genetic programming algorithm with modified uniform crossover. 1-6. `_).

- **Iris** (`Fisher,R. A.. (1988). Iris. UCI Machine Learning Repository. `_);

- **Wine** (`Aeberhard,Stefan and Forina,M.. (1991). Wine. UCI Machine Learning Repository. `_);

- **Breast Cancer Wisconsin (Diagnostic)** (`Wolberg,William, Mangasarian,Olvi, Street,Nick, and Street,W.. (1995). Breast Cancer Wisconsin (Diagnostic). UCI Machine Learning Repository. `_);

- **Optical Recognition of Handwritten Digits** (`Alpaydin,E. and Kaynak,C.. (1998). Optical Recognition of Handwritten Digits. UCI Machine Learning Repository. `_);



Examples

--------



Notebooks on how to use ``thefittest``:



- `Solving Binary and Real-Valued Optimization Problems with Genetic Algorithms; `_

- `Solving Real-Valued Optimization Problems with Differential Evolution; `_

- `Solving Symbolic Regression Problems Using Genetic Programming Algorithms; `_

- `Training Neural Networks Using Evolutionary Algorithms for Regression and Classification Problems; `_

- `Optimizing Neural Network Structure Using Genetic Programming; `_



If some notebooks are too big to display, you can use `NBviewer `_.



Kaggle Notebooks

----------------



- `Can Evolution Guide Us to Better Machine Learning? `_



Articles

--------



Publications where ``thefittest`` has been used:



- *Thefittest: evolutionary machine learning in Python*, January 2024, ITM Web of Conferences 59.

  DOI: 10.1051/itmconf/20245902020. Licensed under CC BY 4.0. Authored by Pavel Sherstnev.

  Available at: https://doi.org/10.1051/itmconf/20245902020



Awards and Presentations

-------------------------



- **1st place**, Samsung Innovation Campus (IT Academy), *Artificial Intelligence* track, October 2024. `Read more `_;  

- **Best PhD Student Paper** at the 12th International Workshop on Mathematical Models and their Applications (IWMMA'2023) for the paper "Thefittest: Evolutionary Machine Learning in Python" by Pavel Sherstnev. `Watch presentation `_;  

- **Tutorial** Presenter at the 13th International Workshop on Mathematical Models and their Applications (IWMMA'2024) with the tutorial titled "Thefittest Library: Evolutionary Algorithms and Automation of Machine Learning Models Design in Python". `Watch tutorial `_;  

- **2nd place**, Youth IT Project Competition "Soft-Parade 2025". `More details `_

- **2nd place**, GitVerse, Cloud.ru and Habr Open Source Grant Program "Code Without Borders" 2025. `More details `_

- **International University Award "Gravitation" 2025** in the category *"Algorithms and Software Solutions in AI and Big Data"*, awarded by the Presidential Academy, Tomsk State University, and the Association *"University Consortium of Big Data Researchers"*. `More details `_