-
Install hadoop, alternatively, follow steps 2-4 for hadoop installation in docker environment.
-
Launch a Linux VM on Windows; install and configure
dockeranddocker-composeon the virtual machine. -
Clone the big-data-europe/docker-hadoop repo containing the docker compose file with all the necessary information of the Hadoop containers to be created.
-
Run the
docker-compose filein the cloned directory withdocker-compose up -d -
Export the
.jarfile of the project withKMeansClusteringJobClass as the main class and transfer it to the datanode container where it can be run on the Hadoop architecture. -
Run the
.jarfile on Hadoop with the appropriate arguments.hadoop KMeansMapReduce.jar input.txt m 7 0The various arguments created for the
.jarfile are:- Inputfile: Location of the input csv file.
- Distanceformula : Character indicating the distance algorithm to be used;
- m ; Manhattan Distance
- e : Euclidian Distance
- j : Jaccard Distance
- K: No of cluster to be created
- Error: Maximum amount of error in the convergence check
- Debug: “y” for skipping all subsequent iterations and no file output.
-
Use the python scripts to visualize the data.
Elbow method for WCSS:
Elbow method for Distortion:
The workspace contains these folders by default, where:
src: the folder to maintain sourceslib: the folder to maintain dependenciesout: the folder containing the output of the Previous MapReduce Jobs
Meanwhile, the compiled output files will be generated in the bin folder by default.
This model class contains the definition for the Vectors that store the key value pairs. Height and Weight in the case of my project. The Vector class implements WritableComparable<Vector>.
//Imports//
public class Vector implements WritableComparable<Vector> {
private double[] vector;
----
}
We need a measurement of a distance between two vectors, especially between a center and a vector. The class containers multiple implementations of multiple Distance metric algorithms including Euclidian Distance, Manhattan Distance and Jaccard Distance. The selected Distance Metric is passed as an command line argument that is passed to the measureDistance() method as an argument distanceFormula.
//Imports//
public class DistanceMeasurer {
public static final double measureDistance(ClusterCenter center, Vector v) {
double sum = 0;
int length = v.getVector().length;
char distanceFormula = KMeansClusteringJob.distanceFormula;
switch (distanceFormula) {
case 'm':
// Manhattan
for (int i = 0; i < length; i++) {
sum += Math.abs(center.getCenter().getVector()[i] - v.getVector()[i]);
}
return sum;
case 'e':
// Euclidian
for (int i = 0; i < length; i++) {
double diff = center.getCenter().getVector()[i] - v.getVector()[i];
// multiplication is faster than Math.pow() for ^2.
sum += (diff * diff);
}
return Math.sqrt(sum);
case 'j':
// Jaccard
double[] v1 = center.getCenter().getVector();
double[] v2 = v.getVector();
double dot = dot(v1, v2);
double set1Length = sumOfSquares(v1);
double set2Length = sumOfSquares(v2);
return 1.0d - (dot / (set1Length + set2Length - dot));
default:
// Manhattan
for (int i = 0; i < length; i++) {
sum += Math.abs(center.getCenter().getVector()[i] - v.getVector()[i]);
}
return sum;
}
}
private static double dot(double[] v1, double[] v2) { --- }
private static double sumOfSquares(double[] v1) { --- }
}
The ClusterCenter class also encapsulates a Vector class object along with an integer Cluster Index for unique indentification of each cluster center. It just delegates the read/write/compareTo method to the vector. It has a converged method which checks if the distance between the class vector and the passed argument vector is within the specified allowable error value.
//Imports//
public class ClusterCenter implements WritableComparable<ClusterCenter> {
private Vector center;
private int clusterIndex;
----
}
The Mapper class is responsible for the mapping phase of the program. Let's assume that there is a list or a list-like sequencefile-iterating interface that is called centers. It contains ClusterCenter objects that represent the current centers. The DistanceMeasurer class contains the static method we defined in the last part.
@SuppressWarnings("deprecation")
public class KMeansMapper extends
Mapper<ClusterCenter, Vector, ClusterCenter, Vector> {
private static final Log LOG = LogFactory.getLog(KMeansMapper.class);
private final List<ClusterCenter> centers = new LinkedList<ClusterCenter>();
@Override
protected void setup(Context context) throws IOException, InterruptedException { --- }
@Override
protected void map(ClusterCenter key, Vector value, Context context) throws IOException, InterruptedException { --- }
}
The Reducer Class is responsible for the reducer phase of the compiler. Once again let's have a list or a list-like sequencefile-iterating interface that is called centers. The first loop only dumps the values in the iterable into a list and sums up each component of the vector in a newly created center. Then we are averaging it in another loop and we are writing the new center along with each vector we held in memory the whole time. Afterwards we are just checking if the vector has changed, this method is just a delegating to the underlying vectors compareTo. If the centers are not equal it returns true. And therefore, it updates a counter.
//Imports//
@SuppressWarnings("deprecation")
public class KMeansReducer extends
Reducer<ClusterCenter, Vector, ClusterCenter, Vector> {
public static enum Counter { CONVERGED }
private static final Log LOG = LogFactory.getLog(KMeansReducer.class);
final List<ClusterCenter> centers = new LinkedList<ClusterCenter>();
@Override
protected void reduce(ClusterCenter key, Iterable<Vector> values, Context context)throws IOException, InterruptedException { --- }
@Override
protected void cleanup(Context context) throws IOException, InterruptedException { --- }
}
This is the Main Class of the project and it contains the main method as well.
The various arguments created for the .jar file are:
- inputfile: Location of the input
csvfile. - Distanceformula : Character indicating the distance algorithm to be used:
- m ; Manhattan Distance
- e : Euclidian Distance
- j : Jaccard Distance
- K : no of cluster to be created
- Error: maximum amount of error in the convergence check
- Debug : “y” for skipping all subsequent iterations and no file output.
//Imports//
@SuppressWarnings("deprecation")
public class KMeansClusteringJob {
private static final Log LOG = LogFactory.getLog(KMeansClusteringJob.class);
//public static final List<ClusterCenter> centers = new LinkedList<ClusterCenter>();
public static char distanceFormula = 'm';
public static double error = 0;
public static void main(String[] args) throws IOException, InterruptedException, ClassNotFoundException {
Boolean arguments = false;
int k = 3;// No of Centroids
char debug = 'n';
// Optional arguments
if (args.length > 0) {
arguments = true;}
if (args.length > 1) {
distanceFormula = args[1].charAt(0);}
if (args.length > 2) {
k = Integer.parseInt(args[2]);}
if (args.length > 3) {
error = Double.parseDouble(args[3]);}
if (args.length > 4) {
debug = args[4].charAt(0);}
---
}
}
The python scripts use libraries like pandas and matplotlib to read the output data from the csv files and display it as scatter plots for analysis and comparison.
The KMeansClustering Job returns two files as the output:
Centroids.csv and Output.csv.
Centroids.csv contains all the centroids.
Output.csv contains all the data along with the centroid they are clustered into.
The script GraphPlotter.py can read and plot these data as scatter plots.
Another python script BatchGraphPlotter.py, takes multiple K Means Outputs (For different values of K) as input and calculates both Distortion and Inertia (WCSS) for the Output Clusters by reading Centroids.csv and Output.csv files outputs the result to Elbow.csv.
This Elbow.csv contains data in the format of (K, WCSS, Distortion) can be plotted using the ElbowMethod.py script.
This WCSS data can be calculated for different values of K and the result can be used to plot a graph for the elbow method.