Abstract
Conventional set approximations are based on a set of attributes; however, these approximations cannot relate an object to the corresponding attribute. In this study, a new model for set approximation based on individual attributes is proposed for interval-valued data. Defining an indiscernibility relation is omitted since each attribute value itself has a set of values. Two types of approximations, single– and multiattribute approximations, are presented. A multi-attribute approximation has two solutions: a maximum and a minimum solution. A maximum solution is a set of objects that satisfy the condition of approximation for at least one attribute. A minimum solution is a set of objects that satisfy the condition for all attributes. The proposed set approximation is helpful in finding the features of objects relating to condition attributes when interval-valued data are given. The proposed model contributes to feature extraction in interval-valued information systems.
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
Asuncion, A., Newman, D.J.: UCI Machine Learning Repository. University of California, Department of Information and Computer Science, Irvine, CA (2007), http://www.ics.uci.edu/~mlearn/MLRepository.html
Billard, L., Diday, E.: Symbolic Data Analysis. John Wiley & Sons, Chichester (2006)
Deng, J.-L.: Grey System. China Ocean Press, Beijing (1988)
Diday, E., Esposito, F.: An introduction to symbolic data analysis and the SODAS software. Intelligent Data Analysis 7, 583–601 (2003)
Guan, Y.-Y., Wang, H.-K.: Set-valued information systems. Information Sciences 176, 2507–2525 (2006)
Hansen, E., Walster, G.W.: Global Optimization Using Interval Analysis, 2nd edn. Marcel Dekker, New York (2004)
Kryszkiewicz, M.: Rough set approach to incomplete information systems. Information Sciences 112, 39–49 (1998)
Kryszkiewicz, M.: Rules in incomplete information systems. Information Sciences 113, 271–292 (1999)
Leung, Y., Li, D.: Maximal consistent block technique for rule acquisition in incomplete information systems. Information Sciences 153, 85–106 (2003)
Leung, Y., Fischer, M.M., Wu, W.-Z., Mi, J.-S.: A rough set approach for the discovery of classification rules in interval-valued information systems. International Journal of Approximate Reasoning (2007), doi:10.1016/j.ijar.2007.05.001
Li, G.-D., Yamaguchi, D., Nagai, M.: A grey-based decision making approach to suppliers selection problem. Mathematical and Computer Modeling 46, 573–581 (2007)
Li, G.-D., Yamaguchi, D., Nagai, M.: A grey-based rough decision-making approach to supplier selection. International Journal of Advanced Manufacturing Technology (2007), doi:10.1007/s00170-006-0910-y
Lipski Jr., W.: On semantic issues connected with incomplete information databases. ACM Transactions on Database Systems 4, 262–296 (1979)
Liu, S.-F., Lin, Y.: Grey Information. Springer, Heidelberg (2006)
Moore, R.E.: Reliability in Computing. Academic Press, London (1988)
Nakamura, A.: A rough logic based on incomplete information and its application. International Journal of Approximate Reasoning 15, 367–378 (1996)
Nagai, M., Yamaguchi, D.: Elements on Grey System Theory and its Applications. Kyoritsu-Shuppan (2004) (in Japanese)
Orłowska, E., Pawlak, Z.: Representation of nondeterministic information. Theoretical Computer Science 29, 27–39 (1984)
Pawlak, Z.: Rough sets. International Journal of Computer and Information Sciences 11, 341–356 (1982)
Pawlak, Z.: Rough sets Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)
Sakai, H., Okuma, A.: Basic algorithms and tools for rough non-deterministic information analysis. In: Peters, J.F., Skowron, A., Grzymała-Busse, J.W., Kostek, B.z., Świniarski, R.W., Szczuka, M.S. (eds.) Transactions on Rough Sets I. LNCS, vol. 3100, pp. 209–231. Springer, Heidelberg (2004)
Taylor, J.R.: An Introduction to Error Analysis. University Science Books (1982)
Wen, K.-L.: Grey Systems: Modeling and Prediction. Yang’s Scientific Research Institute (2004)
Yamaguchi, D., Li, G.-D., Nagai, M.: On the combination of rough set theory and grey theory based on grey lattice operations. In: Greco, S., Hata, Y., Hirano, S., Inuiguchi, M., Miyamoto, S., Nguyen, H.S., Słowiński, R. (eds.) RSCTC 2006. LNCS (LNAI), vol. 4259, pp. 507–516. Springer, Heidelberg (2006)
Yamaguchi, D., Li, G.-D., Nagai, M.: A grey-rough set approach for interval data reduction of attributes. In: Kryszkiewicz, M., Peters, J.F., Rybiński, H., Skowron, A. (eds.) RSEISP 2007. LNCS (LNAI), vol. 4585, pp. 400–410. Springer, Heidelberg (2007)
Yao, Y.-Y.: Two views of the theory of rough sets in finite universes. International Journal of Approximate Reasoning 15, 291–317 (1996)
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
Yamaguchi, D., Murata, A., Li, GD., Nagai, M. (2010). Rough Set Approximations in Formal Concept Analysis. In: Peters, J.F., Skowron, A., Słowiński, R., Lingras, P., Miao, D., Tsumoto, S. (eds) Transactions on Rough Sets XII. Lecture Notes in Computer Science, vol 6190. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14467-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-14467-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14466-0
Online ISBN: 978-3-642-14467-7
eBook Packages: Computer ScienceComputer Science (R0)