Abstract
We consider the task of acquisition of terminological knowledge from given assertional data. However, when evaluating data of real-world applications we often encounter situations where it is impractical to deduce only crisp knowledge, due to the presence of exceptions or errors. It is rather appropriate to allow for degrees of uncertainty within the derived knowledge. Consequently, suitable methods for knowledge acquisition in a probabilistic framework should be developed.
In particular, we consider data which is given as a probabilistic formal context, i.e., as a triadic incidence relation between objects, attributes, and worlds, which is furthermore equipped with a probability measure on the set of worlds. We define the notion of a probabilistic attribute as a probabilistically quantified set of attributes, and define the notion of validity of implications over probabilistic attributes in a probabilistic formal context. Finally, a technique for the axiomatization of such implications from probabilistic formal contexts is developed. This is done is a sound and complete manner, i.e., all derived implications are valid, and all valid implications are deducible from the derived implications. In case of finiteness of the input data to be analyzed, the constructed axiomatization is finite, too, and can be computed in finite time.
Keywords
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 subscriptionsReferences
Ganter, B.: Attribute exploration with background knowledge. Theor. Comput. Sci. 217(2), 215–233 (1999)
Ganter, B.: Two Basic Algorithms in Concept Analysis. FB4-Preprint 831. Technische Hochschule Darmstadt, Darmstadt, Germany (1984)
Ganter, B.: Two basic algorithms in concept analysis. In: Kwuida, L., Sertkaya, B. (eds.) ICFCA 2010. LNCS (LNAI), vol. 5986, pp. 312–340. Springer, Heidelberg (2010). doi:10.1007/978-3-642-11928-6_22
Ganter, B., Wille, R.: Formal Concept Analysis. Mathematical Foundations. Springer, Heidelberg (1999)
Guigues, J.-L., Duquenne, V.: Famille minimale d’implications informatives résultant d’un tableau de données binaires. Math. Sci. Humaines 95, 5–18 (1986)
Kriegel, F.: Concept Explorer FX. Software for Formal Concept Analysis with Description Logic Extensions, 2010–2017. https://github.com/francesco-kriegel/conexp-fx
Kriegel, F.: NextClosures – Parallel Exploration of Constrained Closure Operators. LTCS-Report 15-01. Chair for Automata Theory, Technische Universität Dresden (2015)
Kriegel, F.: Parallel attribute exploration. In: Haemmerlé, O., Stapleton, G., Faron Zucker, C. (eds.) ICCS 2016. LNCS (LNAI), vol. 9717, pp. 91–106. Springer, Cham (2016). doi:10.1007/978-3-319-40985-6_8
Kriegel, F.: Probabilistic implicational bases in FCA and probabilistic bases of GCIs in \({\cal{EL}}^\bot \). In: Ben Yahia, S., Konecny, J. (eds.) Proceedings of the Twelfth International Conference on Concept Lattices and Their Applications. CEUR Workshop Proceedings, vol. 1466, Clermont-Ferrand, France, pp. 193–204. CEUR-WS.org, 13–16 October 2015
Kriegel, F., Borchmann, D.: NextClosures: parallel computation of the canonical base. In: Ben Yahia, S., Konecny, J. (eds.) Proceedings of the Twelfth International Conference on Concept Lattices and Their Applications. CEUR Workshop Proceedings, vol. 1466, Clermont-Ferrand, France, pp. 181–192. CEUR-WS.org, 13–16 October 2015
Maier, D.: The Theory of Relational Databases. Computer Science Press, Rockville (1983)
Stumme, G.: Attribute exploration with background implications and exceptions. In: Bock, H.-H., Polasek, W. (eds.) Data Analysis and Information Systems. Studies in Classification, Data Analysis, and Knowledge Organization, pp. 457–469. Springer, Heidelberg (1996)
Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets. LNCS, vol. 83, pp. 445–470. Springer, Netherlands (1982). doi:10.1007/978-94-009-7798-3_15
Acknowledgements
The author gratefully thanks the anonymous reviewers for their constructive hints and helpful remarks.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Kriegel, F. (2017). Implications over Probabilistic Attributes. In: Bertet, K., Borchmann, D., Cellier, P., Ferré, S. (eds) Formal Concept Analysis. ICFCA 2017. Lecture Notes in Computer Science(), vol 10308. Springer, Cham. https://doi.org/10.1007/978-3-319-59271-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-59271-8_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59270-1
Online ISBN: 978-3-319-59271-8
eBook Packages: Computer ScienceComputer Science (R0)