Abstract: The algorithm of decision tree is achieved by the relative core of attributes, which is incomplete.The algorithm is proposed in this paper on the definite relation of rough set, which chooses important attribute by the definite count and the classifying value, and makes decision tree from top to bottom with the attribute.The benefit of the algorithm is simple in calculation and is effectively used in the classification.The experiments and comparison show that the algorithm provides more precise and simple decision tree.