On the public citation graph

Finding all closed sets: A general approach

https://doi.org/10.1007/bf00383449
0 signed · 71 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/s0167-5060(08)70325-xopenalex-snapshot
Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781119069706.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/sam.10057openalex-snapshot
Efficient discovery of interesting patterns based on strong closedness
inferred← citeshttps://doi.org/10.1007/10722280_20openalex-snapshot
Building and Structuring Description Logic Knowledge Bases Using Least Common Subsumers and Concept Analysis
inferred← citeshttps://doi.org/10.1007/11528784_10openalex-snapshot
Efficient Mining of Association Rules Based on Formal Concept Analysis
inferred← citeshttps://doi.org/10.1007/3-540-44583-8_10openalex-snapshot
Pattern Structures and Their Projections
inferred← citeshttps://doi.org/10.1007/3-540-44794-6_24openalex-snapshot
Algorithms for the Construction of Concept Lattices and Their Diagram Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45422-5_24openalex-snapshot
Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis
inferred← citeshttps://doi.org/10.1007/3-540-45483-7_15openalex-snapshot
Building Concept Lattices by Learning Concepts from RDF Graphs Annotating Web Documents
inferred← citeshttps://doi.org/10.1007/3-540-48050-1_28openalex-snapshot
Computing Full and Iceberg Datacubes Using Partitions
inferred← citeshttps://doi.org/10.1007/3-540-49257-7_25openalex-snapshot
Discovering Frequent Closed Itemsets for Association Rules
inferred← citeshttps://doi.org/10.1007/3-540-58950-3_387openalex-snapshot
Upward drawing on the plane grid using less ink
inferred← citeshttps://doi.org/10.1007/978-3-031-40960-8_6openalex-snapshot
A Note on the Number of (Maximal) Antichains in the Lattice of Set Partitions
inferred← citeshttps://doi.org/10.1007/978-3-031-54534-4_25openalex-snapshot
Is Canfield Right? On the Asymptotic Coefficients for the Maximum Antichain of Partitions and Related Counting Inequalities
inferred← citeshttps://doi.org/10.1007/978-3-319-09174-7_8openalex-snapshot
An Integer Programming Formulation for the Maximum k-Subset Intersection Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-27057-9_11openalex-snapshot
Concept Discovery from Un-Constrained Distributed Context
inferred← citeshttps://doi.org/10.1007/978-3-319-41920-6_4openalex-snapshot
A Closed Frequent Subgraph Mining Algorithm in Unique Edge Label Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-45587-7_25openalex-snapshot
Two-Level Polytopes with a Prescribed Facet
inferred← citeshttps://doi.org/10.1007/978-3-319-70566-8_14openalex-snapshot
Tropical Computations in polymake
inferred← citeshttps://doi.org/10.1007/978-3-540-24651-0_24openalex-snapshot
Applying Formal Concept Analysis to Description Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-24651-0_25openalex-snapshot
Machine Learning and Formal Concept Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-27769-9_7openalex-snapshot
Iceberg Query Lattices for Datalog
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_34openalex-snapshot
Computing the Least Common Subsumer w.r.t. a Background Terminology
inferred← citeshttps://doi.org/10.1007/978-3-540-32262-7_15openalex-snapshot
A Generic Algorithm for Generating Closed Sets of a Binary Relation
inferred← citeshttps://doi.org/10.1007/978-3-540-74976-9_37openalex-snapshot
Efficient Closed Pattern Mining in Strongly Accessible Set Systems (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-01815-2_2openalex-snapshot
Concept Lattice Orbifolds – First Steps
inferred← citeshttps://doi.org/10.1007/978-3-642-11928-6_1openalex-snapshot
About the Enumeration Algorithms of Closed Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-13881-2_29openalex-snapshot
Unsupervised Ontology Acquisition from Plain Texts: The OntoGain System
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_17openalex-snapshot
Enumeration of 2-Level Polytopes
inferred← citeshttps://doi.org/10.1007/bf02115811openalex-snapshot
Computing on-line the lattice of maximal antichains of posets
inferred← citeshttps://doi.org/10.1007/bfb0030825openalex-snapshot
Computations with finite closure systems and implications
inferred← citeshttps://doi.org/10.1007/s00500-013-1176-6openalex-snapshot
A new FCA algorithm enabling analyzing of complex and dynamic data sets
inferred← citeshttps://doi.org/10.1007/s10732-022-09490-8openalex-snapshot
A GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem
inferred← citeshttps://doi.org/10.1007/s10994-019-05827-wopenalex-snapshot
Effective approximation of parametrized closure systems over transactional data streams
inferred← citeshttps://doi.org/10.1007/s12532-018-0145-6openalex-snapshot
Enumeration of 2-level polytopes
inferred← citeshttps://doi.org/10.1016/j.bcra.2024.100191openalex-snapshot
Exploring the relationship between rarity and price of profile picture NFT: A formal concept analysis on the BAYC NFT collection
inferred← citeshttps://doi.org/10.1016/j.dam.2008.10.010openalex-snapshot
Enumeration aspects of maximal cliques and bicliques
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.030openalex-snapshot
A depth-first search algorithm for computing pseudo-closed sets
inferred← citeshttps://doi.org/10.1016/j.eswa.2021.114678openalex-snapshot
Identifying the mobile application repertoire based on weighted formal concept analysis
inferred← citeshttps://doi.org/10.1016/j.ijar.2021.12.007openalex-snapshot
Steps towards causal Formal Concept Analysis
inferred← citeshttps://doi.org/10.1016/j.ijar.2024.109299openalex-snapshot
Three-way conceptual knowledge updating in incomplete contexts
inferred← citeshttps://doi.org/10.1016/j.ins.2021.04.104openalex-snapshot
LinCbO: Fast algorithm for computation of the Duquenne-Guigues basis
inferred← citeshttps://doi.org/10.1016/j.jal.2006.03.002openalex-snapshot
Computing the least common subsumer w.r.t. a background terminology
inferred← citeshttps://doi.org/10.1016/j.jsc.2018.06.016openalex-snapshot
Algorithms for tight spans and tropical linear spaces
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.10.024openalex-snapshot
Listing closed sets of strongly accessible set systems with applications to data mining
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.03.018openalex-snapshot
The joy of implications, aka pure Horn formulas: Mainly a survey
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00258-4openalex-snapshot
Efficient algorithms on distributive lattices
inferred← citeshttps://doi.org/10.1016/s0169-023x(02)00057-5openalex-snapshot
Computing iceberg concept lattices with Titanic
inferred← citeshttps://doi.org/10.1016/s0306-4379(99)00003-4openalex-snapshot
Efficient mining of association rules using closed itemset lattices
inferred← citeshttps://doi.org/10.1017/9781139245913.006openalex-snapshot
Knowledge spaces and learning spaces
inferred← citeshttps://doi.org/10.1023/a:1012435612567openalex-snapshot
Machine Learning on the Basis of Formal Concept Analysis
inferred← citeshttps://doi.org/10.1023/b:orde.0000009252.21331.22openalex-snapshot
Extendability of Cyclic Orders
inferred← citeshttps://doi.org/10.1080/09528130210164170openalex-snapshot
Comparing performance of algorithms for generating concept lattices
inferred← citeshttps://doi.org/10.1109/icmlc.2004.1382381openalex-snapshot
Searching for closed itemset with formal concept analysis
inferred← citeshttps://doi.org/10.1109/services.2010.35openalex-snapshot
Heterogeneous Service Selection Based on Formal Concept Analysis
inferred← citeshttps://doi.org/10.1109/ssdbm.2007.25openalex-snapshot
What Constitutes a Scientific Database?
inferred← citeshttps://doi.org/10.1109/tfuzz.2007.905906openalex-snapshot
Extended DNF Expression and Variable Granularity in Information Tables
inferred← citeshttps://doi.org/10.1109/wift.1995.515486openalex-snapshot
A calculus of hazard for railway signalling
inferred← citeshttps://doi.org/10.1134/s1995080223010158openalex-snapshot
On the Number of Maximal Antichains in Boolean Lattices for $$\boldsymbol{n}$$ up to 7
inferred← citeshttps://doi.org/10.1134/s1995080226618394openalex-snapshot
Computation of the Dedekind–MacNeille Completion for the Bruhat Order of the Weyl Group $$\boldsymbol{W(B_{6})}$$ with Concept Lattices
inferred← citeshttps://doi.org/10.11606/t.45.2012.tde-26112012-161435openalex-snapshot
Empacotamento de bicliques em grafos bipartidos
inferred← citeshttps://doi.org/10.1613/jair.1648openalex-snapshot
Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis
inferred← citeshttps://doi.org/10.24406/publica-r-354951openalex-snapshot
Efficient closed pattern mining in strongly accessible set systems
inferred← citeshttps://doi.org/10.26190/unsworks/21066openalex-snapshot
Document management and retrieval for specialised domains : an evolutionary user-based approach
inferred← citeshttps://doi.org/10.4018/978-1-60566-810-9.ch008openalex-snapshot
The Duality of Good Diagnostic Tests
inferred← citeshttps://doi.org/10.48550/arxiv.1111.3975openalex-snapshot
A Generalized Next-Closure Algorithm -- Enumerating Semilattice Elements from a Generating Set
inferred← citeshttps://doi.org/10.48550/arxiv.1302.1039openalex-snapshot
How to partition or count an abstract simplicial complex, given its facets
inferred← citeshttps://doi.org/10.5445/ir/1000007530openalex-snapshot
Query-Based Multicontexts for Knowledge Base Browsing
inferred← citeshttps://doi.org/10.70675/7dec265fz8cdfz40b2zbb92z51969aaa33f0openalex-snapshot
On the enumeration of pseudo-intents : choosing the order and extending to partial implications
inferred← citeshttps://doi.org/10.70675/f486f39ezdf04z4f7fzacc1z04d430801842openalex-snapshot
Analyse formelle de concepts et fusion d'informations : application à l'estimation et au contrôle d'incertitude des indicateurs agri-environnementaux
inferred← citeshttps://doi.org/10.9790/5728-120402137143openalex-snapshot
A series of contexts relative to a matroid*
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.