Decision tree using binary datasets

$10-30 AUD

Suljettu

Julkaistu

yli 5 vuotta sitten

$10-30 AUD

Maksettu toimituksen yhteydessä

It is important to prove it like a “base-case” 1. Pick a simple binary dataset with a known problem 2. Apply condsat on it to build a decision tree using the matrix of condsat (1 or 0) 3. Shows the result of using condsat as decision tree for this datase we are using the knowledge of condsat to build a decision tree using the matrix of condsat (1 or 0) As the decision tree is teorically a tree of 1 and 0, you can use condsat matrix to build the decision tree, so using knowledge of condsat matrix to build it

Binary Analysis

Data Science

Linear Programming

Machine Learning (ML)

Python

Projektin tunnus (ID): 18265532

Tietoa projektista

1 ehdotus

Etäprojekti

Aktiivinen 5 vuotta sitten

Haluatko ansaita rahaa?

Sähköpostiosoite

Freelancerin tarjouskilpailun edut

Aseta budjettisi ja aikataulu

Saa maksu työstäsi

Kuvaile ehdotustasi

Rekisteröinti ja töihin tarjoaminen on ilmaista

1 freelancerit tarjoavat keskimäärin $35 AUD tätä projektia

@albabahmadkhan

I'm a experienced Data Scientist ready to do your work in an efficient way with strong analytical and logical reasoning skills with insatiable interest in Data Science and Big Data Analytics. Data analysis- Data Mining-Forecasting using R, SPSS, Excel and SAS Enterprise Miner. Machine learning- KNN, SVM, NB, PCA, LDA, RF, K-means/Hierarchical clustering, Supervised and Unsupervised Learning etc. Deep Learning - RNN, CNN, RCNN, RNTN etc. Programming Languages - R, Python, Java, C++, C, C# etc. Databases: Teradata-SQL, MySQL

$35 AUD 2 päivässä