Amanote Research
Register
Sign In
Full Perfect Extension Pruning for Frequent Graph Mining
doi 10.1109/icdmw.2006.82
Full Text
Open PDF
Abstract
Available in
full text
Date
December 1, 2006
Authors
Christian Borgelt
Thorsten Meinl
Publisher
IEEE
Related search
Mining Frequent Graph Sequence Patterns Induced by Vertices
FRISSMiner: Mining Frequent Graph Sequence Patterns Induced by Vertices
IEICE Transactions on Information and Systems
Electronic Engineering
Pattern Recognition
Hardware
Computer Vision
Electrical
Architecture
Artificial Intelligence
Software
Efficient Mining of Maximal Bicliques in Graph by Pruning Search Space
International Journal of Advanced Computer Science and Applications
Computer Science
Flexible Support Measures and Search Schemes for Mining Frequent Patterns in a Large Single Graph
Iterative Graph Feature Mining for Graph Indexing
Effective Pruning Strategies for Sequential Pattern Mining
Apriori Algorithm Using Hashing for Frequent Itemsets Mining
International Journal of Education and Management Engineering
Optimized Frequent Pattern Mining for Classified Data Sets
International Journal of Computer Applications
A Semi-Strong Perfect Graph Theorem
Journal of Combinatorial Theory. Series B
Combinatorics
Computational Theory
Discrete Mathematics
Theoretical Computer Science
Mathematics
