Quantitative Concept Analysis
Formal Concept Analysis (FCA) begins from a context, given as a binary relation between some objects and some attributes, and derives a lattice of concepts, where each concept is given as a set of objects and a set of attributes, such that the first set consists of all objects that satisfy all attributes in the second, and vice versa. Many applications, though, provide contexts with quantitative information, telling not just whether an object satisfies an attribute, but also quantifying this satisfaction. Contexts in this form arise as rating matrices in recommender systems, as occurrence matrices in text analysis, as pixel intensity matrices in digital image processing, etc. Such applications have attracted a lot of attention, and several numeric extensions of FCA have been proposed. We propose the framework of proximity sets (proxets), which subsume partially ordered sets (posets) as well as metric spaces. One feature of this approach is that it extracts from quantified contexts quantified concepts, and thus allows full use of the available information. Another feature is that the categorical approach allows analyzing any universal properties that the classical FCA and the new versions may have, and thus provides structural guidance for aligning and combining the approaches.
Keywordsconcept analysis enriched category semantic completion universal property
Unable to display preview. Download preview PDF.
- 3.Bělohlávek, R.: Fuzzy relational systems: foundations and principles, vol. 20. Plenum Publishers (2002)Google Scholar
- 8.Burusco, A., Fuentes-González, R.: The study of the L-fuzzy concept lattice. Mathware & Soft Computing 1(3), 209–218 (2008)Google Scholar
- 9.Carpineto, C., Romano, G.: Concept Data Analysis: Theory and Applications. John Wiley & Sons (2004)Google Scholar
- 14.Ganter, B., Stumme, G., Wille, R. (eds.): Formal Concept Analysis. LNCS (LNAI), vol. 3626. Springer, Heidelberg (2005)Google Scholar
- 17.Kaytoue, M., Kuznetsov, S.O., Macko, J., Meira Jr., W., Napoli, A.: Mining biclusters of similar values with triadic concept analysis. In: Proceedings of CLA 2011. CLA (2011)Google Scholar
- 18.Kaytoue, M., Kuznetsov, S.O., Napoli, A.: Pattern mining in numerical data: Extracting closed patterns and their generators. Research Report RR-7416, INRIA (October 2010)Google Scholar
- 19.Kaytoue, M., Kuznetsov, S.O., Napoli, A.: Revisiting numerical pattern mining with formal concept analysis. In: Proceedings of IJCAI 2011, pp. 1342–1347. AAAI (2011)Google Scholar
- 21.Kelly, G.M.: Basic Concepts of Enriched Category Theory. London Mathematical Society Lecture Note, vol. 64, pp. 1–136. Cambridge University Press (1982); Reprinted in Theory and Applications of Categories, vol. 10, pp.1–136 (2005)Google Scholar
- 27.Leinster, T., Cobbold, C.: Measuring diversity: the importance of species similarity. Ecology (to appear, 2012)Google Scholar
- 29.Mac Lane, S.: Categories for the Working Mathematician. Graduate Texts in Mathematics, vol. 5. Springer (1971); 2nd edn. (1997) Google Scholar
- 31.Pavlovic, D.: On quantum statistics in data analysis. In: Bruza, P. (ed.) Quantum Interaction 2008. AAAI (2008), arxiv.org:0802.1296Google Scholar
- 35.Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445–470. Dan Reidel, Dordrecht (1982)Google Scholar