An Attribute Reduct and Attribute Significance Algorithm of Continuous Domain Decide Table
Liu Wenjun
Abstract
Liu Wenjun
Abstract
Firstly, the author generalizes the indiscernible relation to similarity relation, gives a definition of lambda-discernibility matrix; secondly, an attribute reduct algorithm of decision table with continuous condition attributes is put forward; thirdly, an algorithm of computing significance of each condition attribute is put forward according to the properties of lambda-discernibility matrix; at last, the time complexity of the attribute reduct algorithm is analyzed and the rationality and effectiveness of this algorithm is accounted for through an example.
OpenAlex reports 2 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.
Firstly, the author generalizes the indiscernible relation to similarity relation, gives a definition of lambda-discernibility matrix; secondly, an attribute reduct algorithm of decision table with continuous condition attributes is put forward; thirdly, an algorithm of computing significance of each condition attribute is put forward according to the properties of lambda-discernibility matrix; at last, the time complexity of the attribute reduct algorithm is analyzed and the rationality and effectiveness of this algorithm is accounted for through an example.
Key concepts: Reduct, Attribute domain, Rough set, Variable and attribute, Relation (database), Decision table, Similarity (geometry), Algorithm