Skip to content
View josephmars's full-sized avatar

Block or report josephmars

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Please don't include any personal information such as legal names or email addresses. Maximum 100 characters, markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
josephmars/README.md

Hi 👋, I'm Joseph!

I’m a data scientist who loves turning messy datasets into beautiful visualizations and training stubborn models. I am focused on creating GenAI implementations for everyone!
When I’m not coding, you’ll find me watching movies religiously 🎥, at the gym, or reading📚 whatever is in my Fable read list.

Let’s connect! Here is my LinkedIn.


Pinned Loading

  1. digit_recognition_nn digit_recognition_nn Public

    Artificial Neural Network (ANN) designed to recognize handwritten digits (0-9) from normalized 32x32 bitmap images.

    Python

  2. GAN_image_translation GAN_image_translation Public

    Generative Adversarial Network (GAN) to replicate the artistic style of Claude Monet. By adapting the CycleGAN architecture and experimenting with activation functions, the model aims to generate h…

    Python

  3. SFI_CGS_2024 SFI_CGS_2024 Public

    Analysis of Archive Reddit data to explore discussions on AI and employment. We used machine learning models and LLMs for classification, as well as and topic modeling.

    Python 1

  4. COVID19_death_prediction COVID19_death_prediction Public

    Shiny app to predict the risk of death by COVID-19 based on demographic data. Support Vector Machine (SVM) and XGBoost were used.

    R

  5. connect4_solver_AI connect4_solver_AI Public

    Connect 4 AI puzzle solver using Minimax and Alpha-Beta Pruning algorithms.

    Python

  6. Pukoban_solver_AI Pukoban_solver_AI Public

    Pukoban puzzle solver that uses 4 search algorithms (BFS, DFS, Greedy, and A*) to determine the optimal sequence of moves to win.

    Python