Substructure Discovery Using Minimum Description Length and Background Knowledge, Journal of Articial Intelligence Research, vol.1, p.231255, 1993. ,
Universal codeword sets and representations of the integers, IEEE Transactions on Information Theory, vol.21, issue.2, p.194203, 1975. ,
Model selection based on minimum description length, Journal of Mathematical Psychology, vol.44, issue.1, p.133152, 2000. ,
Characteristic Relational Patterns, Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2009. ,
Summarizing and understanding large graphs, Statistical Analysis and Data Mining, vol.8, p.183202, 2015. ,
An Introduction to Coding Theory and the Two-Part Minimum Description Length Principle, International Statistical Review, vol.69, issue.2, p.169183, 2001. ,
The Gaston tool for frequent subgraph mining, Electron. Notes Theor. Comput. Sci, vol.127, issue.1, p.7787, 2005. ,
A Persistent Weisfeiler-Lehman Procedure for Graph Classication, Proceedings of the 36th International Conference on Machine Learning, p.54485458, 2019. ,
The long and the short of it: Summarising event sequences with serial episodes, Proc. of the Int. Conf. on Knowledge Discovery and Data Mining, 2012. ,
Krimp: mining itemsets that compress, Data Min. Knowl. Discov, vol.23, issue.1, p.169214, 2011. ,
A Quantitative Comparison of the Subgraph Miners MoFa, Knowledge Discovery in Databases: PKDD 2005, vol.3721, p.392403, 2005. ,
gSpan: Graph-based substructure pattern mining, Proc. of the 2002 IEEE Int. Conf. on Data Mining (ICDM '02), 2002. ,
CloseGraph: Mining closed frequent graph patterns, ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining (KDD). pp. 286295, 2003. ,
gPrune: A Constraint Pushing Framework for Graph Pattern Mining, Advances in Knowledge Discovery and Data Mining. pp. 388400, 2007. ,