D4-Developer/image-classifier-pytorch-ml D4-Developer/image-classifier-pytorch-ml

  • Stars
    star
    4
  • Rank 3,304,323 (Top 66 %)
  • Language
    Jupyter Notebook
  • Created over 4 years ago
  • Updated over 4 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
D4-Developer/image-classifier-pytorch-ml
github

D4-Developer

Reviews

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

Repository Details

Image classifier model for predicting various 102 type of flowers based on deep learning model....

More Repositories

1

HR-Management-App

Human Resource Management App : The simple app for recruitment based on the Resume Ranking Policy.
6
star
2

Candidate-Experience-Open-Theme

Dart
4
star
3

calculatorJavaSwing

basic operational calculator on windows based
Java
4
star
4

database_CloudFireStore

ex of simple CloudFireStore fetching & updating....
Dart
2
star
5

charity-ML

CharityML is a fictitious charity organization located in the heart of Silicon Valley that was established to provide financial support for people eager to learn machine learning. After nearly 32,000 letters were sent to people in the community, CharityML determined that every donation they received came from someone that was making more than $50,000 annually. To expand their potential donor base, CharityML has decided to send letters to residents of California, but to only those most likely to donate to the charity. With nearly 15 million working Californians, CharityML has brought you on board to help build an algorithm to best identify potential donors and reduce overhead cost of sending mail. The goal will be evaluate and optimize several different supervised learners to determine which algorithm will provide the highest donation yield while also reducing the total number of letters being sent.
HTML
2
star
6

backbone.js_typescript

TypeScript
1
star
7

zeus-javascript-course-feb

zeus javascript :) start on 02/02/2021
JavaScript
1
star
8

chem_english

JavaScript
1
star
9

Tic-Tac-Toe

TIc Tac Toe game based on Flutter & CloudFirestore
Dart
1
star
10

javascript-tasks-feb

A newnewbie in javascript....
HTML
1
star
11

Percolation-Algorithm_week-1

Percolation. Given a composite systems comprised of randomly distributed insulating and metallic materials: what fraction of the materials need to be metallic so that the composite system is an electrical conductor? Given a porous landscape with water on the surface (or oil below), under what conditions will the water be able to drain through to the bottom (or the oil to gush through to the surface)? Scientists have defined an abstract process known as percolation to model such situations. The model. We model a percolation system using an n-by-n grid of sites. Each site is either open or blocked. A full site is an open site that can be connected to an open site in the top row via a chain of neighboring (left, right, up, down) open sites. We say the system percolates if there is a full site in the bottom row. In other words, a system percolates if we fill all open sites connected to the top row and that process fills some open site on the bottom row. (For the insulating/metallic materials example, the open sites correspond to metallic materials, so that a system that percolates has a metallic path from top to bottom, with full sites conducting. For the porous substance example, the open sites correspond to empty space through which water might flow, so that a system that percolates lets water fill open sites, flowing from top to bottom.) percolates does not percolate The problem. In a famous scientific problem, researchers are interested in the following question: if sites are independently set to be open with probability p (and therefore blocked with probability 1 โˆ’ p), what is the probability that the system percolates? When p equals 0, the system does not percolate; when p equals 1, the system percolates. The plots below show the site vacancy probability p versus the percolation probability for 20-by-20 random grid (left) and 100-by-100 random grid (right). Percolation threshold for 20-by-20 grid Percolation threshold for 100-by-100 grid When n is sufficiently large, there is a threshold value p* such that when p < p* a random n-by-n grid almost never percolates, and when p > p*, a random n-by-n grid almost always percolates. No mathematical solution for determining the percolation threshold p* has yet been derived. Your task is to write a computer program to estimate p*.
Java
1
star