This paper pointed out the shortages of reasoning algorithms of the present belief decision trees and then proposed a new reasoning algorithm.The new algorithm makes the best of the advantage of belief function theory for handling uncertainty,revises the outputs of the relevant leaf nodes using the discounting rule,takes into account the test attribute weights,and thus improves the classification precision and reliability.Additionally,a new evidential combination rule was proposed to overcome the shortages ...