GREW-A Scalable Frequent Subgraph Discovery Algorithm.
Michihiro KuramochiGeorge KarypisPublished in: ICDM (2004)
Keyphrases
- improved algorithm
- times faster
- single pass
- preprocessing
- dynamic programming
- theoretical analysis
- high accuracy
- experimental evaluation
- np hard
- objective function
- computational complexity
- optimal solution
- similarity measure
- computationally efficient
- segmentation algorithm
- learning algorithm
- search space
- data sets
- optimization algorithm
- detection algorithm
- recognition algorithm
- estimation algorithm
- memory efficient
- highly efficient
- selection algorithm
- matching algorithm
- clustering method
- particle swarm optimization
- computational cost
- cost function
- bayesian networks
- decision trees