An Efficient Algorithm of Frequent Connected Subgraph Extraction.
Mingsheng HongHaofeng ZhouWei WangBaile ShiPublished in: PAKDD (2003)
Keyphrases
- k means
- experimental evaluation
- optimization algorithm
- times faster
- computational cost
- improved algorithm
- detection algorithm
- cost function
- np hard
- convergence rate
- worst case
- significant improvement
- theoretical analysis
- high accuracy
- simulated annealing
- data mining
- probabilistic model
- dynamic programming
- search space
- preprocessing
- mining frequent
- matching algorithm
- tree structure
- clustering method
- computationally efficient
- input data
- data structure