A path algorithm for localizing anomalous activity in graphs.
James SharpnackPublished in: GlobalSIP (2013)
Keyphrases
- experimental evaluation
- learning algorithm
- k means
- np hard
- computational cost
- times faster
- computational complexity
- preprocessing
- optimization algorithm
- segmentation algorithm
- decision trees
- recognition algorithm
- linear programming
- high accuracy
- dynamic programming
- significant improvement
- objective function
- maximum common subgraph
- graph isomorphism
- hyper graph
- adjacency graph
- graph clustering
- optimal path
- graph partitioning
- graph structure
- evolutionary algorithm
- path planning
- matching algorithm
- expectation maximization
- probabilistic model
- simulated annealing