Abstract
This paper describes two soft techniques, GDT-NN and GDT-RS, for mining if-then rules in databases with uncertainty and incompleteness. The techniques are based on a Generalization Distribution Table (GDT), in which the probabilistic relationships between concepts and instances over discrete domains are represented. The GDT provides a probabilistic basis for evaluating the strength of a rule. We describe that a GDT can be represented by connectionist networks (GDT-NN for short), and if-then rules can be discovered by learning on the GDT-NN. Further-more, we combine the GDT with the rough set methodology (GDT-RS for short). Thus, we can first find the rules with larger strengths from possible rules, and then find minimal relative reducts from the set of rules with larger strengths. The strength of a rule represents the uncertainty of the rule, which is influenced by both unseen instances and noises. We compare GDT-NN with GDT-RS, and describe GDT-RS is a better way than GDT-NN for large, complex databases.
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
T.M. Mitchell. “Generalization as Search”, Artif. Intell., Vol.18 (1982) 203–226.
D.E. Rumelhart, G.E. Hinton, and R.J. Williams, “Learning Internal Representations by Back-Propagation Errors”, Nature Vol.323 (1986) 533–536.
A. Skowron and C. Rauszer. “The discernibility matrics and functions in information systems”, R. Slowinski (ed.) Intelligent Decision Support (1992) 331–362.
T.Y. Lin and N. Cercone (ed.) Rough Sets and Data Mining: Analysis of Imprecise Data, Kluwer Academic Publishers (1997)
Z. Pawlak. ROUGH SETS, Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers (1991).
J.R. Quinlan, “Induction of Decision Trees”, Machine Learning, Vol.1, (1986).
N. Zhong and S. Ohsuga, “Using Generalization Distribution Tables as a Hypotheses Search Space for Generalization”, Proc. 4th Inter. Workshop on Rough Sets, Fuzzy Sets, and Machine Discovery (RSFD-96) (1996) 396–403.
N. Zhong, S. Fujitsu, and S. Ohsuga, “Generalization Based on the Connectionist Networks Representation of a Generalization Distribution Table”, Proc. First Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-97), World Scientific (1997) 183–197.
N. Zhong, J.Z. Dong, and S. Ohsuga, “Discovering Rules in the Environment with Noise and Incompleteness”, Proc. 10th Inter. Florida AI Reaserch Symposium (FLAIRS-97) edited in the Special Track on Uncertainty in AI (1997) 186–191.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhong, N., Dong, J., Ohsuga, S. (1998). Soft Techniques to Data Mining. In: Polkowski, L., Skowron, A. (eds) Rough Sets and Current Trends in Computing. RSCTC 1998. Lecture Notes in Computer Science(), vol 1424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69115-4_32
Download citation
DOI: https://doi.org/10.1007/3-540-69115-4_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64655-6
Online ISBN: 978-3-540-69115-0
eBook Packages: Springer Book Archive