alex-romanovskii/desicion-tree-with-regression-model-in-leaves

Stars
1
Language
HTML
Created over 4 years ago
Updated over 4 years ago

alex-romanovskii/desicion-tree-with-regression-model-in-leaves

alex-romanovskii

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Kakuro-solver-with-GA-and-GP

Clustering-MIMIC-data

We will cluster admissions based on clinical data, and we will compare the clinical data of the clusters.

Jupyter Notebook

Covid19-Dream-challenge

comparison-of-machine-learning-algorithms

Jupyter Notebook

Text-Rank

Mortality-prediction-MIMIC-

Jupyter Notebook

UFA-SuperHero21

Bert-Summarization

Solution-to-the-eight-queen-s-problem-with-evolutionary-algorithm

The eight queen’s problem is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other; thus, a solution requires that no two queens share the same row, column, or diagonal.

summareyez

This is my python code for my thesis

Analyzing-StackOverFlow

The aim of the project is to analyze the questionnaires of StackOverFlow for all the years and find something interesting.

Jupyter Notebook

Transfer-Learning-Oxford-102-Flower-dataset-Classification

We used Keras to create models that classify the image into the appropriate category.

Similarity-between-Bug-Description-and-Methods-Diagnosis-AI-

The project is to build a system for detecting faulty functions based only on a thematic presentation of a description of functions and bugs

A-four-in-a-line-game-solver-using-a-GP

In this question, we have implemented strategies for four in a line game. This is a game for two players. There are balls of a certain color for each player, and each player in turn throws a ball of his color in the cells of the vertical board. The playing field consists of seven columns and six rows. The goal of the game is to collect four balls of your color vertically or horizontally or diagonally before the enemy does it.

Robot-development-using-GA

In this question, we will solve the problem of the robot. The robot can move through the maze from the starting point to the exit point. The robot can move one slot in each of the four directions (right, left, up and down). If there is a wall in the same direction, the robot will not move.