Title :
The Algorithm of Obtaining Best Rules Based on Rough Set
Author :
Chen, Shulin ; Wang, Lei
Author_Institution :
Coll. of Econ. & Manage., NanJing Forestry Univ., Nanjing
Abstract :
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.
Keywords :
electronic commerce; rough set theory; analogical matrix; best rules; decision table; electronic commerce; excessive data; rough set; Data security; Databases; Educational institutions; Electronic commerce; Forestry; Information security; Information systems; Internet; Market opportunities; Technology management; Analogical Matrix; Attribute Reduction; Attribute Value Reduction; Electronic Commerce; Knowledge Reduction; Rough Set;
Conference_Titel :
Electronic Commerce and Security, 2008 International Symposium on
Conference_Location :
Guangzhou City
Print_ISBN :
978-0-7695-3258-5
DOI :
10.1109/ISECS.2008.14