Dynamic reduct from partially uncertain data using rough sets

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

Abstract

In this paper, we deal with the problem of attribute selection from a sample of partially uncertain data. The uncertainty exists in decision attributes and is represented by the Transferable Belief Model (TBM), one interpretation of the belief function theory. To solve this problem, we propose dynamic reduct for attribute selection to extract more relevant and stable features for classification. The reduction of the uncertain decision table using this approach yields simplified and more significant belief decision rules for unseen objects. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Trabelsi, S., Elouedi, Z., & Lingras, P. (2009). Dynamic reduct from partially uncertain data using rough sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5908 LNAI, pp. 160–167). https://doi.org/10.1007/978-3-642-10646-0_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