RECENTLY, META-HEURISTIC OPTIMIZATION ALGORITHMS ARE USED TO FIND OPTIMAL SOLUTIONS IN HUGE SEARCH SPACES. ONE OF THE MOST RECENT IS IMPERIALIST COMPETITIVE ALGORITHM (ICA) WHICH IS WIDELY USED IN MANY OPTIMIZATION PROBLEMS AND HAS SUCCESSFUL RESULTS. WE ADD SOME ELITISM TO ICA AND INTRODUCED ELITIST IMPERIALIST COMPETITIVE ALGORITHM (EICA) AS A NEW VERSION OF ICA.ONE OF THE MOST IMPORTANT APPLICATION OF OPTIMIZATION TECHNIQUES IS IN DATA MINING WHERE CLUSTERING AND ITS MOST POPULAR ALGORITHM, K-MEANS, IS A CHALLENGING PROBLEM. ITS PERFORMANCE DEPENDS ON THE INITIAL STATE OF CENTROID AND MAY TRAP IN LOCAL OPTIMA. IT IS SHOWN THAT THE COMBINATION OF EICA AND K-MEANS HAVE BETTER PERFORMANCE IN TERMS OF CLUSTERING AND EXPERIMENTAL RESULTS ARE DISCUSSED ON K-MEANS CLUSTERING. THE GOAL OF THIS RESEARCH IS TO IMPROVE ICA FOR ANY OPTIMIZATION PROBLEM.