Towards concept analysis in categories: limit inferior as algebra, limit superior as coalgebra
Toshiki Kataoka, Dusko Pavlovic

TL;DR
This paper explores how categorical limit inferior and limit superior operations can characterize Dedekind-MacNeille completions, advancing concept analysis in categories and enabling semantic extraction across network nodes.
Contribution
It introduces a new categorical framework using limit inferior and superior to generalize Dedekind-MacNeille completions for ordinary categories.
Findings
Limit inferior and superior characterize Dedekind-MacNeille completions.
The framework generalizes enriched category completions.
It broadens categorical concept mining and analysis methods.
Abstract
While computer programs and logical theories begin by declaring the concepts of interest, be it as data types or as predicates, network computation does not allow such global declarations, and requires *concept mining* and *concept analysis* to extract shared semantics for different network nodes. Powerful semantic analysis systems have been the drivers of nearly all paradigm shifts on the web. In categorical terms, most of them can be described as bicompletions of enriched matrices, generalizing the Dedekind-MacNeille-style completions from posets to suitably enriched categories. Yet it has been well known for more than 40 years that ordinary categories themselves in general do not permit such completions. Armed with this new semantical view of Dedekind-MacNeille completions, and of matrix bicompletions, we take another look at this ancient mystery. It turns out that simple categorical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRough Sets and Fuzzy Logic · Semantic Web and Ontologies · Advanced Database Systems and Queries
