Eric Leung's repositories
CSUS---Numpy-Pandas-Workshop
Sample code for Numpy and Pandas
Journey_thru_McGill
McGame Jam 2020 - Game
Modified_MNIST_CNN
Given a dataset of 50,000 images containing MNIST digits (handwritten numerical digits from 0 - 9), where each image may contain multiple digits with different sizes and orientations, our goal was to design and validate a supervised classification model to find which number occupied the most space in each image. By utilizing widely used convolutional neural networks, we started from a basic network and slowly made it more and more complicated to get a final desirable score of 0.9310 on our validation set.
IMDB-Sentiment-Analysis
The goal of this Machine Learning project is to classify IMDb reviews as positive or negative based on the language they contain. Using Logistic Regression, SVM, and Decision Tree models as our classification algorithms in Sci-kit Learn.
Reddit_Comment_Popularity_Predictor
According to wikipedia, Reddit is a social media platform for news aggregation, web content rating, and discussion. Members can submit content in the form of links, text posts, and images, which are then “upvoted” or “downvoted” by other members. In this project, we implemented and investigated the performance of linear regression model to predict the popularity of a comment on reddit.
Weather-Application
A simple web application for users to check the current weather at their location. Used two APIs. (This is a project for me to practice my HTML, CSS, and Javascript skills).
Advanced-Topics-Python
Repo for myself to review advanced topics in Python.
afinn
AFINN sentiment analysis in Python
Bellman-Ford-Algorithm
A java program that uses the Bellman-Ford algorithm to calculate the shortest path from a vertex to all other vertices. Even with negative weighted edges exist in the input graph, the algorithm can still compute the correct outputs (distances).
elasticsearch
Open Source, Distributed, RESTful Search Engine
Ford-Fulkerson-Maximum-Flow
Given a WGraph object (.txt file), the Ford-Fulkerson java class will compute the maximum flow of the graph's flow network. As long as there is a path from the source (start node) to the sink (end node), with available capacity on all edges in the path, we send flow along one of the paths. Then we find another path, and so on. A path with available capacity is called an augmenting path.
java-design-patterns
Design patterns implemented in Java
NBA_3_point_boom
A mini Data Science project for myself to study on the 3 point boom in the NBA, also to make an estimation of how many three pointers a team should take in a game to benefit them to win. Written in Jupyter Notebook, and the dataset was downloaded from Kaggle.
Public-APIs
📚 A public list of APIs from round the web.
pytesseract
A Python wrapper for Google Tesseract
Simple-Calendar
A C program that allows users to print a full year calendar in standard output. Instructions are in the README.md file.
TicTacToe
#This program allows the user to play TicTacToe with an "intelligent" A.I.. Instructions: 1. Type in your name. 2. Choose a size for your game board. eg. input: "3" (Then a 3 by 3 game board will be generated) 3. A coin toss done by the program will decide either the player or the A.I. will have the first move. 4. Pick your move. 5. Try to win the game
WarCardGame---Swift_practice
A repo for myself to practice iOS Dev skills.