基于邻域粗糙模型的高维数据集快速约简算法  

Quick Reduction Algorithm for High-dimensional Data Sets Based on Neighborhood Rough Set Model

作　　者：刘遵仁[1,2] 吴耿锋[1] 

机构地区：[1]上海大学计算机工程与科学学院,上海200072 [2]青岛大学信息工程学院,青岛266071

出　　处：《计算机科学》2012年第10期268-271,317,共5页Computer Science

基　　金：国家自然科学基金(61170106)资助

摘　　要：根据粒子群优化算法的思想,给出了求解高维邻域决策表的一个约简算法SPRA。通过采用固有维数的分析方法MLE等,将其估算的维数值作为SPRA算法的初始化参数,提出了高维数据集快速约简算法QSPRA。利用5个UCI标准数据集对该算法进行了验证,结果表明,该算法是有效的、可行的。详细分析了种群规模和迭代次数对结果产生的影响。实验表明,基于核的启发式添加算法思想已经不适合求解高维数据集。According to the particle swarm optimization algorithm＇s idea,a new algorithm（SPRA） to get a optimal attribute reduction on the high-dimensional neighborhood decision table was proposed.Through the use of intrinsic dimension analysis method,taking the intrinsic dimensionality estimated as the SPRA algorithm＇s initialization parameter,a quick reduction algorithm（QSPRA） was proposed to deal with the high-dimensional data sets.The algorithm＇s validity was verified by five high-dimensional data sets from UCI.In the experimental analysis section,the population size and the number of iteration to the influence of the reduction result were also discussed.Moreover,the experiments also show that it is impossible to solve high-dimensional data sets based on kernel-based heuristic algorithm ideas.

关 键 词：邻域粗糙模型 决策依赖度 固有维数估算 极大似然估计法 粒子群优化算法 粒子群快速约简算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]