×
Leung, Yee; Li, Deyu

Maximal consistent block technique for rule acquisition in incomplete information systems. (English) Zbl 1069.68605

Inf. Sci. 153, 85-106 (2003).
Summary: The concept of a maximal consistent block is applied to formulate a new approximation to an object set in incomplete information systems with higher level of accuracy. Similar to the method of M. Kryszkiewicz [Inf. Sci. 112, 39–49 (1998; Zbl 0951.68548); ibid. 113, 271–292 (1999; Zbl 0948.68214)], the proposed rough-set-based rule acquisition method does not require change in the size of the original incomplete system. It, however, has the additional advantage of using a set of simpler discernibility functions of an incomplete system. This means that it can provide a more efficient computation for knowledge acquisition, especially in large incomplete systems.

Cited in 51 Documents

MSC:

68T30 Knowledge representation
06A12 Semilattices
68T05 Learning and adaptive systems in artificial intelligence
68T37 Reasoning under uncertainty in the context of artificial intelligence

Keywords:

Incomplete information system; Knowledge reduction; Maximal consistent block; Discernibility function; Rough set theory

Citations:

Zbl 0951.68548; Zbl 0948.68214
PDF BibTeX XML Cite
\textit{Y. Leung} and \textit{D. Li}, Inf. Sci. 153, 85--106 (2003; Zbl 1069.68605)
Full Text: DOI

References:

[1] Kryszkiewicz, M., Rough set approach to incomplete information systems, Information Sciences, 112, 39-49 (1998) · Zbl 0951.68548
[2] Kryszkiewicz, M., Rules in incomplete information systems, Information Sciences, 113, 271-292 (1999) · Zbl 0948.68214
[3] Slowinski, R.; Strfanowski, J., Rough-set reasoning about uncertain data, Fundamenta Informaticae, 27, 2-3, 229-244 (1996)
[4] Skowron, A.; Rauszer, C., The discernibility matrices and functions in information systems, (Slowinski, R., Intelligent Decision Support: Handbook of Applications and Advances ot Rough Sets Theory (1992), Kluwer Academic Publisher: Kluwer Academic Publisher Dordrecht), 331-362
[6] Tsumoto, S., Rule discovery in database with missing values based on rough set model, (Zhong, N.; Zhou, L., Methodologies for Knowledge Discover and Data Mining (1999), Springer: Springer Beijing, China), 274-278
[7] Lipski, W. J., On semantic issues connected with incomplete information databases, ACM Transactions on Databases Systems, 4, 262-296 (1979)
[8] Ziarko, W.; Shan, N., A method for computing all maximally general rules in attribute-value systems, Computational Intelligence, 12, 2, 223-234 (1996)
[9] Slowinski, R.; Vanderpooten, D., A generalized definition of rough approximations based on similarity, IEEE Transactions on Knowledge and Data Engineering, 12, 2, 331-336 (2000)
[10] Nakamura, A., A rough logic based on incomplete information and its application, International Journal of Approximate Reasoning, 15, 367-378 (1996) · Zbl 0935.03045
[11] Pawlak, Z., Rough sets. Theoretical Aspects of Reasoning about Data (1991), Kluwer Academic Publishers: Kluwer Academic Publishers Dordrecht · Zbl 0758.68054
[12] (Polkowski, L.; Skowron, A., Rough Sets in Knowledge Discovery 1. Methodology and Applications (1998), Physica-Verlag: Physica-Verlag Wurzburg) · Zbl 0910.00028
[13] (Polkowski, L.; Skowron, A., Rough Sets in Knowledge Discovery 2. Applications, Case Studies and Software Systems (1998), Physica-Verlag: Physica-Verlag Wurzburg) · Zbl 0910.00029
[14] Kryszkiewicz, M., Comparative study of alternative types of knowledge reduction in inconsistent systems, International Journal of Intelligent Systems, 16, 105-120 (2001) · Zbl 0969.68146
[15] Pawlak, Z., Drawing conclusions from data-the rough set way, International Journal of Intelligent Systems, 16, 3-11 (2001) · Zbl 0969.68144
[16] Deyu, L.; Yichen, M., Invariant characters of information systems under some homomorphisms, Information Sciences, 129, 211-220 (2000) · Zbl 0980.68110
[17] Pawlak, Z., Rough sets, International Journal of Computer and Information Science, 11, 341-356 (1982) · Zbl 0501.68053
[18] Skowron, A.; Rauszer, C., The discernibility matrices and functions in information systems, (Slowinski, R., Intelligent Decision Support: Handbook of Applications and Advances of Rough Sets Theory (1992), Kluwer Academic Publisher: Kluwer Academic Publisher Dordrecht), 331-362
[20] Skowron, A., Boolean reasoning for decision rules generation, (Komorowski, J.; Raś, Z., Proceedings of the Seventh International Symposium ISMIS’93, Trondheim, Norway. Proceedings of the Seventh International Symposium ISMIS’93, Trondheim, Norway, Lecture Notes in Artificial Intelligence, vol. 689 (1993), Springer-Verlag: Springer-Verlag Berlin), 295-305
[21] Skowron, A.; Polkowski, L., Synthesis of decision systems from data tables, (Lin, T. Y.; Cercone, N., Rough Sets and Data Mining, Analysis of Imprecise Data (1997), Kluwer Academic Publishers: Kluwer Academic Publishers Dordrecht), 259-299
[22] Skowron, A., Extracting laws from decision tables, Computer Intelligence, 11, 2, 371-388 (1995)
[24] Quinlan, J. R., Induction of decision trees, (Shavlik, J. W.; Dietterich, T. G., Readings in Machine Learning (1990), Morgan Kaufmann: Morgan Kaufmann Los Altos, CA), 57-69
[25] Chmielewski, M. R.; Grzymala-Busse, J. W.; Peterson, N. W.; Than, S., The rule induction system LERS-A version for personal computer, Foundations of Computing and Decision Science, 18, 3/4, 181-212 (1993) · Zbl 0806.68089
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.