An efficient heuristic clustering algorithm is discussed in detail by use of deterministic annealing.The clustering problem is considered as a physical system.Finding the optimal solution to clustering problem is transformed into solving a series of problems to minimize the free energy and obtain the global minimum which varies with temperature.The examples indicate that satisfactory results are obtained for the problem to which the traditional clustering algorithms are helpless.