Fast Knowledge Reduction Algorithms Based on Quick Sort

摘要：

Many researchers are working on developing fast data mining methods for processing huge data sets efficiently.In this paper,we develop some efficient algorithms for knowledge reduction based on rough sets.In these algorithms we use the fact that the average time complexity for the quick sort algorithm for a two dimensions table with n rows and m columns is just n × (m + logn) (not m × n × logn).Experiment results also show the efficiency of these algorithms.

关键词： Huge data Knowledge reduction Rough set Quick sort Divide and conquer

作者: Feng Hu Guoyin Wang Lin Feng

作者单位: School of Information Science and Technology,Southwest Jiaotong University,Chengdu 600031,P.R.China; Institute of Computer Science and Technology,Chongqing University of Posts and Telecommunications,Chongqing 400065,P.R.China

会议类型: 国际会议

会议名称: The Third International Conference on Rough Sets and Knowledge Tevhnology(RSKT 2008)(第三届粗糙集与知识技术国际会议)

会议地点: 成都

会议语种:英文

页码: 72-79

在线出版日期: 2008-05-17（万方平台首次上网日期，不代表论文的发表时间）