Related Experiment Video
Updated: Jun 19, 2026

Morphology-Based Distinction Between Healthy and Pathological Cells Utilizing Fourier Transforms and Self-Organizing Maps
Published on: October 28, 2018
Interpretable weakly-supervised learning through kernel density matrices: A digital pathology use case
Sebastian Medina1,2, Eduardo Romero3, Angel Cruz-Roa4
1MindLab Research Group, Universidad Nacional de Colombia, Bogotá, Colombia.
None:
Classification methods based on deep learning require selecting between fully-supervised or weakly-supervised approaches, each presenting limitations in uncertainty quantification and interpretability. A framework unifying both supervision modes while maintaining quantifiable interpretation metrics remains unexplored. We introduce WiSDoM (Weakly-Supervised Density Matrices), which uses kernel matrices to model probability distributions of input data and their labels. The framework integrates: (1) differentiable kernel density matrices enabling stochastic gradient descent optimization, (2) local-global attention mechanisms for multi-scale feature weighting, (3) data-driven prototype generation through kernel space sampling, and (4) ordinal regression through density matrix operations. WiSDoM was validated through supervised patch classification ([Formula: see text] = 0.896) and weakly-supervised whole-slide classification ([Formula: see text] = 0.930) on histopathology images. WiSDoM generates three quantifiable outputs: posterior probability distributions, variance-based uncertainty maps, and phenotype prototypes. Through validation in a Gleason grading task at a patch and whole-slide level using histopathology images, WiSDoM demonstrated consistent performance across supervision modes ([Formula: see text] > 0.89) and prototype interpretability (0.88 expert agreement). These results show that kernel density matrices can serve as a foundation for classification models requiring both prediction interpretability and uncertainty quantification across supervision modes.
Related Concept Videos
Basic Discrete Time Signals
The unit impulse or sample sequence is mathematically expressed as zero for all n values except at n=0, where it is one. The unit impulse sequence, denoted by δ(n), is the first difference of the unit step sequence, while the unit step sequence u(n) is the...
Relation between Mathematical Equations and Block Diagrams
Block Diagram Reduction
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
Multi-input and Multi-variable systems
In the absence of...
Mason's Rule
Loop gain is determined by identifying and tracing a path from a node back to itself. This involves computing the product of branch gains along the loop. Each loop's gain is crucial for further...

