My Java machine learning library is now on GitHub. It contains a basic neural network that can be trained using backpropagation and gradient descent (Adam, Adagrad, or SGD). Read more
Levenshtein distance is a metric for the distance between two strings. It is defined by three different types of edits: substitution, insertion, and deletion. The Levenshtein distance between two strings is the minimum number of edits to get from one string to the other. Read more
That’s my new project.
Over the summer, I’ve been working on a bioinformatics tool for my internship. It does preprocessing for the genotyping by sequencing (GBS) pipeline and parses .fastq files so that the processed sequences can later be aligned or base called or analyzed.
I’m starting to learn some Machine Learning (just learned Python). My first project is a simple machine learning addition program. Read more
The Knapsack problem is a Dynamic Programming problem. We have to maximize the total value of the items, while making sure the total weight of the items is lower than a specific value. There are two variations to this problem:
2D maze solver written in Java. Has a Swing GUI and it contains eight methods for solving mazes: BFS, DFS, Best-First BFS, Dijkstra’s, Bellman-Ford, Floyd-Warshall, A*, and simulate hand on right wall.
Simple Sudoku solver written in Java and it has a Swing GUI.
After 4+ weeks of coding, compiling, testing, and finally, wrestling with Apple and Google Play, I am finally ready to announce that the game is finished… or rather, released. This game is a complete rewrite of the previous one. No code was copied over. Read more