Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDICFCA 2019: Frankfurt, Germany
- Diana Cristea, Florence Le Ber
, Baris Sertkaya:
Formal Concept Analysis - 15th International Conference, ICFCA 2019, Frankfurt, Germany, June 25-28, 2019, Proceedings. Lecture Notes in Computer Science 11511, Springer 2019, ISBN 978-3-030-21461-6
Invited Papers
- Miguel Couceiro, Amedeo Napoli:
Elements About Exploratory, Knowledge-Based, Hybrid, and Explainable Knowledge Discovery. 3-16 - Markus Krötzsch:
Too Much Information: Can AI Cope with Modern Knowledge Graphs? 17-31 - Sergei Obiedkov:
Learning Implications from Data and from Queries. 32-44 - Steffen Staab:
Concepts in Application Context. 45-52
Theory
- Kira V. Adaricheva, Taylor Ninesling:
Direct and Binary Direct Bases for One-Set Updates of a Closure System. 55-72 - Alexandre Bazin, Giacomo Kahn:
Reduction and Introducers in d-contexts. 73-88 - Oscar Defrain, Lhouari Nourine:
Dualization in Lattices Given by Implicational Bases. 89-98 - Bernhard Ganter:
"Properties of Finite Lattices" by S. Reeg and W. Weiß, Revisited - In Memoriam Peter Burmeister (1941-2019). 99-109 - Francesco Kriegel:
Joining Implications in Formal Contexts and Inductive Learning in a Horn Description Logic. 110-129 - Christian Meschke:
Lattices of Orders. 130-151
Methods and Applications
- Alexandre Bazin, Jessie Carbonnel, Marianne Huchard, Giacomo Kahn, Priscilla Keip, Amirouche Ouzerdine:
On-demand Relational Concept Analysis. 155-172 - Aimene Belfodil, Adnene Belfodil, Mehdi Kaytoue:
Mining Formal Concepts Using Implications Between Items. 173-190 - Priscilla Keip, Alain Gutierrez, Marianne Huchard, Florence Le Ber, Samira Sarter, Pierre Silvie, Pierre Martin:
Effects of Input Data Formalisation in Relational Concept Analysis for a Data Model with a Ternary Relation. 191-207 - Petr Krajca, Martin Trnecka:
Parallelization of the GreConD Algorithm for Boolean Matrix Factorization. 208-222 - Tim Pattison, Aaron Ceglar:
Simultaneous, Polynomial-Time Layout of Context Bigraph and Lattice Digraph. 223-240 - Justine Reynaud, Yannick Toussaint, Amedeo Napoli:
Using Redescriptions and Formal Concept Analysis for Mining Definitions in Linked Data. 241-256
Enhanced FCA
- Jaume Baixeries:
A Formal Context for Closures of Acyclic Hypergraphs. 259-273 - Lucas Bourneuf, Jacques Nicolas:
Concept Lattices as a Search Space for Graph Compression. 274-289 - Inma P. Cabrera, Pablo Cordero, Emilio Muñoz-Velasco, Manuel Ojeda-Aciego:
A Relational Extension of Galois Connections. 290-303
Short Papers
- Víctor Codocedo, Jaume Baixeries, Mehdi Kaytoue, Amedeo Napoli:
Sampling Representation Contexts with Attribute Exploration. 307-314 - Tom Hanika, Maximilian Marx, Gerd Stumme:
Discovering Implicational Knowledge in Wikidata. 315-323 - Guozhi Ma, Lankun Guo, Cheng Yang:
A Characterization Theorem for Continuous Lattices by Closure Spaces. 324-331 - Tatiana Makhalova, Sergei O. Kuznetsov, Amedeo Napoli:
On Coupling FCA and MDL in Pattern Mining. 332-340 - Tatiana Makhalova, Martin Trnecka:
A Study of Boolean Matrix Factorization Under Supervised Settings. 341-348
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-06-18 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
