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.
This work was supported in part by the National Basic Research Program of China under grant no. 2004CB318103.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wang, J., Wang, J.: Reduct Algorithms on Discernibility Matrix: The Ordered Attributes Method. J. Computer Science and Technology 16(6), 489–504 (2001)
Han, S.Q., Wang, J.: Reduct and Attribute Order. J. Computer Science and Technology 19(4), 429–449 (2004)
Zhao, M.: Data Description Based on Reduct Theory. PhD thesis, Institute of Automation, Chinese Academy of Sciences (2004)
Pawlak, Z.: Rough sets. Int. J. Comput. Inform. Sci. 11(5), 341–356 (1982)
Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Slowinski, R. (ed.) Intelligent Decision Support Handbook of Applications and Advance of the Rough sets Theory, pp. 331–362 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Han, S., Wang, J. (2005). The Second Attribute. In: Ślęzak, D., Wang, G., Szczuka, M., Düntsch, I., Yao, Y. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2005. Lecture Notes in Computer Science(), vol 3641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11548669_17
Download citation
DOI: https://doi.org/10.1007/11548669_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28653-0
Online ISBN: 978-3-540-31825-5
eBook Packages: Computer ScienceComputer Science (R0)