loading...
Attribute value reduction in variable precision rough set
Dalian, China December 05-December 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDCAT.2005.93Sixth International Conference on Par ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Nian Fu-zhong, Lanzhou Univ. of Tech, Lanzhou ,China
Li Ming, Lanzhou Univ. of Tech, Lanzhou ,China
As far as a specific rule is concerned, attribute reduction is equivalent to attribute value reduction. Especially for variable precision rough set (VPRS) , any attribute value may be a value reduct, every of them must be checked. Some important information would be ignored if we still first compute attribute reduct and then compute its value reduct just as traditional Rough set theory (RST) in VPRS. This paper, through analyzing the nature of reduction, and the specific meanings of value reduction in VPRS, provide a direct value reduction algorithm.
Citation:
Nian Fu-zhong, Li Ming, "Attribute value reduction in variable precision rough set," pdcat, pp.904-906, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.