The second attribute

  • Authors:

  • Suqing Han;Jue Wang

  • Affiliations:

  • ,Laboratory of Complex Systems and Intelligence Science, Institute of Automation, Chinese Academy of Sciences, Beijing, P.R. China;Laboratory of Complex Systems and Intelligence Science, Institute of Automation, Chinese Academy of Sciences, Beijing, P.R. China

  • Venue:
  • RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In practice, many datasets are shared among multiple users. However, different users may desire different knowledge from the datasets. It implies that we need to provide a specification which mines different solutions from the dataset according to the semantic of requirements. Attribute order is a better approach to describing the semantic. A reduct algorithm based on attribute order has been presented in [1]. Because of its completeness for reduct and its unique output for a given attribute order, this algorithm can be regarded as a mapping from the attribute orders set to the reducts set. This paper investigates the structure of attribute orders set for the reduct. The second attribute theorem, which can be used to determine the range of attribute orders with the same reduct for a given attribute order, has been proved in [2]. Consequently, key to use the second attribute theorem is how to find the second attributes with the largest subscript for application in an efficient way. This paper therefore presents a method based on the tree expression to fulfill the above task.