Properties of the Sample Mean in Graph Spaces and the Majorize-Minimize-Mean Algorithm.
Brijnesh J. JainPublished in: CoRR (2015)
Keyphrases
- learning algorithm
- computational complexity
- search space
- detection algorithm
- experimental evaluation
- dynamic programming
- objective function
- breadth first search
- shortest path problem
- optimization algorithm
- expectation maximization
- significant improvement
- worst case
- particle swarm optimization
- computational cost
- cost function
- matching algorithm
- recognition algorithm
- graph structure
- graph model
- k means
- preprocessing
- tree structure
- spanning tree
- undirected graph
- graph construction
- dominating set