PEP8

GaelVaroquaux · GaelVaroquaux · commit 10d4cab76589 · 2013-01-20T19:48:11.000+01:00
diff --git a/sklearn/cluster/k_means_.py b/sklearn/cluster/k_means_.py
@@ -553,8 +553,8 @@ def _init_centroids(X, k, init, random_state=None, x_squared_norms=None,
 
     if len(centers) != k:
         raise ValueError('The shape of the inital centers (%s) '
-            'does not match the number of clusters %i'
-            % (centers.shape, k))
+                         'does not match the number of clusters %i'
+                         % (centers.shape, k))
 
     return centers
 
@@ -845,7 +845,7 @@ def _mini_batch_step(X, x_squared_norms, centers, counts,
         random_state = check_random_state(random_state)
         # Reassign clusters that have very low counts
         to_reassign = np.logical_or((counts <= 1),
-                                     counts <= .001 * counts.max())
+                                    counts <= .001 * counts.max())
         # Pick new clusters amongst observations with a probability
         # proportional to their closeness to their center
         distance_to_centers = np.asarray(centers[nearest_center] - X)
@@ -861,7 +861,6 @@ def _mini_batch_step(X, x_squared_norms, centers, counts,
         new_centers = X[new_centers]
         centers[to_reassign] = new_centers
 
-
     # implementation for the sparse CSR reprensation completely written in
     # cython
     if sp.issparse(X):
@@ -1175,8 +1174,8 @@ def fit(self, X, y=None):
                 self.cluster_centers_, self.counts_,
                 old_center_buffer, tol > 0.0, distances=distances,
                 random_reassign=(iteration_idx + 1) % (10 +
-                                        self.counts_.min()) == 0,
-                random_state=self.random_state)
+                                                self.counts_.min()) == 0,
+                                 random_state=self.random_state)
 
             # Monitor convergence and do early stopping if necessary
             if _mini_batch_convergence(
@@ -1226,7 +1225,7 @@ def partial_fit(self, X, y=None):
             # The lower the minimum count is, the more we do random
             # reassignement, however, we don't want to do random
             # reassignement to often, to allow for building up counts
-            random_reassign = self.random_state.randint(10*(1 +
+            random_reassign = self.random_state.randint(10 * (1 +
                                         self.counts_.min())) == 0
 
         _mini_batch_step(X, x_squared_norms, self.cluster_centers_,
