期刊
INFORMATION SCIENCES
卷 629, 期 -, 页码 746-759出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2023.01.046
关键词
Feature selection; Hypergraph; Description vector; Rough sets
The curse of dimensionality is a bottleneck in big data and artificial intelligence. To address this issue, a more efficient approach to graph construction based on a description vector is proposed. The graph-based description vector (GDV) algorithm is developed for fast search and has lower time and space complexities than four existing algorithms, while maintaining the same level of classification accuracy.
The curse of dimensionality is a bottleneck in big data and artificial intelligence. To reduce the dimensionality of data using the minimal vertex covers of graphs, a discernibility matrix can be applied to construct a hypergraph. However, constructing a hypergraph using a discernibility matrix is a time-consuming and memory-consuming task. To solve this problem, we propose a more efficient approach to graph construction based on a description vector. We develop a graph -based heuristic algorithm for feature selection, named the graph-based description vector (GDV) algorithm, which is designed for fast search and has lower time and space complexities than four existing representative algorithms. Numerical experiments have shown that, compared with these four algorithms, the average running time of the GDV algorithm is reduced by a factor of 36.81 to 271.54, while the classification accuracy is maintained at the same level.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据