Algorithm research about feature selection based on fractal dimension
被引:0
|
作者:
Wu, Xinling
论文数: 0引用数: 0
h-index: 0
机构:
GuangDong Polytech Normal Univ, Inst Comp Sci, Guangzhou, Guangdong, Peoples R ChinaGuangDong Polytech Normal Univ, Inst Comp Sci, Guangzhou, Guangdong, Peoples R China
Wu, Xinling
[1
]
Zhou, Guoqiang
论文数: 0引用数: 0
h-index: 0
机构:
GuangDong Polytech Normal Univ, Inst Educ Technol & Commun, Guangzhou, Guangdong, Peoples R ChinaGuangDong Polytech Normal Univ, Inst Comp Sci, Guangzhou, Guangdong, Peoples R China
Zhou, Guoqiang
[2
]
机构:
[1] GuangDong Polytech Normal Univ, Inst Comp Sci, Guangzhou, Guangdong, Peoples R China
[2] GuangDong Polytech Normal Univ, Inst Educ Technol & Commun, Guangzhou, Guangdong, Peoples R China
fractal dimension;
data mining;
feature selection;
data preprocessing;
algorithm complexity;
D O I:
暂无
中图分类号:
TP18 [人工智能理论];
学科分类号:
081104 ;
0812 ;
0835 ;
1405 ;
摘要:
The tradition backward feature selection algorithm based on fractal dimension need to calculate the fractal dimension of various projection sets about the datasets and to scan dataset many times that make the algorithm low efficiency and high complexity. By analyzed the nature of the individual contribution that an attribute affects the intrinsic dimension of a dataset, a forward feature selection algorithm and a two-way feature selection algorithm were proposed based on fractal dimension. The two algorithms realize the feature selection all based on the concept of attribute individual contribution to the intrinsic dimension of a dataset. The experiment results show that the forward feature selection algorithm and the two-way feature selection algorithm proposed in this paper can reduce the times of calculating the fractal dimension a lot than the backward feature selection algorithm and lower the algorithm complexity effectively. The lower space complexity algorithm to calculate the fractal dimension was proposed too in this paper.
引用
收藏
页码:414 / 417
页数:4
相关论文
共 8 条
[1]
Belussi A., 1995, PROC 21 INT C VERY, P299, DOI [10.5555/215437, DOI 10.5555/215437]