A tutorial on MDL hypothesis testing for graph analysis
classification
📊 stat.ML
cs.LG
keywords
analysisgraphprincipletutorialanalysingbasicbriefclique
read the original abstract
This document provides a tutorial description of the use of the MDL principle in complex graph analysis. We give a brief summary of the preliminary subjects, and describe the basic principle, using the example of analysing the size of the largest clique in a graph. We also provide a discussion of how to interpret the results of such an analysis, making note of several common pitfalls.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.