A K means Clustering Algorithm based on Hierarchy
Probabilistic hierarchical clustering based on document information quantity.From an information theory angle,we study a K means clustering algorithm based on hierarchy in this paper.Firstly,this algorithm classifies documents into one or more predefined categories using hierarchical methods,the total classified number is taken for the number of clusters.Secondly,it uses k means to modify the clustering results.Experimental results showed that these algorithms have higher mining efficiency in execution time,memory usage and CPU utilization than most current ones like k means.