Abstract
A reduct is a subset of attributes that are jointly sufficient and individually necessary for preserving a particular property of a given information system. The existing reduct approaches under soft set theory are still based on Boolean-valued information system. However, in the real applications, the data usually contain non-Boolean valued. In this paper, an alternative approach for attribute reduction in multi-valued information system under soft set theory is presented. Based on the notion of multi-soft sets and AND operation, attribute reduction can be defined. It is shown that the reducts obtained are equivalent with Pawlak’s rough reduction.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Zhao, Y., Luo, F., Wong, S.K.M., Yao, Y.Y.: A general definition of an attribute reduct. In: Yao, J., Lingras, P., Wu, W.-Z., Szczuka, M.S., Cercone, N.J., Ślȩzak, D. (eds.) RSKT 2007. LNCS (LNAI), vol. 4481, pp. 101–108. Springer, Heidelberg (2007)
Molodtsov, D.: Soft set theory-first results. Computers and Mathematics with Applications 37, 19–31 (1999)
Yao, Y.Y.: Relational interpretations of neighbourhood operators and rough set approximation operators. Information Sciences 111, 239–259 (1998)
Maji, P.K., Roy, A.R., Biswas, R.: An application of soft sets in a decision making problem. Computer and Mathematics with Application 44 (2002)
Chen, D., Tsang, E.C.C., Yeung, D.S., Wang, X.: Some notes on the parameterization reduction of soft sets. In: Proceeding of International Conference on Machine Learning and Cybernetics, vol. 3, pp. 1442–1445 (2003)
Chen, D., Tsang, E.C.C., Yeung, D.S., Wang, X.: The Parameterization Reduction of Soft Sets and its Applications. Computers and Mathematics with Applications 49, 757–763 (2005)
Zhi, K., Gao, L., Wang, L., Li, S.: The normal parameter reduction of soft sets and its algorithm. Computers and Mathematics with Applications 56, 3029–3037 (2008)
Zou, Y., Xiao, Z.: Data analysis approaches of soft sets under incomplete information. Knowledge Based Systems 21, 941–945 (2008)
Pawlak, Z.: Rough sets. International Journal of Computer and Information Science 11, 341–356 (1982)
Herawan, T., Mustafa, M.D.: A direct proof of every rough set is a soft set. In: Proceeding of IEEE International Conference AMS 2009, pp. 119–124 (2009)
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. An International Journal 177(1), 3–27 (2007)
Pawlak, Z.: Rough classification. International journal of human computer studies 51, 369–383 (1999)
Maji, P.K., Biswas, R., Roy, A.R.: Soft set theory. Computers and Mathematics with Applications 45, 555–562 (2003)
Herawan, T., Mustafa, M.D.: On multi-soft sets construction in information systems. In: Manuscript accepted at ICIC 2009 (2009) (to appear in LNAI Springer)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Herawan, T., Rose, A.N.M., Mat Deris, M. (2009). Soft Set Theoretic Approach for Dimensionality Reduction. In: Ślęzak, D., Kim, Th., Zhang, Y., Ma, J., Chung, Ki. (eds) Database Theory and Application. DTA 2009. Communications in Computer and Information Science, vol 64. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10583-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-10583-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10582-1
Online ISBN: 978-3-642-10583-8
eBook Packages: Computer ScienceComputer Science (R0)