Upload Code
loading-left
loading loading loading
loading-right

Loading

Profile
No self-introduction
codes (2)
Traveling Sales man
no vote
The  travelling salesman problem  ( TSP ) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? this code usin
m_ice
2016-08-23
1
1
K-means Clustering
no vote
It implements k-means clustering. clustering is an unsupervised learning. it randomly selects k points to initial cluster center. it calculates mean of the groups and then update its center.
m_ice
2016-08-23
2
1
No more~