A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling.
Sepehr AssadiMichael KapralovSanjeev KhannaPublished in: ITCS (2019)
Keyphrases
- k means
- computational cost
- computational complexity
- cost function
- monte carlo
- segmentation algorithm
- preprocessing
- high accuracy
- learning algorithm
- detection algorithm
- worst case
- dynamic programming
- significant improvement
- objective function
- edge information
- similarity measure
- sampling algorithm
- recognition algorithm
- gradient information
- convergence rate
- matching algorithm
- clustering method
- optimization algorithm
- expectation maximization
- feature selection