Counting connected graphs and hypergraphs via the probabilistic method.
Amin Coja-OghlanCristopher MooreVishal SanwalaniPublished in: Random Struct. Algorithms (2007)
Keyphrases
- experimental evaluation
- detection method
- input data
- dynamic programming
- probabilistic model
- synthetic data
- fully automatic
- computational cost
- clustering method
- main contribution
- computationally efficient
- mutual information
- feature set
- high accuracy
- support vector machine
- cost function
- significant improvement
- high precision
- closed form
- evaluation method
- neural network
- graph theory
- optimization method
- em algorithm
- higher order
- k means
- pairwise
- preprocessing
- computational complexity
- objective function
- information retrieval