首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一种高效的分形属性选择算法
引用本文:闫光辉.一种高效的分形属性选择算法[J].兰州铁道学院学报,2007,26(1):6-10,25.
作者姓名:闫光辉
作者单位:兰州交通大学光电技术与智能控制教育部重点实验室 甘肃兰州730070,兰州交通大学电子与信息工程学院,甘肃兰州730070
基金项目:教育部重点实验室基金,甘肃省教育厅科研项目
摘    要:FDR(Fractal Dimensionality Reduction)算法的主要问题在于需要多次扫描数据集,I/O开销比较大,OptFDR(Optimized FDR)通过对FD-tree进行动态调整来避免多次扫描数据集,但对算法的空间需求比较高.借鉴Z-ordring索引技术的思想,设计并实现了一种改进的分形属性选择方法ZB-FDR(Z-ordering Based FDR).该方法仅需要扫描数据集一遍建立底层网格结构,基于该底层网格结构实现分形维数的计算及后向删除维操作.在合成数据集及实际数据集上的实验结果表明ZBFDR具有较为优良的整体性能.

关 键 词:维数削减  特征选择  特征抽取  分形维
文章编号:1001-4373(2007)01-0006-05
修稿时间:2006-05-18

Performance Optimization of Fractal Dimensionality Reduction Algorithm
Yan Guanghui.Performance Optimization of Fractal Dimensionality Reduction Algorithm[J].Journal of Lanzhou Railway University,2007,26(1):6-10,25.
Authors:Yan Guanghui
Institution:1. Key Laboratory of Opto-Electronic Technology and Intelligent Control(Lanzhou Jiaotong University
Abstract:FDR(Fractal Dimensionality Reduction) is the most famous fractal dimension based feature selection algorithm proposed by Traina in 2000.However,it is inefficient in the high dimensional data space for multiple scanning the data set.The optimized algorithm proposed in 2004,Opt-FDR,which scans the data set only once and adjusts the FD-tree dynamically for evaluating the fractal dimension.But the adjusting process is complicated and the space complexity is high.Taking advantage of the Z-ordering technique,we propose an optimized FDR,ZB-FDR(Z-ordering Based FDR),which scans the data set only once to initialize the lowest cell queue and performs the backward feature reduction.The experimental results show that ZB-FDR algorithm achieves better performance.
Keywords:Z-ordering
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号