2012•Unpublished venueRequires access

A quick value reduction algorithm of rough set

Xiaofan Wang, Baoshu Wang

Abstract

In order to get a value reduction quickly, this paper puts forwards a new algorithm of value reduction based on attribute-value-tree model in attribute order and proves it's correctness. A attribute reduction and value reduction can be got quickly at the same time from a discrete table in this algorithm. The computational complexity of reduction is changed to O(|U|2|C|) where |U| and |C| are the number of objects and attributes. It is fit to process large data and validated to improve the efficiency by tests.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Correctness, Reduction (mathematics), Value (mathematics), Rough set, Algorithm, Set (abstract data type), Computer science, Table (database)