Abstract
The indiscernibility relation is the basic concept in Rough set theory, a novel representation of indiscernibility relation using Zero-Suppressed BDDs is proposed in this paper. Through introducing the indiscernibility matrix and the indiscernibility graph, we put forward the encoding of the variable and give the characteristic function. Once the characteristic function is constructed, it can be represented using ZBDDs.And further, combined with an example, we analyze the effectiveness of this method. It provides a basis for deal with rough set computing.
Chapter PDF
References
Pawlak, Z.: Rough sets. International Journal of Information and Computer Science 11(5), 341–356 (1982)
Skowron, A., Rauszer: The discernibility matrices and functions in information systems. In: Slowinski, R. (ed.) Intelligent Decision Support–handbook of Applications and Advances of the Rough Sets Theory, pp. 331–362. Kluwer Academic Publishers, Dordrecht (1992)
Pawlak, Z.: Rough set approach to multi-attribute decision analysis. European Journal of Operational Research 72(3), 443–459 (1994)
Pawlak, Z., Skowron, A.: Rudiments of rough set. Information Sciences 177(1), 3–27 (2007)
Muir, A., Düntsch, I., Gediga, G.: Rough set data representation using binary decision diagrams. Computational Sciences 98(1), 197–211 (2004)
Chen, Y., Miao, D.: Searching Algorithm for Attribute Reduction based on Power Graph. Chinese Journal of Computers 32(8), 1486–1492 (2009)
Gu, T., Xu, Z., Yang, Z.: Symbolic OBDD representations for mechanical assembly sequences. Computer-Aided Design 40, 411–421 (2008)
Yao, Y., Zhao, Y., Wang, J.: On Reduct Construction Algorithms. In: Proceedings of the First International Conference on Rough Sets and Knowledge Technologies, Chongqing, China, pp. 297–304 (2006)
Yao, Y., Zhao, Y.: Discernibility matr Simplification for constructing attribute ruducts. Information Sciences 179(7), 867–882 (2009)
Thangavel, K., Pethalakshmi, A.: Dimensionality reduction based on rough set theory: A review. Applied Soft Computing (9), 1–12 (2009)
Hu, X.H., Cercone, N.: Learning in relational databases: A rough set approach. Computational Intelligence 11(2), 323–337 (1995)
Ye, D., Chen, Z.: A new discernibility matrix and the computation of a core. Acta Electronica Sinica 30(7), 1086–1088 (2002)
Wang, G.: Calculation methods for core attributes of decision table. Chinese Journal of Computer 26(5), 611–615 (2003)
Gu, T., Xu, Z.: Ordered binary decision diagram and it s application, pp. 22–57. Science Press, Beijing (2009)
Minato, S.: Zero-suppressed BDDS for set manipulation in combinatorial problems. In: Proceeding of 30th ACM/IEEE Design Automation Conference, pp. 272–277
Ognjenovic, V., Brtka, V., Jovanovic, M., Brtka, E., Berkovic, I.: The Representation of Indiscerniblity Relation by Graph. In: Proceeding of 9th IEEE International Symposium on Intelligent Systems and Informatics, pp. 91–94
Matsunaga, Y., Fujita, M.: Multi-level Logic Optimization Using Binary Decision Diagrams. In: IEEE International Conference on Computer Aided Design 1989, Santa Clara (November 1989)
Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers 35(8), 677–691 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Wei, Q., Gu, T., Li, F., Cai, G. (2012). The Representation of Indiscernibility Relation Using ZBDDs. In: Shi, Z., Leake, D., Vadera, S. (eds) Intelligent Information Processing VI. IIP 2012. IFIP Advances in Information and Communication Technology, vol 385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32891-6_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-32891-6_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32890-9
Online ISBN: 978-3-642-32891-6
eBook Packages: Computer ScienceComputer Science (R0)