An Concise Reduction algorithm Based on Rough Set
Pla Information
Abstract
Pla Information
Abstract
The volume of data being generated nowadays is increasingly large . How to extract useful information from such data collections is an important issue . A promising technique is the Rough Set theory ,a new mathematical approach to data analysis based on classification of objects into similarity classes which are indiscernible with respect to some features . In this paper ,basic concept of rough set is presented ,followed by a new reduction algorithm based on Rough Set .
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The volume of data being generated nowadays is increasingly large . How to extract useful information from such data collections is an important issue . A promising technique is the Rough Set theory ,a new mathematical approach to data analysis based on classification of objects into similarity classes which are indiscernible with respect to some features . In this paper ,basic concept of rough set is presented ,followed by a new reduction algorithm based on Rough Set .
Key concepts: Rough set, Reduction (mathematics), Data mining, Set (abstract data type), Data set, Computer science, Data reduction, Algorithm