Research on Knowledge Acquisition of Motorcycle Intelligent Design System Based on Rough Set

Author(s):  
Rong Dai ◽  
Xiangmin Duan
2007 ◽  
Vol 359-360 ◽  
pp. 518-522
Author(s):  
Wan Shan Wang ◽  
Tian Biao Yu ◽  
Xing Yu Jiang ◽  
Jian Yu Yang

Remote control and fault diagnosis of ultrahigh speeding grinding is studied, which is based on the theory of rough set. Knowledge acquisition and reduction rule of fault diagnosis, realization method of remote control for ultrahigh speed grinding are studied, diagnosis model is established. Based on the theoretical research and ultrahigh speed grinder with a linear speed of 250 m/s, the remote control and fault diagnosis system of ultrahigh speed grinding is developed. Results of the system running show that the environment is improved, the mental pressure of workers is relieved and the efficiency is improved. At the same time, it proves that the ability to diagnosis and the accuracy of diagnosis for the ultrahigh speed grinding are improved and the time for diagnosis is shortened by applying rough set.


2014 ◽  
Vol 13 (7) ◽  
pp. 1386-1390
Author(s):  
Li Li ◽  
Lu Sun ◽  
Jiayang Wang

Author(s):  
Qing-Hua Zhang ◽  
Long-Yang Yao ◽  
Guan-Sheng Zhang ◽  
Yu-Ke Xin

In this paper, a new incremental knowledge acquisition method is proposed based on rough set theory, decision tree and granular computing. In order to effectively process dynamic data, describing the data by rough set theory, computing equivalence classes and calculating positive region with hash algorithm are analyzed respectively at first. Then, attribute reduction, value reduction and the extraction of rule set by hash algorithm are completed efficiently. Finally, for each new additional data, the incremental knowledge acquisition method is proposed and used to update the original rules. Both algorithm analysis and experiments show that for processing the dynamic information systems, compared with the traditional algorithms and the incremental knowledge acquisition algorithms based on granular computing, the time complexity of the proposed algorithm is lower due to the efficiency of hash algorithm and also this algorithm is more effective when it is used to deal with the huge data sets.


Sign in / Sign up

Export Citation Format

Share Document