An improved N-tree algorithm for the enumeration of all neighbors of a degenerate vertex.
Ferdinand GeuePublished in: Ann. Oper. Res. (1993)
Keyphrases
- dynamic programming
- learning algorithm
- np hard
- tree structure
- experimental evaluation
- objective function
- matching algorithm
- high accuracy
- cost function
- k means
- significant improvement
- preprocessing
- optimal solution
- search space
- simulated annealing
- particle swarm optimization
- expectation maximization
- optimization algorithm
- mining high utility itemsets
- minimum length
- binary tree
- undirected graph
- times faster
- computational complexity
- theoretical analysis
- association rules