Abstract
This paper presents an alternative approach for constructing a hierarchical rough set approximation in an information system. It is based on the notion of dependency of attributes. The proposed approach is started with the notion of a nested sequence of indiscernibility relations that can be defined from the dependency of attributes. With this notion, a nested rough set approximation can be easily constructed. Then, the notion of a nested rough set approximation is used for constructing a hierarchical rough set approximation. Lastly, applications of a hierarchical rough set approximation for data classification and capturing maximal association in document collection through information systems are presented.
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
Pawlak, Z.: Rough sets. International Journal of Computer and Information Science 11, 341–356 (1982)
Pawlak, Z.: Rough sets: A theoretical aspect of reasoning about data. Kluwer Academic Publishers, Dordrecht (1991)
Pawlak, Z., Skowron, A.: Rudiments of rough sets. Information Sciences 177(1), 3–27 (2007)
Pawlak, Z., Skowron, A.: Rough sets: Some extensions. Information Sciences 177(1), 28–40 (2007)
Yao, Y.Y.: Granular Computing Using Neighborhood Systems. In: Roy, R., Furuhashi, T., Chawdhry, P.K. (eds.) Advances in Soft Computing: Engineering Design and Manufacturing, pp. 539–553. Springer-Verlag, Heidelberg (1999)
Yao, Y.Y.: Information granulation and rough set approximation. International Journal of Intelligent Systems 16(1), 87–104 (2001)
Marek, W., Rasiovwa, H.: Gradual Approximation Sets by Means of Equivalence Relations. Bulletin of Polish Academy of Sciences 35, 233–238 (1987)
Yao, Y.Y.: Stratified rough sets and granular computing. In: The Proceedings of the 18th International Conference of the North American Fuzzy Information Processing Society, pp. 800–804. IEEE Press, Los Alamitos (1999)
Yao, Y.Y.: Rough sets, neighborhood systems, and granular computing. In: The Proceedings of the IEEE Canadian Conference on Electrical and Computer Engineering, pp. 1553–1558. IEEE Press, Edmonton (1999)
Parmar, D., Wu, T., Blackhurst, J.: MMR: An algorithm for clustering categorical data using rough set theory. Data and Knowledge Engineering 63, 879–893 (2007)
Bi, Y., Anderson, T., McClean, S.: A rough set model with ontologies for discovering maximal association rules in document collections. Knowledge-Based Systems 16, 243–251 (2003)
Guan, J.W., Bell, D.A., Liu, D.Y.: The Rough Set Approach to Association Rule Mining. In: Proceedings of the Third IEEE International Conference on Data Mining (ICDM 2003), pp. 529–532 (2003)
Guan, J.W., Bell, D.A., Liu, D.Y.: Mining Association Rules with Rough Sets. Studies in Computational Intelligence, pp. 163–184. Springer, Heidelberg (2005)
Feldman, R., Aumann, Y., Amir, A., Zilberstein, A., Klosgen, W.: Maximal association rules: a new tool for mining for keywords cooccurrences in document collections. In: The Proceedings of the KDD 1997, pp. 167–170 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Herawan, T., Yanto, I.T.R., Deris, M.M. (2010). A Construction of Hierarchical Rough Set Approximations in Information Systems Using Dependency of Attributes. In: Nguyen, N.T., Katarzyniak, R., Chen, SM. (eds) Advances in Intelligent Information and Database Systems. Studies in Computational Intelligence, vol 283. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12090-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-12090-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12089-3
Online ISBN: 978-3-642-12090-9
eBook Packages: EngineeringEngineering (R0)