Abstract
Formal concept analysis (FCA) comprises a set of powerful algorithms which can be used for data analysis and manipulation, and a set of visualisation tools which enable the discovery of meaningful relationships between attributes of the data. We explore the potential of combining FCA and mathematical discovery tools in order to better facilitate discovery tasks. In particular, we propose a novel lookup method for the Encyclopedia of Integer Sequences, and we show how conjectures from the Graffiti discovery program can be better understood using FCA visualisation tools. We argue that, not only can FCA tools greatly enhance the management and visualisation of mathematical knowledge, but they can also be used to drive exploratory processes.
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
Colton, S.: Refactorable numbers - a machine invention. Journal of Integer Sequences, 2 (1999)
Colton, S., Dennis, L.: The numberswithnames program. In: Proceedings of the Seventh AI and Maths Symposium (2002)
Colton, S., Torres, P., Cairns, P., Sorge, V.: Managing automatically formed mathematical theories. In: Proceedings of the 5th International Conference on Mathematical Knowledge Management (2006)
Colton, S.: Automated Theory Formation in Pure Mathematics. Springer, Heidelberg (2002)
Fajtlowicz, S.: On conjectures of Graffiti. Discrete Mathematics 72, 23, 113–118 (1988)
Fajtlowicz, S.: The writing on the wall. Unpublished preprint (1999), available from http://math.uh.edu/~clarson/
Ganter, B.: Formal Concept Analysis. Foundations and Applications. In: chapter Contextual Attribute Logic of Many-Valued Attributes, pp. 101–113. Springer, Heidelberg (2005)
Ganter, B., Kuznetsov, S.: Hypotheses and version spaces. In: Ganter, B., de Moor, A., Lex, W. (eds.) ICCS 2003. LNCS, vol. 2746, pp. 83–95. Springer, Heidelberg (2003)
Ganter, B., Stumme, G., Wille, R. (eds.): Formal Concept Analysis. Foundations and Applications. Springer, Heidelberg (2005)
Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)
Hidalgo, M., Martin-Mateos, F., Ruiz-Reina, J., Alonso, J.A., Borrego, J.: Verification of the Formal Concept Analysis. Rev. R. Acad. Cien. Serie A. Mat. 98(1), 3–16 (2004)
Kuznetsov, S.: Machine learning and formal concept analysis. In: Eklund, P.W. (ed.) ICFCA 2004. LNCS (LNAI), vol. 2961, pp. 287–312. Springer, Heidelberg (2004)
Liquiere, M., Sallantin, J.: Structural machine learning with galois lattice and graphs. In: International Conference on Machine Learning (1998)
Mohamadali, N.: A rational reconstruction of Graffiti. Master’s thesis, Department of Computing, Imperial College, London (2003)
Scheich, P., Skorsky, M., Vogt, F., Wachter, C., Wille, R.: Information and Classification - Concepts, Methods and Applications. In: chapter Conceptual Data Systems, pp. 72–84. Springer, Heidelberg (1992)
Schwarzweller, C.: Mizar formalization of concept lattices. Mechanized Mathematics and its Application 1(1), 1–10 (2000)
Sloane, N.J.A.: My favorite integer sequences. In: Proceedings of the International Conference on Sequences and Applications (1998)
Waterloo Maple. Maple Manual at, http://www.maplesoft.on.ca
Yevtushenko, S.: System of data analysis concept explorer. In: Proceedings of the 7th national conference on Artificial Intelligence KII, pp. 127–134 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Colton, S., Wagner, D. (2007). Using Formal Concept Analysis in Mathematical Discovery . In: Kauers, M., Kerber, M., Miner, R., Windsteiger, W. (eds) Towards Mechanized Mathematical Assistants. MKM Calculemus 2007 2007. Lecture Notes in Computer Science(), vol 4573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73086-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-73086-6_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73083-5
Online ISBN: 978-3-540-73086-6
eBook Packages: Computer ScienceComputer Science (R0)