Abstract
Non–deterministic Information Systems (NISs) are ad-vanced extensions of Deterministic Information Systems (DISs), and NISs are known well as systems handling information incompleteness in tables. This paper examines manipulations on equivalence relations in DISs and manipulations on possible equivalence relations in NISs. This paper also follows rough sets based rule generation in DISs, and proposes rough sets based hypothesis generation in NISs. A hypothesis in NISs is defined by a formula satisfying some kinds of constraint, and effective algorithms for generating hypotheses in NISs are presented. Possible equivalence relations play important roles in generating hypotheses. Some illustrative examples and real executions of algorithms are shown, too.
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: Theoretical Aspects of Reasoning About Data. Kluwer, Dordrecht (1991)
Pawlak, Z.: New look on Bayes’ Theorem - the rough set outlook. Bulletin of Int. Rough Set Society 5, 1–8 (2001)
Komorowski, J., Pawlak, Z., Polkowski, L., Skowron, A.: Rough Sets: A tutorial. In: Pal, S.K., Skowron, A. (eds.) Rough Fuzzy Hybridization, pp. 3–98. Springer, Singapore (1999)
Nakamura, A., Tsumoto, S., Tanaka, H., Kobayashi, S.: Rough set theory and its applications. Journal of Japanese Society for AI 11, 209–215 (1996)
Polkowski, L., Skowron, A. (eds.): Rough Sets in Knowledge Discovery 1. Studies in Fuzziness and Soft Computing 18, Physica (1998)
Polkowski, L., Skowron, A. (eds.): Rough Sets in Knowledge Discovery 2. Studies in Fuzziness and Soft Computing 19, Physica (1998)
Grzymala–Busse, J.: A new version of the rule induction system LERS. Fundamenta Informaticae 31, 27–39 (1997)
Ziarko, W.: Variable precision rough set model. Journal of Computer and System Sciences 46, 39–59 (1993)
Tsumoto, S.: Knowledge discovery in clinical databases and evaluation of discovered knowledge in outpatient clinic. Information Sciences 124, 125–137 (2000)
Zhong, N., Dong, J., Fujitsu, S., Ohsuga, S.: Soft techniques to rule discovery in data. Transactions of Information Processing Society of Japan 39, 2581–2592 (1998)
Rough Set Software. Bulletin of Int. Rough Set Society 2, 15–46 (1998)
Codd, E.: A relational model of data for large shared data banks. Communications of the ACM 13, 377–387 (1970)
Grzymala–Busse, J.: On the unknown attribute values in learning from examples. In: Raś, Z.W., Zemankova, M. (eds.) ISMIS 1991. LNCS, vol. 542, pp. 368–377. Springer, Heidelberg (1991)
Orlowska, E., Pawlak, Z.: Representation of nondeterministic information. Theoretical Computer Science 29, 27–39 (1984)
Orlowska, E.: What you always wanted to know about rough sets. In: Orlowska, E. (ed.) Incomplete Information: Rough Set Analysis, Studies in Fuzziness and Soft Computing 13, Physica, pp. 1–20 (1998)
Lipski, W.: On semantic issues connected with incomplete information Databases. ACM Transactions on Database Systems 4, 262–296 (1979)
Lipski, W.: On databases with incomplete information. Journal of the ACM 28, 41–70 (1981)
Nakamura, A.: A rough logic based on incomplete information and its application. Int. Journal of Approximate Reasoning 15, 367–378 (1996)
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)
Sakai, H.: Another fuzzy prolog. In: Proceedings of the 4th Int. Workshop on Rough Set, Fuzzy Set and Machine Discovery, Tokyo, pp. 261–268 (1996)
Sakai, H.: Some issues on nondeterministic knowledge bases with incomplete and selective information. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol. 1424, pp. 424–431. Springer, Heidelberg (1998)
Sakai, H., Okuma, A.: An algorithm for finding equivalence relations from tables with non–deterministic information. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) RSFDGrC 1999. LNCS (LNAI), vol. 1711, pp. 64–72. Springer, Heidelberg (1999)
Sakai, H., Okuma, A.: An algorithm for checking dependencies of attributes in a table with non–deterministic information: A rough sets based approach. In: Mizoguchi, R., Slaney, J.K. (eds.) PRICAI 2000. LNCS (LNAI), vol. 1886, pp. 219–229. Springer, Heidelberg (2000)
Sakai, H.: Two procedures for dependencies among attributes in a table with nondeterministic information: a summary. In: Terano, T., Nishida, T., Namatame, A., Tsumoto, S., Ohsawa, Y., Washio, T. (eds.) JSAI-WS 2001. LNCS (LNAI), vol. 2253, pp. 301–305. Springer, Heidelberg (2001)
Sakai, H.: Effective procedures for handling possible equivalence relations in non– deterministic information systems. Fundamenta Informaticae 48, 343–362 (2001)
Grzymala–Busse, J., Werbrouck, P.: On the best search method in the LEM1 and LEM2 algorithms. In: Orlowska, E. (ed.) Incomplete Information: Rough Set Analysis. Studies in Fuzziness and Soft Computing, vol. 13, pp. 75–91. Physica, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sakai, H. (2004). Possible Equivalence Relations and Their Application to Hypothesis Generation in Non-deterministic Information Systems. In: Peters, J.F., Skowron, A., Dubois, D., Grzymała-Busse, J.W., Inuiguchi, M., Polkowski, L. (eds) Transactions on Rough Sets II. Lecture Notes in Computer Science, vol 3135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27778-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-27778-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23990-1
Online ISBN: 978-3-540-27778-1
eBook Packages: Computer ScienceComputer Science (R0)