A batch algorithm for maintaining a topological order.
David J. PearcePaul H. J. KellyPublished in: ACSC (2010)
Keyphrases
- computationally efficient
- experimental evaluation
- learning algorithm
- high accuracy
- computational cost
- times faster
- theoretical analysis
- objective function
- simulated annealing
- preprocessing
- linear programming
- improved algorithm
- selection algorithm
- incremental learning
- detection algorithm
- genetic algorithm
- expectation maximization
- dynamic programming
- cost function
- significant improvement
- k means
- similarity measure
- search algorithm
- segmentation algorithm
- matching algorithm
- memory requirements
- search space
- association rules