A Quick Reduction Algorithm Based on Important Index
Year: 2014
Type: article
Abstract: This paper tries to find a more feasible method to achieve core and reduction. Against concepts "distinguishable relation of attribute set" and "distinguishable unit set of attribute set", it defines a concept "important index", and proposes an effective and quick approach for important index. After drawn out the involved theory and equivalent proposition, also presents algorithms for core and reduction upon the important index. The heuristic reduction algorithm adopts the bottom-up design, and gets reduction based on the heuristic information "important index of attribute set". The complexity of the algorithm in space is O(m), and the complexity in time is O(mn2). The theoretical analysis and results show that the ways proposed here simplify the relevant operations and are suitable to deal with the huge volume of data.
Source: Applied Mechanics and Materials
Authors: Xin Ying Chen, Guan Yu Li
Institution: Dalian Maritime University
Language: English
Topic: Rough Sets and Fuzzy Logic
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Funder: National Science Foundation
OpenAlex ID: W2028394466
