Abstract
We propose a variation of the attribute exploration algorithm. Instead of implications with pseudo-intents as premises our approach uses implications with proper premises. It is known that the set of implications with proper premises is complete, but in general it is not minimal in size. This variation will allow us to calculate all implications of a formal context with premise size at most n, for some fixed \(n\in\mathbb N\). This is of interest if the attribute set is large and the user requests valid implications with small premises. Other applications can be seen for formal contexts where the maximal premise size of an implication with proper premise is known, for example multivalued contexts scaled by multiordinal scales only.
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
Armstrong, W.W.: Dependency structures of data base relationships. In: IFIP Congress, Geneva, Switzerland, pp. 580–583 (1974)
Burmeister, P., Holzer, R.: On the Treatment of Incomplete Knowledge in Formal Concept Analysis. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS, vol. 1867, pp. 385–598. Springer, Heidelberg (2000)
Ganter, B.: Algorithmen zur formalen Begriffsanalyse. In: Ganter, B., Wille, R., Wolf, K.E. (eds.) Beiträge zur Begriffsanalyse, pp. 196–212. B.I. Wissenschaftsverlag, Mannheim (1987)
Ganter, B.: Attribute exploration with background knowledge. Theoretical Computer Science 217(2), 215–233 (1999)
Ganter, B., Reppe, H.: Base Points, Non-unit Implications, and Convex Geometries. In: Kuznetsov, S.O., Schmidt, S. (eds.) ICFCA 2007. LNCS (LNAI), vol. 4390, pp. 210–220. Springer, Heidelberg (2007)
Ganter, B., Wille, R.: Implikationen und Abhängigkeiten zwischen Merkmalen. Preprint 1017, November 1986 TH Darmstadt (1986)
Ganter, B., Wille, R.: Formal Concept Analysis – Mathematical Foundations. Springer, Heidelberg (1999)
Gély, A., Nourine, L.: About the Family of Closure Systems Preserving Non-unit Implications in the Guigues-Duquenne Base. In: Missaoui, R., Schmidt, J. (eds.) ICFCA 2006. LNCS (LNAI), vol. 3874, pp. 191–204. Springer, Heidelberg (2006)
Reppe, H.: An FCA Perspective on n-Distributivity. In: Priss, U., Polovina, S., Hill, R. (eds.) ICCS 2007. LNCS (LNAI), vol. 4604, pp. 255–268. Springer, Heidelberg (2007)
Stumme, G.: Attribute Exploration with Background Implications and Exceptions, Data Analysis and Information Systems. Statistical and Conceptual approaches. Proc. GfKl 1995. Studies in Classification, Data Analysis, and Knowledge Organization 7, 457–469 (1996)
Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing iceberg concept lattices with TITANIC. Data Knowledge Engineering 42(2), 189–222 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reppe, H. (2008). Attribute Exploration Using Implications with Proper Premises. In: Eklund, P., Haemmerlé, O. (eds) Conceptual Structures: Knowledge Visualization and Reasoning. ICCS 2008. Lecture Notes in Computer Science(), vol 5113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70596-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-70596-3_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70595-6
Online ISBN: 978-3-540-70596-3
eBook Packages: Computer ScienceComputer Science (R0)