Multiple GCDs. probabilistic analysis of the plain algorithm.
Valérie BerthéJean CreusefondLoïck LhoteBrigitte ValléePublished in: ISSAC (2013)
Keyphrases
- learning algorithm
- detection algorithm
- single pass
- dynamic programming
- improved algorithm
- objective function
- preprocessing
- tree structure
- times faster
- computational cost
- high accuracy
- neural network
- memory requirements
- classification algorithm
- theoretical analysis
- computationally efficient
- np hard
- search space
- particle swarm optimization
- expectation maximization
- probabilistic model
- experimental evaluation
- data structure
- matching algorithm
- optimal solution
- bayesian networks
- posterior probability
- similarity measure
- data sets