Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Mining of data with complex structures. - MaRDI portal

Mining of data with complex structures. (Q610404)

From MaRDI portal





scientific article; zbMATH DE number 5824425
Language Label Description Also known as
English
Mining of data with complex structures.
scientific article; zbMATH DE number 5824425

    Statements

    Mining of data with complex structures. (English)
    0 references
    0 references
    0 references
    0 references
    8 December 2010
    0 references
    The book investigates the problem of mining data that is represented in tree form. Trees are a fundamental data structure, which underlie for example XML documents or ontologies stored in the RDF format. The book focuses on the problem of discovering subtree patterns, with the so-called frequent subtree mining problem as its main focus. It does not serve as a general introduction into the area of data mining. Various variants of tree patterns are covered and existing frequency criteria definitions are reviewed. An overview of existing algorithms for tree mining is given and the so-called tree model guided framework (TMGF) by the authors is presented. The main part of the book then discusses the application of this framework to the various variants of the tree mining problem. The authors show how the representation techniques and algorithms provided by the framework can be applied to different classes of tree mining problems. A short outlook on graph mining and new research directions such as ontology learning conclude the book.
    0 references
    data mining
    0 references
    tree mining
    0 references
    subtree patterns
    0 references
    frequency criteria
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references