public Integer[] match(List<Double[]> centroids, List<Double[]> sublist) throws IOException {
		System.out.println("match: " + sublist.size());
		Integer[] list = new Integer[sublist.size()];
		for(int i = 0; i < sublist.size(); i++) {
			Double[] d = sublist.get(i);
			double min = Double.MAX_VALUE;
			int clusterk = 0;
			for(int j = 0; j < centroids.size(); j++) {
				double distance = KMeans.euclideanDistance(d, centroids.get(j));
				if(distance < min) {
					min = distance;
					clusterk = j;
				}
			}
			list[i] = clusterk;
		}
		return list;
	}