Paper
13 March 2013 A fast algorithm for attribute reduction based on Trie tree and rough set theory
Feng Hu, Xiao-yan Wang, Chuan-jiang Luo
Author Affiliations +
Abstract
Attribute reduction is an important issue in rough set theory. Many efficient algorithms have been proposed, however, few of them can process huge data sets quickly. In this paper, combining the Trie tree, the algorithms for computing positive region of decision table are proposed. After that, a new algorithm for attribute reduction based on Trie tree is developed, which can be used to process the attribute reduction of large data sets quickly. Experiment results show its high efficiency.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Feng Hu, Xiao-yan Wang, and Chuan-jiang Luo "A fast algorithm for attribute reduction based on Trie tree and rough set theory", Proc. SPIE 8784, Fifth International Conference on Machine Vision (ICMV 2012): Algorithms, Pattern Recognition, and Basic Technologies, 87841E (13 March 2013); https://doi.org/10.1117/12.2014029
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Detection and tracking algorithms

Algorithm development

Data processing

Algorithms

Machine learning

Data mining

Heart

RELATED CONTENT

Graph-based anomaly detection using regression on HTTP
Proceedings of SPIE (December 08 2022)
Cross domains Arabic named entity recognition system
Proceedings of SPIE (July 11 2016)
An efficient fractal dimension based clustering algorithm
Proceedings of SPIE (September 10 2007)
Multiclass kernel-based feature extraction
Proceedings of SPIE (March 12 2002)

Back to Top