{"version":"1.0","type":"link","title":"Frequent subtree mining - Newikis","description":"In computer science, frequent subtree mining is the problem of finding all patterns in a given database whose support (a metric related to its number of occurrences in other subtrees) is over a given threshold. It is a more general form of the maximum agreement subtree problem.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}