MétaCan
Menu
Back to cohort
Record W1487388161 · doi:10.1109/icci-cc.2015.7259376

Formal properties and rules of concept algebra

2015· article· en· W1487388161 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCognitive Computing and Networks
Canadian institutionsUniversity of Calgary
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsAlgebra over a fieldComputer scienceMathematical proofAlgebraic numberSet (abstract data type)Term algebraAlgebraic operationAlgebra representationMathematicsTwo-element Boolean algebraProgramming languagePure mathematics

Abstract

fetched live from OpenAlex

Concept algebra is a denotational mathematics for rigorously manipulating formal concepts and their algebraic operations in knowledge representation, semantic analyses, and machine learning. Properties of concept algebra are formally studied in order to elaborate the nature of formal concepts and their algebraic operations. This leads to a set of algebraic rules in the categories of relational, reproductive, and compositional operations on formal concepts. Relationship between algebraic operations of concept algebra is rigorously described. Proofs are provided for the algebraic rules of concept algebra elaborated by examples. This work enables a rigorous implementation of concept algebra in cognitive knowledge base manipulations and cognitive machine learning.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.906
Threshold uncertainty score0.131

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.060
GPT teacher head0.231
Teacher spread0.171 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations9
Published2015
Admission routes2
Has abstractyes

Explore more

Same topicCognitive Computing and NetworksFrench-language works237,207