To embed ensemble techniques into belief decision trees for performance improvement, the bagging algorithm is explored. Simple belief decision trees based on entropy intervals extracted from evidential likelihood are constructed as the base classifiers, and a combination of individual trees promises to lead to a better classification accuracy. Requiring no extra querying cost, bagging belief decision trees can obtain good classification performance by simple belief tree combination, making it an alternative to single belief tree with querying. Experiments on UCI datasets verify the effectiveness of bagging approach. In various uncertain cases, the bagging method outperforms single belief tree without querying, and is comparable in accuracy to single tree with querying. © 2017 International Society of Information Fusion (ISIF).