Abstract
Relations between two Boolean attributes derived from data can be quantified by truth functions defined on four-fold tables corresponding to pairs of the attributes. In the paper, several classes of such quantifiers (implicational, double implicational, equivalence ones) with truth values in the unit interval are investigated. The method of construction of the logically nearest double implicational and equivalence quantifiers to a given implicational quantifier (and vice versa) is described and approved.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Aggraval, R., et al.: Fast Discovery of Association Rules. In: Fayyad, V.M., et al. (eds.) Advances in Knowledge Discovery and Data Mining, pp. 307–328. AAAI Press / MIT Press, Menlo Park (1996)
Batagelj, V., Bren, M.: Comparing Resemblance Measures. J. of Classification 12, 73–90 (1995)
Berka, P., Ivánek, J.: Automated Knowledge Acquisition for PROSPECTOR-like Expert Systems. In: Bergadano, R. (ed.) Machine Learning. ECML 1994 Catania, pp. 339–342. Springer, Heidelberg (1994)
Hájek, P., Havránek, T.: Mechanising Hypothesis Formation - Mathematical Foundations for a General Theory, p. 396. Springer, Berlin (1978)
Hájek, P., Havránek, T., Chytil, M.: Metoda GUHA. Academia, Praha, 314 p (1983) (in Czech)
Hájek, P., Sochorová, A., Zvárová, J.: GUHA for personal computers. Computational Statistics & Data Analysis 19, 149–153 (1995)
Hájek, P., Holeňa, M.: Formal Logics of Discovery and Hypothesis Formation by Machine. In: Arikawa, S., Motoda, H. (eds.) Discovery Science, pp. 291–302. Springer, Berlin (1998)
Ivánek, J., Stejskal, B.: Automatic Acquisition of Knowledge Base from Data without Expert: ESOD (Expert System from Observational Data). In: Proc. COMP- STAT 1988 Copenhagen, pp. 175–180. Physica-Verlag, Heidelberg (1988)
Rauch, J.: GUHA as a Data Mining Tool. In: Practical Aspects of Knowledge Management. Schweizer Informatiker Gesellshaft Basel (1996)
Rauch, J.: Logical Calculi for Knowledge Discovery in Databases. In: Komorowski, J., Zytkow, J. (eds.) Principles of Data Mining and Knowledge Discovery, pp. 47–57. Springer, Berlin (1997)
Rauch, J.: Classes of Four-Fold Table Quantifiers. In: Quafafou, M., Zytkow, J. (eds.) Principles of Data Mining and Knowledge Discovery, pp. 203–211. Springer, Berlin (1998)
Rauch, J.: 4FT-Miner - popis procedury. Technical Report LISp-98-09, Praha (1999)
Zembowicz, R.: From Contingency Tables to Various Forms of Knowledge in Databases. In: Fayyad, U.M., et al. (eds.) Advances in Knowledge Discovery and Data Mining, pp. 329–349. AAAI Press/ The MIT Press, Menlo Park (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ivánek, J. (1999). On the Correspondence between Classes of Implicational and Equivalence Quantifiers. In: Żytkow, J.M., Rauch, J. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 1999. Lecture Notes in Computer Science(), vol 1704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48247-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-48247-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66490-1
Online ISBN: 978-3-540-48247-5
eBook Packages: Springer Book Archive