loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 International Symposium on Electronic Commerce and Security
The Algorithm of Obtaining Best Rules Based on Rough Set
August 03-August 05
ISBN: 978-0-7695-3258-5
With the fast development of the technology in Database and Internet, excessive information has become a problem that decision makers engage in electronic commerce have to affront. This paper firstly establishes the decision table for excessive data, then reduces knowledge of the decision table, and obtains the best rules. This can reduce the redundancy of the data, and improve the efficiency of knowledge obtaining. Because of the high time complexity and spatial complexity the general algorithm has, this paper proposed a new algorithm based on analogical matrix, and carried out the algorithm. The practice proves that the algorithm can improve the efficiency of knowledge obtaining, and the rules is tidy and best.
Index Terms:
Rough Set, Knowledge Reduction, Attribute Reduction, Attribute Value Reduction, Analogical Matrix, Electronic Commerce
Citation:
Shulin Chen, Lei Wang, "The Algorithm of Obtaining Best Rules Based on Rough Set," isecs, pp.7-10, 2008 International Symposium on Electronic Commerce and Security, 2008
Usage of this product signifies your acceptance of the Terms of Use.