A fast and complete algorithm for enumerating pseudo-cliques in large graphs.
Hongjie ZhaiMakoto HaraguchiYoshiaki OkuboEtsuji TomitaPublished in: Int. J. Data Sci. Anal. (2016)
Keyphrases
- high accuracy
- worst case
- computational cost
- k means
- np hard
- cost function
- graph structure
- times faster
- experimental evaluation
- learning algorithm
- matching algorithm
- detection algorithm
- significant improvement
- search space
- probabilistic model
- spanning tree
- preprocessing
- expectation maximization
- theoretical analysis
- segmentation algorithm
- optimal solution
- similarity measure
- recognition algorithm
- graph isomorphism
- adjacency graph
- graph model
- genetic algorithm
- objective function
- lower bound
- evolutionary algorithm
- dynamic programming