By Topic

The Attribute Reduce with SAT Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Qingshan Zhao ; Dept. of Comput., Shanxi Xinzhou Teachers Univ., Xinzhou, China ; Xiaolong Zheng

Rough set theory has been successfully applied to many areas including machine learning pattern recognition decision analysis process control, knowledge discovery from databases. An algorithm in finding minimal reduction based on prepositional satisfiability (abbreviated as SAT) algorithm is proposed. A branch and bound algorithm is presented to solve the proposed SAT problem. The experimental result shows that the proposed algorithm has significantly reduced the number of rules generated form the obtained reduction with high percentage of classification accuracy.

Published in:

Intelligent Information Technology Application, 2009. IITA 2009. Third International Symposium on  (Volume:3 )

Date of Conference:

21-22 Nov. 2009