A Non-iterative Parallelizable Eigenbasis Algorithm for Johnson Graphs.
Jackson AbascalAmadou BahMario BanuelosDavid UminskyOlivia VasquezPublished in: CoRR (2018)
Keyphrases
- optimization algorithm
- learning algorithm
- computational complexity
- preprocessing
- improved algorithm
- times faster
- worst case
- tree structure
- minimum spanning tree
- objective function
- detection algorithm
- experimental evaluation
- high accuracy
- iterative optimization
- graph structure
- expectation maximization
- neural network
- cost function
- multi objective
- significant improvement
- computational cost
- dynamic programming
- np hard
- convergence rate
- recognition algorithm
- spanning tree
- similarity measure
- graph clustering
- random graphs
- decision trees
- adjacency graph