Nodes similarity is the basis of graph clustering algorithm. The existing clustering algorithms based on structure and attribute graph are lower efficiency because of the constrains of traditional graph model. To resolve the problem, a measure method of graph nodes similarity is proposed, which is based on the structure and attribute balance graph notion and random walk model. Compared with existing methods, the proposed method measures the similarity not only directed nodes but also undirected nodes, and i...