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.

[1]  Patrick Seemann,et al.  Matrix Factorization Techniques for Recommender Systems , 2014 .

[2]  Yehuda Koren,et al.  Matrix Factorization Techniques for Recommender Systems , 2009, Computer.

[3]  S. Lane Categories for the Working Mathematician , 1971 .

[4]  Marcello M. Bonsangue,et al.  Generalized Metric Spaces: Completion, Topology, and Powerdomains via the Yoneda Embedding , 1995, Theor. Comput. Sci..

[5]  Rudolf Wille,et al.  A Triadic Approach to Formal Concept Analysis , 1995, ICCS.

[6]  Yong-woon Kim Pseudo quasi metric spaces , 1968 .

[7]  Amedeo Napoli,et al.  Revisiting Numerical Pattern Mining with Formal Concept Analysis , 2011, IJCAI.

[8]  Ramón Fuentes-González,et al.  Construction of the L-fuzzy concept lattice , 1998, Fuzzy Sets Syst..

[9]  Vilém Vychodil,et al.  What is a fuzzy concept lattice? , 2005, CLA.

[10]  Radim Belohlávek,et al.  Concept lattices and order in fuzzy logic , 2004, Ann. Pure Appl. Log..

[11]  Anna R. Karlin,et al.  Spectral analysis of data , 2001, STOC '01.

[12]  L. Beran,et al.  [Formal concept analysis]. , 1996, Casopis lekaru ceskych.

[13]  S. Maclane,et al.  Categories for the Working Mathematician , 1971 .

[14]  Jonas Poelmans,et al.  Formal Concept Analysis in Knowledge Discovery: A Survey , 2010, ICCS.

[15]  Dusko Pavlovic On quantum statistics in data analysis , 2008, ArXiv.

[16]  Amedeo Napoli,et al.  Mining gene expression data with pattern structures in formal concept analysis , 2011, Inf. Sci..

[17]  Kim Ritter Wagner,et al.  Liminf Convergence in Omega-Categories , 1997, Theor. Comput. Sci..

[18]  Tom Leinster,et al.  Measuring diversity: the importance of species similarity. , 2012, Ecology.

[19]  R. Belohlávek Fuzzy Relational Systems: Foundations and Principles , 2002 .

[20]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[21]  Mai Gehrke,et al.  Generalized Kripke Frames , 2006, Stud Logica.

[22]  Rudolf Wille,et al.  Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts , 2009, ICFCA.

[23]  Bernhard Ganter,et al.  Formal Concept Analysis , 2013 .

[24]  T. Landauer,et al.  Indexing by Latent Semantic Analysis , 1990 .

[25]  Dusko Pavlovic,et al.  Network as a Computer: Ranking Paths to Find Flows , 2008, CSR.

[26]  Dusko Pavlovic,et al.  Quantifying and Qualifying Trust: Spectral Decomposition of Trust Networks , 2010, Formal Aspects in Security and Trust.

[27]  H M Macneille,et al.  Extensions of Partially Ordered Sets. , 1936, Proceedings of the National Academy of Sciences of the United States of America.

[28]  Amedeo Napoli,et al.  Pattern Mining in Numerical Data: Extracting Closed Patterns and their Generators , 2010 .

[29]  Claudio Carpineto,et al.  Concept data analysis - theory and applications , 2004 .

[30]  Radim Belohlávek,et al.  What is a Fuzzy Concept Lattice? II , 2011, RSFDGrC.

[31]  G. M. Kelly,et al.  BASIC CONCEPTS OF ENRICHED CATEGORY THEORY , 2022, Elements of ∞-Category Theory.

[32]  Ramón Fuentes-González,et al.  The study of the L-fuzzy concept lattice , 1994 .

[33]  W. A. Wilson On Quasi-Metric Spaces , 1931 .

[34]  F. William Lawvere,et al.  Metric spaces, generalized logic, and closed categories , 1973 .

[35]  C.J.H. Mann,et al.  Fuzzy Relational Systems: Foundations and Principles , 2003 .

[36]  Radim Bělohlávek,et al.  Fuzzy Relational Systems: Foundations and Principles , 2002 .

[37]  Amedeo Napoli,et al.  Mining Biclusters of Similar Values with Triadic Concept Analysis , 2011, CLA.

[38]  Hans-Peter A. Künzi,et al.  On the Yoneda completion of a quasi-metric space , 2002, Theor. Comput. Sci..

[39]  Stanislav Krajci,et al.  A Generalized Concept Lattice , 2005, Log. J. IGPL.

[40]  Derek G. Bridge,et al.  Collaborative Recommending using Formal Concept Analysis , 2006, Knowl. Based Syst..

[41]  Bernhard Banaschewski,et al.  Categorical characterization of the MacNeille completion , 1967 .

[42]  Bernhard Ganter,et al.  Pattern Structures and Their Projections , 2001, ICCS.