• Stars
    star
    1
  • Language
    HTML
  • License
    MIT License
  • Created over 3 years ago
  • Updated over 3 years ago

Reviews

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

Repository Details

Kodluyoruz frontend eğitim serisi css 2.ödevi

More Repositories

1

kodluyoruzhtmlbolumsonucalismasi

kodluyoruz html derslerinin bölüm sonu çalışmasıdır
HTML
1
star
2

kodluyoruzreactodev1

JavaScript
1
star
3

Numerical-Integration

Java
1
star
4

SwiftScanner

Swift
1
star
5

Solving-Nonlinear-Equations-with-Secant-and-Bisection-method

Java
1
star
6

kodluyoruzjsodev3

Kodluyoruz frontend eğitim serisinin 3.javascript ödevi
JavaScript
1
star
7

JavaScriptToDoList

Kodluyoruz frontend eğitim serisi javascript ödev 2 To Do List
HTML
1
star
8

Speech_Recognition

This code takes 4 seconds voice for finding 5 commands that 'Jarvis', 'Turn on the television', 'Turn on the ligths', 'Turn of the lights','Tell the air temperature'. Then take MFCC of this voice and use dynamic time warping algorithm to compare with recorded voices and find the closest command.
Python
1
star
9

k-NN-Classification-Algorithm

In this project, I will implement the k-NN classification algorithm and test it on the Iris dataset. k-NN classification method have two input parameters: Number of Neighbors(k), Distance Metric(Euclidean or Manhattan distance) Iris dataset contains three flowers and each flower is represented by four features: 1=sepal length, 2=sepal width, 3=petal length, and 4=petal width. In this assignment, I used the first and the fourth feature dimensions. I put first 30 samples from each flower class into the training set 20 samples into the test set. I organize iris data and change iris names with 0,1,2. Then I estimate distances between test set and training set and find minimum distances as k number and find its index to find which samples are closest. Then I find iris names and estimate accuracy rate.
Python
1
star