An attribute reduction algorithm based on the information quantity
Wang Jue
Abstract
Wang Jue
Abstract
Reduction of knowledge is one of the important topics in the research on the rough set theory. This paper presents the concept of the information quantity of decision attributes with relation to given condition attributes and proves that its changing tendency is decreasing. Then, a new reduction algorithm based on information quantity is developed, with the time complexity of this algorithm being O(C3U2). An example shows that this algorithm is effective.
OpenAlex reports 5 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.
Reduction of knowledge is one of the important topics in the research on the rough set theory. This paper presents the concept of the information quantity of decision attributes with relation to given condition attributes and proves that its changing tendency is decreasing. Then, a new reduction algorithm based on information quantity is developed, with the time complexity of this algorithm being O(C3U2). An example shows that this algorithm is effective.
Key concepts: Rough set, Reduction (mathematics), Relation (database), Computer science, Algorithm, Set (abstract data type), Data mining, Mathematics