• Stars
    star
    2
  • Language
    Jupyter Notebook
  • Created over 4 years ago
  • Updated over 4 years ago

Reviews

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

Repository Details

More Repositories

1

WIPRO-Dotnet

C#
16
star
2

MBTI-Test

This is a questionnaire of 70 questions which will decide your personality
HTML
5
star
3

Classification-of-a-Fake-or-Real-News

Dynamic RNN and LSTM using Tensorflow.
Jupyter Notebook
2
star
4

Hands_0n_deep_Learning

Jupyter Notebook
1
star
5

Arnold-Cat-MAP-OR-Arnold-Scrambling

Jupyter Notebook
1
star
6

SVM

1
star
7

Tic-Tac-Toe-in-Augmented-Reality

1
star
8

Multi_layer-perceptron-Using-Tensorflow

Jupyter Notebook
1
star
9

Clustering-On-Movie-Lens-Dataset

Jupyter Notebook
1
star
10

IMAGE-BITSLICING

Bitslicing an image into binary bitplanes
Jupyter Notebook
1
star
11

SnakeGame

Classic snake game implemented using pygame and Reinforcement learning
Python
1
star
12

GameDev

This is an Augmented Reality game of Donald Trump Dancing on an Image target. Done using Unity 3D and Vuforia
ShaderLab
1
star
13

Clustering

Jupyter Notebook
1
star
14

House-Price-Classification

Jupyter Notebook
1
star
15

Logistic-Regression

Logistic Regression of IRIS Dataset
Jupyter Notebook
1
star
16

multimodal-system

This is a web application which gives you option to select which mode of travel you want to use between two cities. It gives the optimum path as well as other paths between the source and destination cities. Also it provides path in which different modes arecombined.
JavaScript
1
star
17

Invisibility-Cloak

This is a program to make an invisibility cloak using opencv.
Jupyter Notebook
1
star
18

Chaotic-Encryption-and-Decryption

This code is done in python and visualized in jupyter notebook. the code uses Open CV, PIL and Numpy libraries to perfor a lossless chaotic encryption
Jupyter Notebook
1
star
19

Decision-Tree

The core algorithm for building decision trees called ID3 by J. R. Quinlan which employs a top-down, greedy search through the space of possible branches with no backtracking. ID3 uses Entropy and Information Gain to construct a decision tree. In this session we are going to use the pima Indians dataset which classifies whether a person has diabetes or not using a binary classifier.
Jupyter Notebook
1
star
20

XG-Boost

XGBoost is well known to provide better solutions than other machine learning algorithms. Boosting is a sequential technique which works on the principle of an ensemble. Here Decistion Tree and XgBoost is compared in IRIS data
Jupyter Notebook
1
star