Hierarchical K-means has got rapid development and wide application because of combining the advantage of high accuracy of hierarchical algorithm and fast convergence of K-means in recent years. Traditional HK clustering algorithm first determines to the initial cluster centers and the number of clusters by agglomerative algorithm, but agglomerative algorithm merges two data objects of minimum distance in dataset every time. Hence, its time complexity can not be acceptable for analyzing huge dataset. In view of the above problem of the traditional HK, this paper proposes a new clustering algorithm iHK. Its basic idea is that the each layer of the N data objects constructs $\lceil{{N}\over{2}} \rceil $ clusters by running K-means algorithm, and the mean vector of each cluster is used as the input of the next layer. iHK algorithm is tested on many different types of dataset and excellent experimental results are got.