Amanote Research
Register
Sign In
An Efficiently Computable Support Measure for Frequent Subgraph Pattern Mining
Lecture Notes in Computer Science
- Germany
doi 10.1007/978-3-642-33460-3_29
Full Text
Open PDF
Abstract
Available in
full text
Categories
Computer Science
Theoretical Computer Science
Date
January 1, 2012
Authors
Yuyi Wang
Jan Ramon
Publisher
Springer Berlin Heidelberg
Related search
On Speeding Up Frequent Approximate Subgraph Mining
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Mining Frequent Subgraph Patterns From Uncertain Graphs
Ruan Jian Xue Bao/Journal of Software
Software
A Survey of Frequent Subgraph Mining Algorithms
International Journal of Engineering and Technology(UAE)
Architecture
Hardware
Engineering
Chemical Engineering
Biotechnology
Environmental Engineering
Computer Science
Incremental Frequent Subgraph Mining on Large Evolving Graphs
IEEE Transactions on Knowledge and Data Engineering
Computational Theory
Computer Science Applications
Information Systems
Mathematics
Frequent Tree Pattern Mining: A Survey
Intelligent Data Analysis
Computer Vision
Pattern Recognition
Artificial Intelligence
Theoretical Computer Science
Optimized Frequent Pattern Mining for Classified Data Sets
International Journal of Computer Applications
Frequent Pattern Mining With Uncertain Data
Frequent Pattern Mining in Multidimensional Organizational Networks
Scientific Reports
Multidisciplinary
Efficient Frequent Pattern Mining on Web Logs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
