On the public citation graph
Stepwise construction of the Dedekind-MacNeille completion
0 signed · 32 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00337926openalex-snapshot
Tensorial decomposition of concept lattices
inferredcites →https://doi.org/10.1007/bf02115811openalex-snapshot
Computing on-line the lattice of maximal antichains of posets
inferredcites →https://doi.org/10.1111/0824-7935.00082openalex-snapshot
An Algorithm for Minimal Insertion in a Type Lattice
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10722280_24openalex-snapshot
Formalizing Hypotheses with Concepts
inferred← citeshttps://doi.org/10.1007/10722280_33openalex-snapshot
Computing with Conceptual Structures
inferred← citeshttps://doi.org/10.1007/11752707_15openalex-snapshot
Concept Analysis as a Formal Method for Menu Design
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-44583-8_21openalex-snapshot
Building Concept (Galois) Lattices from Parts: Generalizing the Incremental Methods
inferred← citeshttps://doi.org/10.1007/3-540-48659-3_27openalex-snapshot
Conceptual Structures Represented by Conceptual Graphs and Formal Concept Analysis
inferred← citeshttps://doi.org/10.1007/978-3-032-03364-2_4openalex-snapshot
Reduced Subcontext Completion in Lattices and Concept Lattices
inferred← citeshttps://doi.org/10.1007/978-3-319-90050-6openalex-snapshot
Foundations of Information and Knowledge Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-90050-6_18openalex-snapshot
Refining Semantic Matching for Job Recruitment: An Application of Formal Concept Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-78488-3_2openalex-snapshot
An Algorithm for Mining Weighted Dense Maximal 1-Complete Regions
inferred← citeshttps://doi.org/10.1007/978-3-642-03079-6_9openalex-snapshot
Algorithm Design Using Traversals of the Covering Relation
inferred← citeshttps://doi.org/10.1007/978-3-642-35476-2_12openalex-snapshot
Lattice Completion Algorithms for Distributed Computations
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_68openalex-snapshot
Comparator Circuits over Finite Bounded Posets
inferred← citeshttps://doi.org/10.1016/j.fss.2016.01.007openalex-snapshot
On the Dedekind–MacNeille completion and formal concept analysis based on multilattices
inferred← citeshttps://doi.org/10.1016/j.ijhcs.2003.10.004openalex-snapshot
Evolutionary document management and retrieval for specialized domains on the web
inferred← citeshttps://doi.org/10.1016/j.inffus.2007.01.002openalex-snapshot
A framework for integrating information sources under lattice structure
inferred← citeshttps://doi.org/10.1016/s0954-1810(01)00010-3openalex-snapshot
Design ontology in context — a situated cognition approach to conceptual modelling
inferred← citeshttps://doi.org/10.1023/a:1012435612567openalex-snapshot
Machine Learning on the Basis of Formal Concept Analysis
inferred← citeshttps://doi.org/10.1080/09528130210164152openalex-snapshot
A fast incremental algorithm for building lattices
inferred← citeshttps://doi.org/10.1109/fskd.2009.338openalex-snapshot
Semantic Annotation for CSSCI Academic Resources Based on Ontology
inferred← citeshttps://doi.org/10.1109/hicss.2000.926682openalex-snapshot
A situated cognition approach to conceptual modelling
inferred← citeshttps://doi.org/10.1109/idaacs.2019.8924393openalex-snapshot
Lattice Data Analytics: The Poset of Irreducibles and the MacNeille Completion
inferred← citeshttps://doi.org/10.1109/idaacs53288.2021.9660877openalex-snapshot
Lattice-Based Technique to Visualize and Compare Regional Terrorism Using the Global Terrorism Database
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.1145/1012807.1012831openalex-snapshot
Negotiating access within Wiki
inferred← citeshttps://doi.org/10.14232/actacyb.277380openalex-snapshot
Refined Fuzzy Profile Matching
inferred← citeshttps://doi.org/10.24355/dbbs.084-200511080100-173openalex-snapshot
Algorithmen zur Begriffsanalyse und ihre Anwendung bei Softwarebibliotheken
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.