Decision tree using binary datasets

$10-30 AUD

已关闭

已发布

超过 5 年前

$10-30 AUD

货到付款

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

项目 ID: 18265532

关于此项目

1条提案

远程项目

活跃5 年前

想赚点钱吗？

电子邮箱地址

在Freelancer上竞价的好处

设定您的预算和时间范围

为您的工作获得报酬

简要概述您的提案

免费注册和竞标工作

1威客以均价$35 AUD来参与此工作竞标

@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天之内