线性存储的MD-离散化方法  

MD-Discretization Method with Linear Memory Structure

作　　者：岳晓冬[1] 胡建龙[1] 李德玉[1] 

机构地区：[1]山西大学计算机与信息技术学院,山西太原030006

出　　处：《山西大学学报（自然科学版）》2006年第2期142-144,共3页Journal of Shanxi University(Natural Science Edition)

基　　金：国家自然科学基金(60573074);山西省青年科技基金(20041014);山西省自然科学基金(20041040);山西省科技攻关项目(051129)

摘　　要：对基于粗糙集理论的M D-算法进行了线性存储结构改进,进一步提高了算法的效率.Discretization of continuous attributes is very important in data mining and knowledge discovery as data preprocessing. By discretization a learning algorithm can acquire more concise and comprehensible patterns. The rough-set-based MD-heuristic algorithm was improved. A MD-heuristic algorithm with linear memory structure was presented and the efficiency of MD-algorithm was enhanced.

关 键 词：离散化 粗糙集 MD-算法 线性存储 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]