A Discretization Algorithm Based on Information Distance Criterion and Ant Colony Optimization Algorithm
首发时间:2010-08-02
Abstract:Discretization algorithms have played an important role in data mining, which is widely applied in industrial control. Since the current discretization methods can not accurately reflect the degree of the class-attribute interdependency of the industrial database, a new discretization algorithm, which is based on information distance criterion and ant colony optimization algorithm(ACO), is proposed. The paper analyses the information measures of the interdependence between two discrete variables, and an improved information distance criterion is generated to evaluate the class-attribute interdependency of the discretization scheme. In the algorithm, The ACO is applied to detect the optimal discretization scheme, and a new pheromone matrix is defined on the construction of the optimization, and an effective heuristic values assignment approach, which is used with the criterion values of discretization scheme, is proposed. We performed the experiments on a real industrial database. Experiment results verify that the proposed algorithm can produce a better discretization results.
keywords: Discretization Data mining Entropy Ant colony optimization
点击查看论文中文信息
基金:
论文图表:
引用
No.4380070485241128****
同行评议
共计0人参与
勘误表
基于信息距离与蚁群优化的离散化算法
评论
全部评论0/1000