subroto08820/GettingCleaningData_PeerAssessment_2
Coursera - Getting & Cleaning Data Peer Assessment 2
Developer Profile
subroto08820
Discovered public repositories for subroto08820 in the GitHub catalog.
subroto08820/RepData_PeerAssessment2
Coursera - Reproducible Research Assignment 2
subroto08820/RepData_PeerAssessment1
Peer Assessment 1 for Reproducible Research
subroto08820/ExploratoryDataAnalysis
Answers to Assignment 1
subroto08820/ExData_Plotting1
Plotting Assignment 1 for Exploratory Data Analysis
subroto08820/R-Assignment-3
R programming assignment 3
subroto08820/R-Assignment-1
R programming Assignment 1
subroto08820/ProgrammingAssignment2
Repository for Programming Assignment 2 for R Programming on Coursera
subroto08820/datasharing
The Leek group guide to data sharing
subroto08820/R-Programming
Coursera
subroto08820/datasciencecoursera
This is a test repository
subroto08820/GoldSaxKmeansClustering
Modelled, Architected and designed by Vance King Saxbe. A. with the geeks from GoldSax Consulting, GoldSax Money, GoldSax Treasury, GoldSax Finance, GoldSax Banking and GoldSax Technologies email @vsaxbe@yahoo.com. Development teams from Power Dominion Enterprise, Precieux Consulting. This Engagement sponsored by GoldSax Foundation, GoldSax Group and executed by GoldSax Manager. Clustering is a technique used in unsupervised learning. With unsupervised learning you don’t know what you’re looking for, that is, there are no target variables. Clustering groups data points together, with similar data points in one cluster and dissimilar points in a different group. A number of different measurements can be used to measure similarity. One widely used clustering algorithm is k-means, where k is a user-specified number of clusters to create. The k-means clustering algorithm starts with k-random cluster centers known as centroids. Next, the algorithm computes the distance from every point to the cluster centers. Each point is assigned to the closest cluster center. The cluster centers are then recalculated based on the new points in the cluster. This process is repeated until the cluster centers no longer move. This simple algorithm is quite effective but is sensitive to the initial cluster placement.
subroto08820/python101
My First Python Class