Two bi-objective hybrid approaches for the frequent subgraph mining problem.
Sidali Hocine FarhiDalila BoughaciPublished in: Appl. Soft Comput. (2018)
Keyphrases
- hybrid approaches
- bi objective
- frequent subgraph mining
- efficient solutions
- multi objective
- graph mining
- multi objective optimization
- graph clustering
- network design
- pattern mining
- frequent subgraphs
- ant colony optimization
- multiple objectives
- graph data
- shortest path problem
- nsga ii
- optimization algorithm
- particle swarm optimization
- optimal solution
- rewriting rules
- routing problem
- neural network
- data sources
- search space
- knapsack problem
- objective function