Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 402 matches
- 2023
- Jaume Baixeries, Víctor Codocedo, Mehdi Kaytoue, Amedeo Napoli:
Three Views on Dependency Covers from an FCA Perspective. ICFCA 2023: 78-94 - Alexandre Bazin:
A Triadic Generalisation of the Boolean Concept Lattice. ICFCA 2023: 95-105 - Mike Behrisch, Leon Renkin:
Computing Witnesses for Centralising Monoids on a Three-Element Set. ICFCA 2023: 109-126 - Agnès Braud, Xavier Dolques, Marianne Huchard, Florence Le Ber, Pierre Martin:
Relational Concept Analysis in Practice: Capitalizing on Data Modeling Using Design Patterns. ICFCA 2023: 166-182 - Elias Dahlhaus, Bernhard Ganter:
Examples of Clique Closure Systems. ICFCA 2023: 143-151 - Egor Dudyrev, Sergei O. Kuznetsov, Amedeo Napoli:
Description Quivers for Compact Representation of Concept Lattices and Ensembles of Decision Trees. ICFCA 2023: 127-142 - Sébastien Ferré:
Graph-FCA Meets Pattern Structures. ICFCA 2023: 33-48 - Bernhard Ganter, Tom Hanika, Johannes Hirth:
Scaling Dimension. ICFCA 2023: 64-77 - Dmitry I. Ignatov:
On the Maximal Independence Polynomial of the Covering Graph of the Hypercube up to n=6. ICFCA 2023: 152-165 - David Lobo, Víctor López-Marchante, Jesús Medina:
Approximating Fuzzy Relation Equations Through Concept Lattices. ICFCA 2023: 3-16 - Manuel Ojeda-Hernández, Inma P. Cabrera, Pablo Cordero, Emilio Muñoz-Velasco:
On the Commutative Diagrams Among Galois Connections Involved in Closure Structures. ICFCA 2023: 49-63 - Tim Pattison, Aryan Nataraja:
Doubly-Lexical Order Supports Standardisation and Recursive Partitioning of Formal Context. ICFCA 2023: 17-32 - Uta Priss:
Representing Concept Lattices with Euler Diagrams. ICFCA 2023: 183-197 - Dominik Dürrschnabel, Domingo López-Rodríguez:
Formal Concept Analysis - 17th International Conference, ICFCA 2023, Kassel, Germany, July 17-21, 2023, Proceedings. Lecture Notes in Computer Science 13934, Springer 2023, ISBN 978-3-031-35948-4 [contents] - 2022
- Agnès Braud, Xavier Dolques, Rokia Missaoui:
Proceedings of the Workshop Analyzing Real Data with Formal Concept Analysis co-located with 16th International Conference on Formal Concept Analysis (ICFCA 2021), Strasbourg, France, June 29, 2021. CEUR Workshop Proceedings 3151, CEUR-WS.org 2022 [contents] - 2021
- Nacira Abbas, Alexandre Bazin, Jérôme David, Amedeo Napoli:
Sandwich: An Algorithm for Discovering Relevant Link Keys in an LKPS Concept Lattice. ICFCA 2021: 243-251 - Francisco José Valverde Albacete, Carmen Peláez-Moreno:
Leveraging Formal Concept Analysis to improve n-fold validation in Multilabel Classification. RealDataFCA@ICFCA 2021: 44-51 - H. Ambre Ayats, Peggy Cellier, Sébastien Ferré:
Extracting Relations in Texts with Concepts of Neighbours. ICFCA 2021: 155-171 - Saurabh Bansal, Sriram Kailasam, Sergei Obiedkov:
Approximate Computation of Exact Association Rules. ICFCA 2021: 107-122 - Mike Behrisch, Alain Chavarri Villarello, Edith Vargas-García:
Representing Partition Lattices Through FCA. ICFCA 2021: 3-19 - Agnès Braud, Xavier Dolques, Pierre Fechter, Nicolas Lachiche, Florence Le Ber, Véronique Pitchon:
Analyzing the composition of remedies in ancient pharmacopeiae with FCA. RealDataFCA@ICFCA 2021: 28-35 - Xavier Dolques, Agnès Braud, Corinne Grac, Florence Le Ber:
Analyzing water monitoring data with RCA-based approaches. RealDataFCA@ICFCA 2021: 13-19 - Egor Dudyrev, Sergei O. Kuznetsov:
Decision Concept Lattice vs. Decision Trees and Random Forests. ICFCA 2021: 252-260 - Dominik Dürrschnabel, Gerd Stumme:
Force-Directed Layout of Order Diagrams Using Dimensional Reduction. ICFCA 2021: 224-240 - Jérôme Euzenat:
Fixed-Point Semantics for Barebone Relational Concept Analysis. ICFCA 2021: 20-37 - Maximilian Felde, Gerd Stumme:
Triadic Exploration and Exploration with Multiple Experts. ICFCA 2021: 175-191 - Tom Hanika, Johannes Hirth:
Exploring Scale-Measures of Data Sets. ICFCA 2021: 261-269 - Radek Janostik, Jan Konecny, Petr Krajca:
Pruning Techniques in LinCbO for Computation of the Duquenne-Guigues Basis. ICFCA 2021: 91-106 - Jana Klimpke, Sebastian Rudolph:
Visualization of Statistical Information in Concept Lattice Diagrams. ICFCA 2021: 208-223 - Maren Koyda, Gerd Stumme:
Boolean Substructures in Formal Concept Analysis. ICFCA 2021: 38-53
skipping 372 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-24 22:40 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint