Hlaing Min Oo
- Data Analyst
- Software Developer
- AI Enthusiast
My Projects
K-Mean Algorithm Visualization
Visualization of K-mean Algorithm. User must first define nodes locations and train data (nodes) will be your [x, y] locations of nodes. The algorithm will group k number of clusters that user defined with different colors.
K Nearest Neighbors Algorithm Visualization
Visualization of K Nearest Neighbors Algorithm. Test data (node) will be your [x, y] locations of your mouse and it will change classified color. Nearest neighbors will highlight and show connection with test node if it gets closer. You can varies the amount of K, labels and data points.
Classic 8 puzzle game is automatically solved by 3 search algorithms (breadth first search, depth first search, and a* search). You can assign with different puzzle positions and it will check whether it is solvable or not. It will also show you how many search it has made.
Dynamic Window Approach Algorithm Visualization
Visualization of Dynamic Window Approach algorithm. You can varies the amount of obstacles and the robot will try to reach the goal. It will also show you the path it has moved.
A* Path Finder Algorithm Visualization
Visualization of A* path finding algorithm. You can assign the start node, end node and it will try to find the shortest path using heurisitc function. It will also show you the search space(i.e how many search it has made).
Simple responsive Todolist web application created with react, tailwindcss, jquery and jquery-ui. You can create your unlimited busy task and separate the tasks by their categories or titles.
Simple responsive user interface of Todolist web application created with tailwindcss, jquery and jquery-ui.
Group projects that I cooperated with classmates during my academic.