Mining actionable concepts in concept lattice using Interestingness Propagation
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.
Bibliographic record
Abstract
Mining important conceptual patterns is an essential task for understanding the context and content of complex data in many scientific and engineering applications . While exact relevance indices in Formal Concept Analysis provide accurate importance evaluation that can be used for extracting interesting concepts, they often have expensive algorithmic complexity (e.g., at least quadratic in the lattice size, which is exponential with respect to the context size). This frequently results in a computational bottleneck, rendering these indices inappropriate for large, dense contexts or small contexts with large concepts. In this paper, we introduce I nterestingness P ropagation ( IP ), an efficient message passing strategy for identifying actionable concepts based on interesting and uninteresting information available from a very small portion of the concepts in lattices. From a conceptual perspective, IP leverages the lattice local and global conceptual structures to maintain local and global consistency in the interesting or uninteresting labeling information among similar neighborhood concepts. Experiments on synthetic and real-world datasets show that IP can accurately extract interesting concepts that are very competitive with ground truth ones computed using state-of-the-art exact interestingness indices, while being at least three times faster than certain indices like CR and one order of magnitude faster than others like stability.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.003 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.002 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it