Computing Dependencies Using Formal Concept Analysis

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Computing Dependencies Using Formal Concept Analysis Jaume Baixeries, Victor Codocedo, Mehdi Kaytoue, Amedeo Napoli

[1]  Amedeo Napoli,et al.  Characterizing approximate-matching dependencies in formal concept analysis with pattern structures , 2018, Discret. Appl. Math..

[2]  Jaume Baixeries,et al.  A Formal Context for Acyclic Join Dependencies , 2017, ISMIS.

[3]  Jaume Baixeries i Juvillà,et al.  Contributions to the formalization of order-like dependencies using FCA , 2016 .

[4]  Amedeo Napoli,et al.  Characterization of Order-like Dependencies with Formal Concept Analysis , 2016, FCA4AI@ECAI.

[5]  Amedeo Napoli,et al.  Characterizing functional dependencies in formal concept analysis with pattern structures , 2014, Annals of Mathematics and Artificial Intelligence.

[6]  Lei Chen,et al.  Efficient discovery of similarity constraints for matching dependencies , 2013, Data Knowl. Eng..

[7]  Philip S. Yu,et al.  Comparable dependencies over heterogeneous data , 2013, The VLDB Journal.

[8]  Amedeo Napoli,et al.  Computing Functional Dependencies with Pattern Structures , 2012, CLA.

[9]  David J. DeWitt,et al.  Can the Elephants Handle the NoSQL Onslaught? , 2012, Proc. VLDB Endow..

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

[11]  Laks V. S. Lakshmanan,et al.  Data Cleaning and Query Answering with Matching Dependencies and Matching Functions , 2010, ICDT '11.

[12]  Lhouari Nourine,et al.  Conditional Functional Dependencies: An FCA Point of View , 2010, ICFCA.

[13]  Sergei O. Kuznetsov,et al.  Pattern Structures for Analyzing Complex Data , 2009, RSFDGrC.

[14]  Jaume Baixeries,et al.  A Formal Context for Symmetric Dependencies , 2008, ICFCA.

[15]  Wenfei Fan,et al.  Conditional Functional Dependencies for Data Cleaning , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[16]  Vilém Vychodil,et al.  Data Tables with Similarity Relations: Functional Dependencies, Complete Rules and Non-redundant Bases , 2006, DASFAA.

[17]  José L. Balcázar,et al.  Characterization and Armstrong Relations for Degenerate Multivalued Dependencies Using Formal Concept Analysis , 2005, ICFCA.

[18]  Bernard Monjardet,et al.  The Lattices of Closure Systems, Closure Operators, and Implicational Systems on a Finite Set: A Survey , 2003, Discret. Appl. Math..

[19]  Jean-Marc Petit,et al.  Functional and approximate dependency mining: database and FCA points of view , 2002, J. Exp. Theor. Artif. Intell..

[20]  Rudolf Wille,et al.  Why can concept lattices support knowledge discovery in databases? , 2002, J. Exp. Theor. Artif. Intell..

[21]  Sergei O. Kuznetsov,et al.  Machine Learning on the Basis of Formal Concept Analysis , 2001 .

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

[23]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[24]  Marianne Baudinet,et al.  Constraint-Generating Dependencies , 1994, J. Comput. Syst. Sci..

[25]  Heikki Mannila,et al.  Design of Relational Databases , 1992 .

[26]  János Demetrovics,et al.  Normal Form Relation Schemes: A New Characterization , 1992, Acta Cybern..

[27]  David Maier,et al.  The Theory of Relational Databases , 1983 .

[28]  Formal Context , 2021, Encyclopedic Dictionary of Archaeology.

[29]  Giuseppe Polese,et al.  Relaxed Functional Dependencies—A Survey of Approaches , 2016, IEEE Transactions on Knowledge and Data Engineering.

[30]  Amedeo Napoli,et al.  Computing Similarity Dependencies with Pattern Structures , 2013, CLA.

[31]  B. Ganter,et al.  Formal Concept Analysis , 2009, Lecture Notes in Computer Science.

[32]  Jaume Baixeries i Juvillà,et al.  Lattice characterization of armstrong and symmetric dependencies , 2007 .

[33]  Jaume Baixeries i Juvillà,et al.  A Lattice Representation of Relations, Multivalued Dependencies and Armstrong Relations , 2005 .

[34]  Vincent Duquenne,et al.  Familles minimales d'implications informatives résultant d'un tableau de données binaires , 1986 .

[35]  Jianzhong Li,et al.  The VLDB Journal manuscript No. (will be inserted by the editor) Dynamic Constraints for Record Matching , 2022 .