💠 Ontology matching system based on formal concept analysis
-
Updated
Nov 7, 2020 - Java
💠 Ontology matching system based on formal concept analysis
Tools for Formal Concept Analysis
OCaml library for partially ordered maps
Associative memory and categories based on a directed acyclic graph data structure
Generate Concept Lattice from given Access Matrix
Learning compact concept DAGs from binary data by minimum description length — a probabilistic take on Formal Concept Analysis
Konlatt bridges the gap between complex Formal Concept Analysis (FCA) and user-friendly interaction, making conceptual data exploration accessible to anyone.
Python implementation of FCA algorithms for concept lattice generation, attribute reduction, reduct computation and implication validation.
Turn requirements into a formal context, evolve it, and let an LLM build the app. Architecture that checks itself.
Interpretable classifier whose hidden layer is a concept lattice — every neuron is a formal concept with a readable intent. Benchmarked against Optuna-tuned baselines.
Browse knowledge, not folders: an OntoDAG concept lattice as a real filesystem, with file content on Ethereum Swarm
To associate your repository with the concept-lattice topic, visit your repo's landing page and select "manage topics."