Search Results for author:
Found 2 papers, 1 papers with code
Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability
Improving the explainability of the results from machine learning methods has become an important research goal.
Using Entropy Estimates for DAG-Based Ontologies
Summary: We present a novel calculation for establishing the entropy of a DAG-based ontology, which can be used in an alternative method for establishing the information content of its terms.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
