Amanote Research
Register
Sign In
Discovering Frequent Substructures From Hierarchical Semi-Structured Data
doi 10.1137/1.9781611972726.11
Full Text
Open PDF
Abstract
Available in
full text
Date
April 11, 2002
Authors
Gao Cong
Lan Yi
Bing Liu
Ke Wang
Publisher
Society for Industrial and Applied Mathematics
Related search
Discovering Frequent Agreement Subtrees From Phylogenetic Data
IEEE Transactions on Knowledge and Data Engineering
Computational Theory
Computer Science Applications
Information Systems
Mathematics
A Schema Feature Based Frequent Pattern Mining Algorithm for Semi-Structured Data Stream
Very Fast Similarity Queries on Semi-Structured Data From the Web
Discovering Exclusive Patterns in Frequent Sequences
International Journal of Data Mining, Modelling and Management
Modeling
Simulation
Computer Science Applications
Management Information Systems
On Repairing Structural Problems in Semi-Structured Data
Proceedings of the VLDB Endowment
Computer Science
An Efficient Algorithm for Discovering Frequent Subgraphs
IEEE Transactions on Knowledge and Data Engineering
Computational Theory
Computer Science Applications
Information Systems
Mathematics
Management of SME's Semi Structured Data Using Semantic Technique
Applied Big Data Analytics in Operations Management
Discovering Frequent Embedded Subtree Patterns From Large Databases of Unordered Labeled Trees
International Journal of Data Warehousing and Mining
Hardware
Architecture
Software
Discovering Hierarchical Subgraphs of K-Core-Truss
Data Science and Engineering
Computational Mechanics
Computer Science Applications