Cost-sensitive decision tree for uncertain data

3Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Uncertainty exists widely in real-word applications. Recently, the research for uncertain data has attracted more and more attention. While not enough attention has been paid to the research of cost- sensitive algorithm on uncertain data. In this paper, we propose a simple but effective method to extend traditional cost-sensitive decision tree to uncertain data, and the algorithm can deal with both certain and uncertain data. In our experiment, we compare the proposed algorithm with DTU[18] on UCI datasets. The experimental result proves that the proposed algorithm performs better than DTU, with lower computational complexity. It keeps low cost even at high level of uncertainty, which makes it applicable to real-life applications for data uncertainty. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Liu, M., Zhang, Y., Zhang, X., & Wang, Y. (2011). Cost-sensitive decision tree for uncertain data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7120 LNAI, pp. 243–255). https://doi.org/10.1007/978-3-642-25853-4_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free